Database Paper Browser

Back to papers

Sort Sets in the Relational Model* (extended abstract)

Summary: Introduce 'sort set' to formalize simultaneous ordering of multiple attributes; characterize when order dependencies imply sort sets and exploit them for implementation/optimization. Give finite complete axioms for sort-set dependencies (implication polytime; with FDs co-NP-complete) and define 'separators' generalizing Armstrong relations. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
670
Venue
PODS
Year
1983
Pagerank
4.9763125e-05
Overall Rank
6,651 | 53.74%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
2,159 Sequential Dependencies 2009 VLDB 9.4130956e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers