Minimal Probing: Supporting Expensive Predicates for Top-k Queries
Summary: Necessary-probe principle for top-k queries with expensive predicates (external UDFs, fuzzy similarity) that defy zero-time indexing. MPro is provably optimal, parallelizable, and dramatically reduces probes versus full probing; demonstrated on real-estate and synthetic data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 32 of 32 citing papers.
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
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 13,281 | Supporting Hard Queries over Probabilistic Preferences | 2020 | VLDB | - |
| 1,403 | Efficient Processing of Top-k Spatial Preference Queries | 2011 | VLDB | 0.00012176993 |
| 7,276 | Efficient and Generic Evaluation of Ranked Queries | 2011 | SIGMOD | 4.7798595e-05 |
| 7,963 | Efficient Top-K Processing Over Query-Dependent Functions | 2008 | VLDB | 4.613363e-05 |
| 7,468 | Boolean + Ranking: Querying a Database by K-Constrained Optimization | 2006 | SIGMOD | 4.7210446e-05 |
| 2,556 | Probabilistic Optimization of Top N Queries | 1999 | VLDB | 8.5465733e-05 |
| 12,135 | Answering Top-k Queries Over a Mixture of Attractive and Repulsive Dimensions | 2012 | VLDB | 4.1945683e-05 |
| 3,908 | Progressive and Selective Merge: Computing Top-K with Ad-hoc Ranking Functions | 2007 | SIGMOD | 6.6392878e-05 |
| 74 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB | 0.00057857292 |
| 12,111 | Optimal Top-k Generation of Attribute Combinations based on Ranked Lists | 2012 | SIGMOD | 4.1945683e-05 |