Threshold Queries in Theory and in the Wild
Summary: Threshold queries (compute/count up to a bound) analyzed theoretically and empirically. They tighten asymptotic bounds for modern query evaluators, and real data show practical relevance where users want results only up to a threshold, independent of ranking. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Angela Bonifati (CNRS; University of Lyon)
- 2. Stefania Dumbrava (National School of Computer Science for Industry and Business; Polytechnic Institute of Paris)
- 3. George Fletcher (Eindhoven University of Technology)
- 4. Jan Hidders (Birkbeck, University of London)
- 5. Matthias Hofer (University of Bayreuth)
- 6. Wim Martens (University of Bayreuth)
- 7. Filip Murlak (University of Warsaw)
- 8. Joshua Shinavier (LinkedIn)
- 9. Sławek Staworko (CNRS; INRIA; University of Lille)
- 10. Dominik Tomaszuk (University of Bialystok)
BibTeX Citation
@article{bonifati_vldb22,
title = {{Threshold Queries in Theory and in the Wild}},
author = {Bonifati, Angela and Dumbrava, Stefania and Fletcher, George and Hidders, Jan and Hofer, Matthias and Martens, Wim and Murlak, Filip and Shinavier, Joshua and Staworko, Sławek and Tomaszuk, Dominik},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {5},
pages = {1105--1118},
doi = {10.14778/3510397.3510407},
url = {https://doi.org/10.14778/3510397.3510407},
year = {2022}
}
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,661 | PG-Schema: Schemas for Property Graphs | 2023 | SIGMOD | 0.00010079134 |
| 5,418 | Representing Paths in Graph Database Pattern Matching | 2023 | VLDB | 6.2255373e-05 |
| 9,012 | Towards Theory for Real-World Data | 2022 | PODS | 5.3323444e-05 |
| 11,084 | Exploring Exploratory Querying | 2025 | VLDB | 5.093636e-05 |
| 11,183 | Relational Algorithms for Top-k Query Evaluation | 2024 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 23 of 23 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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,967 | IO-Top-k: Index-access Optimized Top-k Query Processing | 2006 | VLDB |
| 2 | 8,281 | Efficient Top-K Processing Over Query-Dependent Functions | 2008 | VLDB |
| 3 | 10,776 | Relevance Queries for Interval Data | 2025 | SIGMOD |
| 4 | 2,062 | Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data | 2004 | VLDB |
| 5 | 9,044 | Threshold Query Optimization for Uncertain Data | 2010 | SIGMOD |
| 6 | 12,308 | Optimal Top-k Generation of Attribute Combinations based on Ranked Lists | 2012 | SIGMOD |
| 7 | 1,363 | Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach | 2008 | SIGMOD |
| 8 | 12,056 | Range Thresholding on Streams | 2016 | SIGMOD |
| 9 | 1,519 | Top-k Query Evaluation with Probabilistic Guarantees | 2004 | VLDB |
| 10 | 8,029 | Distributed Threshold Querying of General Functions by a Difference of Monotonic Representation | 2011 | VLDB |