Reverse Engineering Complex Join Queries
Summary: Efficient algorithm to reverse engineer a join query Q that generates a given output Out from D, supporting arbitrary join graphs beyond prior structural constraints. Uses a star-based decomposition with merge steps forming a lattice over graphs, enabling principled pruning, optimizations, and scalable discovery of equi-join on PK/FK; evaluated on benchmarks, showing accuracy and scalability. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Meihui Zhang (National University of Singapore)
- 2. Hazem Elmeleegy (Turn Inc.)
- 3. Cecilia M. Procopiuc (AT&T)
- 4. Divesh Srivastava (AT&T)
BibTeX Citation
@inproceedings{zhang_sigmod13,
title = {{Reverse Engineering Complex Join Queries}},
author = {Zhang, Meihui and Elmeleegy, Hazem and Procopiuc, Cecilia M. and Srivastava, Divesh},
series = {{SIGMOD} '13},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2463676.2465320},
url = {https://dl.acm.org/doi/10.1145/2463676.2465320},
year = {2013}
}
Incoming Citations (Sorted by Pagerank)
Showing 21 of 21 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 272 | BLINKS: Ranked Keyword Searches on Graphs | 2007 | SIGMOD | 0.00022695855 |
| 517 | Query by Output | 2009 | SIGMOD | 0.00017169735 |
| 1,214 | SODA: Generating SQL for Business Users | 2012 | VLDB | 0.0001163751 |
| 1,555 | Keyword Search in Databases: The Power of RDBMS | 2009 | SIGMOD | 0.00010370683 |
| 1,751 | Sample-Driven Schema Mapping | 2012 | SIGMOD | 9.838446e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,262 | Discovering Queries based on Example Tuples | 2014 | SIGMOD |
| 2 | 1,052 | Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins | 1990 | SIGMOD |
| 3 | 3,572 | Summary Graphs for Relational Database Schemas | 2011 | VLDB |
| 4 | 3,263 | Hypergraph based reorderings of outer join queries with complex predicates | 1995 | SIGMOD |
| 5 | 11,909 | Improving Join Reorderability with Compensation Operators | 2018 | SIGMOD |
| 6 | 1,286 | Adaptive Optimization of Very Large Join Queries | 2018 | SIGMOD |
| 7 | 316 | Measuring the Complexity of Join Enumeration in Query Optimization | 1990 | VLDB |
| 8 | 6,678 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS |
| 9 | 3,813 | Query Simplification: Graceful Degradation for Join-Order Optimization | 2009 | SIGMOD |
| 10 | 2,631 | FastQRE: Fast Query Reverse Engineering | 2018 | SIGMOD |