DBScholar

Back to papers

Efficiently Approximating Query Optimizer Plan Diagrams

Summary: Efficiently approximates plan diagrams for parametric SQL templates via sampling and monotonicity across optimizer APIs (optimal, suboptimal, ranked). TPC-H/DS shows ~90% accuracy at <15% overhead; zero-error for optimizers with <10% overhead; Picasso. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9948
Venue
VLDB
Year
2008
Pagerank
6.4944225e-05
Overall Rank
4,817 | 66.96%
DOI
10.14778/1454159.1454173

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{dey_vldb08,
        title = {{Efficiently Approximating Query Optimizer Plan Diagrams}},
        author = {Dey, Atreyee and Bhaumik, Sourjya and D., Harish and Haritsa, Jayant R.},
        journal = {PVLDB},
        series = {{VLDB} '08},
        volume = {1},
        number = {1},
        pages = {1325--1336},
        doi = {10.14778/1454159.1454173},
        url = {https://doi.org/10.14778/1454159.1454173},
        year = {2008}
}

Incoming Citations (Sorted by Pagerank)

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