Database Paper Browser

Back to papers

Applying Approximate Order Dependency to Reduce Indexing Space

Summary: Extends order dependencies to approximate satisfaction in the relational model. Analyzes two fundamental types of approximation, showing they can substantially reduce indexing space with little or no increase in access time. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2176
Venue
SIGMOD
Year
1982
Pagerank
6.6710739e-05
Overall Rank
3,879 | 73.02%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank Citing Paper Year Venue Pagerank
2,159 Sequential Dependencies 2009 VLDB 9.4130956e-05
4,744 Effective and Complete Discovery of Order Dependencies via Set-based Axiomatization 2017 VLDB 5.957936e-05
6,437 Fundamentals of Order Dependencies 2012 VLDB 5.0631488e-05
6,651 Sort Sets in the Relational Model* (extended abstract) 1983 PODS 4.9763125e-05
7,261 Expressiveness and Complexity of Order Dependencies 2013 VLDB 4.7861106e-05
10,140 Analyzing Deviations from Monotonic Trends through Database Repair 2026 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers