DBScholar

Back to papers

Depth Estimation for Ranking Query Optimization

Summary: DEEP estimates rank-join input depth—the key cost driver—by modeling the joint score distribution across base tables. Efficient algorithms integrate this principled, data-aware framework into optimizers, outperforming prior estimation techniques. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
hdeb5ee2b9e96a7a3
Venue
VLDB
Year
2007
Pagerank
5.55407e-05
Overall Rank
7,266 | 51.30%
DOI
-

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{schnaitter_vldb07,
        title = {{Depth Estimation for Ranking Query Optimization}},
        author = {Schnaitter, Karl and Spiegel, Joshua and Polyzotis, Neoklis},
        journal = {PVLDB},
        series = {{VLDB} '07},
        pages = {902--913},
        year = {2007}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
2,625 Evaluating Rank Joins with Optimal Cost 2008 PODS 8.1948138e-05
4,730 Optimal Join Algorithms Meet Top-k 2020 SIGMOD 6.4313418e-05
5,254 Robust and Efficient Algorithms for Rank Join Evaluation 2009 SIGMOD 6.1964074e-05
5,783 Proximity Rank Join 2010 VLDB 5.9780797e-05
7,846 Sharing Work in Keyword Search over Databases 2011 SIGMOD 5.4254046e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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