DBScholar

Back to papers

Optimizing Disjunctive Queries with Expensive Predicates

Summary: Proposes bypass processing to optimize disjunctive queries with expensive predicates, skipping costly terms when cheaper ones suffice. Extends a query optimizer and compares three bypass-plan generation algorithms to show viability. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2800
Venue
SIGMOD
Year
1994
Pagerank
9.6721003e-05
Overall Rank
1,826 | 87.48%
DOI
10.1145/191839.191906

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{kemper_sigmod94,
        title = {{Optimizing Disjunctive Queries with Expensive Predicates}},
        author = {Kemper, A. and Moerkotte, G. and Peithner, K. and Steinbrunn, M.},
        series = {{SIGMOD} '94},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/191839.191906},
        url = {https://dl.acm.org/doi/10.1145/191839.191906},
        year = {1994}
}

Incoming Citations (Sorted by Pagerank)

Showing 14 of 14 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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