DBScholar

Back to papers

Handling Redundancy in the Processing of Recursive Database Queries

Summary: Redundancy in recursive query processing: four levels. Techniques: subexpr sharing, frontier-based counting, tuple merge/filter, and level-relaxed I/O, yielding substantial redundancy reductions. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
hff4ddfecc3caa683
Venue
SIGMOD
Year
1987
Pagerank
6.4255719e-05
Overall Rank
4,768 | 67.95%
DOI
10.1145/38713.38727

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{han_sigmod87,
        title = {{Handling Redundancy in the Processing of Recursive Database Queries}},
        author = {Han, Jiawei and Henschen, Lawrence J.},
        series = {{SIGMOD} '87},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/38713.38727},
        url = {https://dl.acm.org/doi/10.1145/38713.38727},
        year = {1987}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
3,713 Compiling Separable Recursions 1988 SIGMOD 7.0770304e-05
9,347 Optimizing Recursive Queries in SQL 2005 SIGMOD 5.1900828e-05
9,689 Counting Methods for Cyclic Relations 1988 PODS 5.1406988e-05
11,126 Dynamic Pruning for Recursive Joins 2025 SIGMOD 4.9793485e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 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