HYBRID SYNTHETIC DATA GENERATION FOR RELATIONAL DATABASES USING CONSTRAINT-AWARE OPTIMIZATION

The generation of high-quality synthetic data for relational databases has challenges regarding scalability, statistical accuracy, and the implementation of referential integrity. In this research study, we present a hybrid approach for synthetic data generation via an adaptive convex combination model to systematically integrate real and synthetic data. Relational schemas are characterized as CW complexes through sheaf theory to guarantee acyclic dependence resolution and to uphold foreign key constraints. This approach strengthens the enforcement of referential integrity with near-linear complexity and improves compute performance with GPU-accelerated θ-joins. The minimizing of Jensen-Shannon divergence ensures that synthetic data retains the structural and statistical properties of real data, hence constantly adjusting the blending factor. In comparison to existing methodologies, empirical validation with TPC-H and Postgres datasets demonstrates enhanced preservation of referential integrity, superior statistical integrity, and more computational scalability. This approach facilitates machine learning, database benchmarking, and privacy-preserving analytics.

Authors

Publication Details

Published
2025-06-15
DOI
https://doi.org/10.21667/978-5-7722-0426-9-266-271
Primary Topic
Data Management and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

HYBRID SYNTHETIC DATA GENERATION FOR RELATIONAL DATABASES USING CONSTRAINT-AWARE OPTIMIZATION

Maryam Abdi, A.I. Baranchikov
Data Management and Algorithms
article

HYBRID SYNTHETIC DATA GENERATION FOR RELATIONAL DATABASES USING CONSTRAINT-AWARE OPTIMIZATION

Maryam Abdi, A.I. Baranchikov
article en

Abstract

The generation of high-quality synthetic data for relational databases has challenges regarding scalability, statistical accuracy, and the implementation of referential integrity. In this research study, we present a hybrid approach for synthetic data generation via an adaptive convex combination model to systematically integrate real and synthetic data. Relational schemas are characterized as CW complexes through sheaf theory to guarantee acyclic dependence resolution and to uphold foreign key constraints. This approach strengthens the enforcement of referential integrity with near-linear complexity and improves compute performance with GPU-accelerated θ-joins. The minimizing of Jensen-Shannon divergence ensures that synthetic data retains the structural and statistical properties of real data, hence constantly adjusting the blending factor. In comparison to existing methodologies, empirical validation with TPC-H and Postgres datasets demonstrates enhanced preservation of referential integrity, superior statistical integrity, and more computational scalability. This approach facilitates machine learning, database benchmarking, and privacy-preserving analytics.

Openalex Percentile: Top 73%
Data Management and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

HYBRID SYNTHETIC DATA GENERATION FOR RELATIONAL DATABASES USING CONSTRAINT-AWARE OPTIMIZATION — Maryam Abdi, A.I. Baranchikov · (2025) | TGRS Research Map | TGRS