DBScholar

Back to papers

Top-k Query Evaluation with Probabilistic Guarantees

Summary: Proposes approximate top-k algorithms using probabilistic bounds to prune candidates during index-list scans, reducing reliance on Fagin’s TA. Convolution-based bounds yield high-probability guarantees for early dropping, with experiments on Web and structured data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h0192d3cf68050cd5
Venue
VLDB
Year
2004
Pagerank
0.00010292787
Overall Rank
1,539 | 89.69%
DOI
10.1016/B978-012088469-8.50058-9

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{theobald_vldb04,
        title = {{Top-k Query Evaluation with Probabilistic Guarantees}},
        author = {Theobald, Martin and Weikum, Gerhard and Schenkel, Ralf},
        journal = {PVLDB},
        series = {{VLDB} '04},
        pages = {648--659},
        doi = {10.1016/B978-012088469-8.50058-9},
        url = {https://doi.org/10.1016/B978-012088469-8.50058-9},
        year = {2004}
}

Incoming Citations (Sorted by Pagerank)

Showing 25 of 25 citing papers.

Rank Citing Paper Year Venue Pagerank
1,447 Continuous Monitoring of Top-k Queries over Sliding Windows 2006 SIGMOD 0.00010604169
1,769 Structured Querying of Web Text: A Technical Challenge 2007 CIDR 9.6796356e-05
2,019 IO-Top-k: Index-access Optimized Top-k Query Processing 2006 VLDB 9.1666472e-05
2,406 Integrating DB and IR Technologies: What is the Sound of One Hand Clapping? * 2005 CIDR 8.4962449e-05
2,653 The SphereSearch Engine for Unified Ranked Retrieval of Heterogeneous XML and Web Documents 2005 VLDB 8.1494409e-05
2,880 KLEE: A Framework for Distributed Top-k Query Algorithms 2005 VLDB 7.8948229e-05
3,288 An Efficient and Versatile Query Engine for TopX Search 2005 VLDB 7.4398818e-05
3,391 Ad-hoc Top-k Query Answering for Data Streams 2007 VLDB 7.3290724e-05
5,918 On Efficient Approximate Queries over Machine Learning Models 2023 VLDB 5.9307869e-05
6,223 MINERVA: Collaborative P2P Search 2005 VLDB 5.8286278e-05
6,312 Ad-Hoc Aggregations of Ranked Lists in the Presence of Hierarchies 2008 SIGMOD 5.7971119e-05
6,997 A Scalable Index for Top-k Subtree Similarity Queries 2019 SIGMOD 5.6091287e-05
7,125 DeepEverest: Accelerating Declarative Top-K Queries for Deep Neural Network Interpretation 2022 VLDB 5.580601e-05
7,348 Anytime Measures for Top-k Algorithms 2007 VLDB 5.5302579e-05
7,449 Efficient and Flexible Information Retrieval Using MonetDB/X100 2007 CIDR 5.5107924e-05
7,637 Processing Top-k Join Queries 2010 VLDB 5.4630004e-05
9,321 A General Framework for Modeling and Processing Optimization Queries 2007 VLDB 5.1825641e-05
11,245 Approximating Opaque Top-k Queries 2025 SIGMOD 4.9605343e-05
12,499 Leveraging Graph Dimensions in Online Graph Search 2015 VLDB 4.9605343e-05
12,726 Efficient Rank Join with Aggregation Constraints 2011 VLDB 4.9605343e-05
12,802 An Access Cost-Aware Approach for Object Retrieval over Multiple Sources 2010 VLDB 4.9605343e-05
12,833 Skip-and-Prune: Cosine-based Top-K Query Processing for Efficient Context-Sensitive Document Retrieval 2009 SIGMOD 4.9605343e-05
12,880 Robust and Distributed Top-N Frequent-Pattern Mining With SAP BW Accelerator 2009 VLDB 4.9605343e-05
12,987 The TopX DB&IR Engine 2007 SIGMOD 4.9605343e-05
13,094 Database-Inspired Search 2005 VLDB 4.9605343e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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