Database Paper Browser

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
2738
Venue
SIGMOD
Year
1994
Pagerank
0.0001061019
Overall Rank
1,772 | 87.68%
DOI
-

Incoming Non-self Citations Over Time

Authors

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