DBScholar

Back to papers

On the Power of Algebras with Recursion

Summary: Explores recursion and negation in algebraic query languages, extending beyond fixed-point algebras and stratified deductive programs. Shows that queries expressible by general deduction with negation under valid semantics are captured by algebras with recursive definitions. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2720
Venue
SIGMOD
Year
1993
Pagerank
5.6612789e-05
Overall Rank
7,260 | 50.20%
DOI
10.1145/170035.170090

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{beeri_sigmod93,
        title = {{On the Power of Algebras with Recursion}},
        author = {Beeri, Catriel and Milo, Tova},
        series = {{SIGMOD} '93},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/170035.170090},
        url = {https://dl.acm.org/doi/10.1145/170035.170090},
        year = {1993}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
2,461 Towards Tractable Algebras for Bags (Extended Abstract) 1993 PODS 8.550394e-05
7,196 Typed Query Languages for Databases Containing Queries 1998 PODS 5.6764289e-05
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.

Previous Page 1 / 1 Next

Semantically Similar Papers