DBScholar

Back to papers

An Extended Relational Algebra with Control Over Duplicate Elimination

Summary: Extends relational algebra to multiset relations with explicit control over duplicate elimination, and frames queries in extended algebra, tableaux, and DAPLEX. Proves conjunctive-equivalence decidable via tableaux but NP-complete, and shows extended algebra and DAPLEX have essentially the same conjunctive expressiveness. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
617
Venue
PODS
Year
1982
Pagerank
0.00012207515
Overall Rank
1,095 | 92.49%
DOI
10.1145/588111.588132

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{dayal_pods82,
        address = {New York, NY, USA},
        series = {{PODS} '82},
        title = {{An Extended Relational Algebra with Control Over Duplicate Elimination}},
        url = {https://dl.acm.org/doi/10.1145/588111.588132},
        doi = {10.1145/588111.588132},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Dayal, Umeshwar and Goodman, Nathan and Katz, Randy H.},
        year = {1982}
}

Incoming Citations (Sorted by Pagerank)

Showing 15 of 15 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
15 The Functional Data Model and the Data Language DAPLEX 1979 SIGMOD 0.00061144858
97 Efficient Optimization of a Class of Relational Expressions 1978 SIGMOD 0.00034574497
Previous Page 1 / 1 Next

Semantically Similar Papers