Database Paper Browser

Back to papers

Overbound and Right-Linear Queries

Summary: Proposes partial-SIPS optimizations for a subclass of linear recursive Datalog queries, giving an algorithm that outperforms full-SIPS techniques (magic-sets/right-linear) and syntactically characterizes when partial SIPS are strictly preferable. Also compares context right-linear vs. magic-sets for optimizer choice and shows right- and left-linear programs are syntactic duals. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
931
Venue
PODS
Year
1991
Pagerank
7.1232056e-05
Overall Rank
3,414 | 76.26%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

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.

Rank Cited Paper Year Venue Pagerank
1,423 Magic is Relevant 1990 SIGMOD 0.00012054867
2,042 Efficient Evaluation of Right-, Left-, and Multi-Linear Rules 1989 SIGMOD 9.699257e-05
2,474 Graph-Theoretic Methods In Database Theory 1990 PODS 8.7135761e-05
3,585 Right-, left- and multi-linear rule transformations that maintain context information 1990 VLDB 6.9454028e-05
5,492 Mixed-Approach Algorithms for Transitive Closure 1991 PODS 5.4771871e-05
6,876 Modular Acyclicity and Tail Recursion in Logic Programs 1991 PODS 4.8977465e-05
Previous Page 1 / 1 Next

Semantically Similar Papers