Effective and Complete Discovery of Order Dependencies via Set-based Axiomatization
Summary: Novel OD discovery via a polynomial mapping to a canonical OD form; sound, complete axioms for canonical ODs. Exponential in attributes (O(2^|R|)) but linear in tuples; yields a complete, minimal OD set with speedups over prior work. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jaroslaw Szlichta
- 2. Parke Godfrey
- 3. Lukasz Golab
- 4. Mehdi Kargar
- 5. Divesh Srivastava
Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,253 | Efficient Denial Constraint Discovery with Hydra | 2018 | VLDB | 9.1937209e-05 |
| 3,467 | Data Profiling – A Tutorial | 2017 | SIGMOD | 7.069081e-05 |
| 5,192 | Pattern Functional Dependencies for Data Cleaning | 2020 | VLDB | 5.6375087e-05 |
| 5,613 | Distributed implementations of dependency discovery algorithms | 2019 | VLDB | 5.4102298e-05 |
| 6,756 | Fast Incremental Discovery of Pointwise Order Dependencies | 2020 | VLDB | 4.9379361e-05 |
| 7,127 | Guided automated learning for query workload re-optimization | 2019 | VLDB | 4.8230386e-05 |
| 8,836 | Fast Approximate Denial Constraint Discovery | 2023 | VLDB | 4.4393184e-05 |
| 9,749 | Efficient Differential Dependency Discovery | 2024 | VLDB | 4.2897489e-05 |
| 10,587 | Efficient Discovery of Relaxed Functional Dependencies | 2025 | VLDB | 4.1945683e-05 |
| 11,010 | Mixed Covers of Keys and Functional Dependencies for Maintaining the Integrity of Data under Updates | 2024 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1 | Access Path Selection in a Relational Database Management System | 1979 | SIGMOD | 0.0040449103 |
| 555 | Discovering Denial Constraints | 2013 | VLDB | 0.00020254908 |
| 623 | Improving Data Quality: Consistency and Accuracy | 2007 | VLDB | 0.00018996374 |
| 907 | Fundamental Techniques for Order Optimization | 1996 | SIGMOD | 0.00015435983 |
| 1,047 | Functional Dependency Discovery: An Experimental Evaluation of Seven Algorithms | 2015 | VLDB | 0.00014459715 |
| 2,159 | Sequential Dependencies | 2009 | VLDB | 9.4130956e-05 |
| 3,879 | Applying Approximate Order Dependency to Reduce Indexing Space | 1982 | SIGMOD | 6.6710739e-05 |
| 4,045 | Optimizing Nested Queries with Parameter Sort Orders | 2005 | VLDB | 6.4985218e-05 |
| 6,437 | Fundamentals of Order Dependencies | 2012 | VLDB | 5.0631488e-05 |
| 7,261 | Expressiveness and Complexity of Order Dependencies | 2013 | VLDB | 4.7861106e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,483 | Discovery of Approximate (and Exact) Denial Constraints | 2020 | VLDB | 8.6864916e-05 |
| 3,879 | Applying Approximate Order Dependency to Reduce Indexing Space | 1982 | SIGMOD | 6.6710739e-05 |
| 581 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS | 0.00019767772 |
| 3,917 | On The Complexity And Axiomatizability Of Consistent Database States | 1984 | PODS | 6.6328189e-05 |
| 25 | Dependency Inference (Extended Abstract) | 1987 | VLDB | 0.00083101742 |
| 555 | Discovering Denial Constraints | 2013 | VLDB | 0.00020254908 |
| 10,587 | Efficient Discovery of Relaxed Functional Dependencies | 2025 | VLDB | 4.1945683e-05 |
| 6,756 | Fast Incremental Discovery of Pointwise Order Dependencies | 2020 | VLDB | 4.9379361e-05 |
| 6,437 | Fundamentals of Order Dependencies | 2012 | VLDB | 5.0631488e-05 |
| 7,261 | Expressiveness and Complexity of Order Dependencies | 2013 | VLDB | 4.7861106e-05 |