Database Paper Browser

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
2658
Venue
SIGMOD
Year
1993
Pagerank
5.02287e-05
Overall Rank
6,539 | 54.52%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
2,546 Towards Tractable Algebras for Bags (Extended Abstract) 1993 PODS 8.5701687e-05
6,664 Typed Query Languages for Databases Containing Queries 1998 PODS 4.9699875e-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