DBScholar

Back to papers

Bypassing Joins in Disjunctive Queries

Summary: Extends bypass optimization from selections to joins in disjunctive queries, splitting outputs into join results and complements with independently optimized downstream plans. Develops optimal and partial near-optimal search, detecting semijoin-restricted complements to curb explosion and improve savings. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
8462
Venue
VLDB
Year
1995
Pagerank
7.2224287e-05
Overall Rank
3,656 | 74.92%
DOI
-

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{steinbrunn_vldb95,
        title = {{Bypassing Joins in Disjunctive Queries}},
        author = {Steinbrunn, Michael and Peithner, Klaus and Moerkotte, Guido and Kemper, Alfons},
        journal = {PVLDB},
        series = {{VLDB} '95},
        pages = {228--239},
        year = {1995}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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