Expressiveness and Complexity of Order Dependencies
Summary: Characterizes a hierarchy of order dependencies (ODs) and UODs tied to SQL lexicographic ordering. Establishes coNP-completeness of general inference, but tractable FD inference from UODs and polynomial restricted-domain UOD reasoning, with query-optimization applications. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jaroslaw Szlichta (IBM Center for Advanced Studies Toronto; University of Toronto)
- 2. Parke Godfrey (York University)
- 3. Jarek Gryz (York University)
- 4. Calisto Zuzarte (IBM)
BibTeX Citation
@article{szlichta_vldb13,
title = {{Expressiveness and Complexity of Order Dependencies}},
author = {Szlichta, Jaroslaw and Godfrey, Parke and Gryz, Jarek and Zuzarte, Calisto},
journal = {PVLDB},
series = {{VLDB} '13},
volume = {6},
number = {14},
pages = {1858--1869},
doi = {10.14778/2733085.2733088},
url = {https://doi.org/10.14778/2733085.2733088},
year = {2013}
}Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,454 | Effective and Complete Discovery of Order Dependencies via Set-based Axiomatization | 2017 | VLDB | 6.6929626e-05 |
| 6,720 | Fast Incremental Discovery of Pointwise Order Dependencies | 2020 | VLDB | 5.794237e-05 |
| 7,982 | Fast Approximate Denial Constraint Discovery | 2023 | VLDB | 5.5138609e-05 |
| 9,923 | Efficient Differential Dependency Discovery | 2024 | VLDB | 5.1955087e-05 |
| 10,848 | Efficient Discovery of Relaxed Functional Dependencies | 2025 | VLDB | 5.093636e-05 |
| 10,928 | How and Why False Denial Constraints are Discovered | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 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.0024089429 |
| 744 | Fundamental Techniques for Order Optimization | 1996 | SIGMOD | 0.00014411295 |
| 1,842 | Sequential Dependencies | 2009 | VLDB | 9.6345922e-05 |
| 3,763 | Applying Approximate Order Dependency to Reduce Indexing Space | 1982 | SIGMOD | 7.144792e-05 |
| 3,816 | Optimizing Nested Queries with Parameter Sort Orders | 2005 | VLDB | 7.1002641e-05 |
| 6,114 | Fundamentals of Order Dependencies | 2012 | VLDB | 5.9713126e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,720 | Fast Incremental Discovery of Pointwise Order Dependencies | 2020 | VLDB |
| 2 | 13,259 | A Theory Of Data Dependencies Over Relational Expressions | 1982 | PODS |
| 3 | 5,523 | Dense-Order Constraint Databases (Extended Abstract) | 1995 | PODS |
| 4 | 2,047 | Functional and Inclusion Dependencies: A Graph Theoretic Approach | 1984 | PODS |
| 5 | 7,126 | Sort Sets in the Relational Model* (extended abstract) | 1983 | PODS |
| 6 | 3,763 | Applying Approximate Order Dependency to Reduce Indexing Space | 1982 | SIGMOD |
| 7 | 633 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS |
| 8 | 203 | Dependency Inference | 1987 | VLDB |
| 9 | 4,454 | Effective and Complete Discovery of Order Dependencies via Set-based Axiomatization | 2017 | VLDB |
| 10 | 6,114 | Fundamentals of Order Dependencies | 2012 | VLDB |