Database Paper Browser

Back to papers

Detecting Redundant Tuples During Query Evaluation

Summary: Introduce lightweight run-time tests to detect redundant tuples in bottom-up evaluation of logic programs, cutting duplicate generation and other waste. Leverage data-independent predicate properties (emptiness, used-at-most-once) plus selective run-time info for efficient optimization. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
930
Venue
PODS
Year
1991
Pagerank
4.1945683e-05
Overall Rank
12,905 | 10.23%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
7,884 Finding Nonrecursive Envelopes for Datalog Predicates 1993 PODS 4.6277758e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

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

Rank Cited Paper Year Venue Pagerank
200 OPTIMIZING DATALOG PROGRAMS (Extended Abstract) 1987 PODS 0.00035012858
365 On the Power of Magic 1987 PODS 0.00025585898
1,991 Decidability and Undecidability Results for Boundedness of Linear Recursive Queries 1988 PODS 9.84713e-05
2,036 Proof-Tree Transformation Theorems and Their Applications 1989 PODS 9.714898e-05
7,978 How to Forget the Past Without Repeating It 1990 VLDB 4.613363e-05
Previous Page 1 / 1 Next

Semantically Similar Papers