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
- 1. Kevin Chen-Chuan Chang (University of Illinois Urbana-Champaign)
- 2. Seung-won Hwang (University of Illinois Urbana-Champaign)
BibTeX Citation
@inproceedings{chang_sigmod02,
title = {{Minimal Probing: Supporting Expensive Predicates for Top-k Queries}},
author = {Chang, Kevin Chen-Chuan and Hwang, Seung-won},
series = {{SIGMOD} '02},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/564691.564731},
url = {https://dl.acm.org/doi/10.1145/564691.564731},
year = {2002}
}
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 |
|---|---|---|---|---|
| 1 | 13,483 | Supporting Hard Queries over Probabilistic Preferences | 2020 | VLDB |
| 2 | 1,441 | Efficient Processing of Top-k Spatial Preference Queries | 2011 | VLDB |
| 3 | 7,299 | Efficient and Generic Evaluation of Ranked Queries | 2011 | SIGMOD |
| 4 | 8,281 | Efficient Top-K Processing Over Query-Dependent Functions | 2008 | VLDB |
| 5 | 2,149 | Probabilistic Optimization of Top N Queries | 1999 | VLDB |
| 6 | 7,352 | Boolean + Ranking: Querying a Database by K-Constrained Optimization | 2006 | SIGMOD |
| 7 | 12,331 | Answering Top-k Queries Over a Mixture of Attractive and Repulsive Dimensions | 2012 | VLDB |
| 8 | 3,500 | Progressive and Selective Merge: Computing Top-K with Ad-hoc Ranking Functions | 2007 | SIGMOD |
| 9 | 50 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB |
| 10 | 12,308 | Optimal Top-k Generation of Attribute Combinations based on Ranked Lists | 2012 | SIGMOD |