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 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,465 | Effective and Complete Discovery of Order Dependencies via Set-based Axiomatization | 2017 | VLDB | 6.5873563e-05 |
| 5,280 | Fast Approximate Denial Constraint Discovery | 2023 | VLDB | 6.1992888e-05 |
| 6,855 | Fast Incremental Discovery of Pointwise Order Dependencies | 2020 | VLDB | 5.6642528e-05 |
| 10,106 | Efficient Differential Dependency Discovery | 2024 | VLDB | 5.0789354e-05 |
| 10,877 | Window Function Optimization: Co-Evaluation and Other Techniques | 2026 | VLDB | 4.9793485e-05 |
| 11,254 | Efficient Discovery of Relaxed Functional Dependencies | 2025 | VLDB | 4.9793485e-05 |
| 11,319 | How and Why False Denial Constraints are Discovered | 2025 | VLDB | 4.9793485e-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.0023947656 |
| 724 | Fundamental Techniques for Order Optimization | 1996 | SIGMOD | 0.00014477566 |
| 1,887 | Sequential Dependencies | 2009 | VLDB | 9.4321643e-05 |
| 3,824 | Applying Approximate Order Dependency to Reduce Indexing Space | 1982 | SIGMOD | 7.0028668e-05 |
| 3,865 | Optimizing Nested Queries with Parameter Sort Orders | 2005 | VLDB | 6.962283e-05 |
| 6,171 | Fundamentals of Order Dependencies | 2012 | VLDB | 5.8623235e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,855 | Fast Incremental Discovery of Pointwise Order Dependencies | 2020 | VLDB |
| 2 | 13,549 | A Theory Of Data Dependencies Over Relational Expressions | 1982 | PODS |
| 3 | 2,098 | Functional and Inclusion Dependencies: A Graph Theoretic Approach | 1984 | PODS |
| 4 | 5,658 | Dense-Order Constraint Databases (Extended Abstract) | 1995 | PODS |
| 5 | 7,273 | Sort Sets in the Relational Model* (extended abstract) | 1983 | PODS |
| 6 | 3,824 | Applying Approximate Order Dependency to Reduce Indexing Space | 1982 | SIGMOD |
| 7 | 642 | The Complexity of Querying Indefinite Data about Linearly Ordered Domains (Preliminary Version) | 1992 | PODS |
| 8 | 209 | Dependency Inference | 1987 | VLDB |
| 9 | 4,465 | Effective and Complete Discovery of Order Dependencies via Set-based Axiomatization | 2017 | VLDB |
| 10 | 6,171 | Fundamentals of Order Dependencies | 2012 | VLDB |