DBScholar

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
669
Venue
PODS
Year
1983
Pagerank
5.695798e-05
Overall Rank
7,126 | 51.11%
DOI
10.1145/588058.588098

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{ginsburg_pods83,
        address = {New York, NY, USA},
        series = {{PODS} '83},
        title = {{Sort Sets in the Relational Model* (extended abstract)}},
        url = {https://dl.acm.org/doi/10.1145/588058.588098},
        doi = {10.1145/588058.588098},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Ginsburg, Seymour and Hull, Richard},
        year = {1983}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
1,842 Sequential Dependencies 2009 VLDB 9.6345922e-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