Database Paper Browser

Back to papers

Expressiveness and Complexity of Order Dependencies

Summary: ODs and UODs over lexicographic orderings; a hierarchy of OD classes with implications for SQL ORDER BY and query optimization. Key results: co-NP-complete inference for UODs/ODs; co-NP for FDs from ODs (linear for FDs from UODs); complete OD-elimination; polynomial inference for UODs on restricted domains. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10672
Venue
VLDB
Year
2013
Pagerank
4.7861106e-05
Overall Rank
7,261 | 49.49%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

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.0040449103
907 Fundamental Techniques for Order Optimization 1996 SIGMOD 0.00015435983
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
Previous Page 1 / 1 Next

Semantically Similar Papers