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)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Surajit Chaudhuri (Stanford University)
BibTeX Citation
@inproceedings{chaudhuri_pods91,
address = {New York, NY, USA},
series = {{PODS} '91},
title = {{Detecting Redundant Tuples During Query Evaluation}},
url = {https://dl.acm.org/doi/10.1145/113413.113424},
doi = {10.1145/113413.113424},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Chaudhuri, Surajit},
year = {1991}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,055 | Finding Nonrecursive Envelopes for Datalog Predicates | 1993 | PODS | 5.3979237e-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 |
|---|---|---|---|---|
| 317 | OPTIMIZING DATALOG PROGRAMS (Extended Abstract) | 1987 | PODS | 0.00021220438 |
| 352 | On the Power of Magic | 1987 | PODS | 0.00020223279 |
| 1,830 | Decidability and Undecidability Results for Boundedness of Linear Recursive Queries | 1988 | PODS | 9.5498891e-05 |
| 2,024 | Proof-Tree Transformation Theorems and Their Applications | 1989 | PODS | 9.166955e-05 |
| 8,464 | How to Forget the Past Without Repeating It | 1990 | VLDB | 5.3350162e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,098 | A General Framework for the Optimization of Object-Oriented Queries | 1992 | SIGMOD |
| 2 | 2,516 | Optimization of Queries with User-defined Predicates | 1996 | VLDB |
| 3 | 4,459 | Semantic Query Optimization in the Presence of Types | 2010 | PODS |
| 4 | 8,053 | Polynomial-time program transformations in deductive databases | 1990 | PODS |
| 5 | 6,871 | Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries | 1990 | VLDB |
| 6 | 11,483 | Query Optimization by Quantifier Elimination | 2024 | PODS |
| 7 | 13,389 | Structural Query Optimization — A Uniform Framework For Semantic Query Optimization In Deductive Databases | 1991 | PODS |
| 8 | 4,768 | Handling Redundancy in the Processing of Recursive Database Queries | 1987 | SIGMOD |
| 9 | 3,886 | Constraints and Redundancy in Datalog | 1992 | PODS |
| 10 | 7,834 | Space Optimization in the Bottom-Up Evaluation of Logic Programs | 1991 | SIGMOD |