Efficiently Answering Top-k Typicality Queries on Large Databases
Summary: Introduces top-k typicality queries, including simple and discriminative typicality, to identify representative or class-distinguishing objects. Avoids quadratic exact computation via linear randomized tournaments and VP-tree/Local Typicality Tree approximations with quality guarantees. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ming Hua (Simon Fraser University)
- 2. Jian Pei (Simon Fraser University)
- 3. Ada W. C. Fu (Chinese University of Hong Kong)
- 4. Xuemin Lin (National Information and Communications Technology Australia; University of New South Wales)
- 5. Ho-Fung Leung (Chinese University of Hong Kong)
BibTeX Citation
@article{hua_vldb07,
title = {{Efficiently Answering Top-k Typicality Queries on Large Databases}},
author = {Hua, Ming and Pei, Jian and Fu, Ada W. C. and Lin, Xuemin and Leung, Ho-Fung},
journal = {PVLDB},
series = {{VLDB} '07},
pages = {890},
year = {2007}
}Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,328 | Sliding-Window Top-k Queries on Uncertain Streams | 2008 | VLDB | 7.4194442e-05 |
| 3,540 | Tighter Estimation using Bottom k Sketches | 2008 | VLDB | 7.2127867e-05 |
| 3,965 | Using Trees to Depict a Forest | 2009 | VLDB | 6.8890329e-05 |
| 5,233 | Robust and Efficient Algorithms for Rank Join Evaluation | 2009 | SIGMOD | 6.2167391e-05 |
| 6,030 | Answering Top-k Representative Queries on Graph Databases | 2014 | SIGMOD | 5.9085169e-05 |
| 8,824 | ARCube: Supporting Ranking Aggregate Queries in Partially Materialized Data Cubes | 2008 | SIGMOD | 5.2685089e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5 | Optimal Aggregation Algorithms for Middleware [Extended Abstract] | 2001 | PODS | 0.0010679903 |
| 1,441 | Continuous Monitoring of Top-k Queries over Sliding Windows | 2006 | SIGMOD | 0.00010638056 |
| 2,561 | Answering Top-k Queries Using Views | 2006 | VLDB | 8.2940439e-05 |
| 4,651 | Answering Top-k Queries with Multi-Dimensional Selections: The Ranking Cube Approach | 2006 | VLDB | 6.4836419e-05 |
| 7,799 | Spatially-Decaying Aggregation Over a Network: Model and Algorithms | 2004 | SIGMOD | 5.4490738e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,396 | Efficient and Generic Evaluation of Ranked Queries | 2011 | SIGMOD |
| 2 | 3,380 | Ad-hoc Top-k Query Answering for Data Streams | 2007 | VLDB |
| 3 | 2,561 | Answering Top-k Queries Using Views | 2006 | VLDB |
| 4 | 8,458 | Efficient Top-K Processing Over Query-Dependent Functions | 2008 | VLDB |
| 5 | 5,481 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD |
| 6 | 5,905 | On Efficient Approximate Queries over Machine Learning Models | 2023 | VLDB |
| 7 | 7,329 | Anytime Measures for Top-k Algorithms | 2007 | VLDB |
| 8 | 12,605 | Optimal Top-k Generation of Attribute Combinations based on Ranked Lists | 2012 | SIGMOD |
| 9 | 12,628 | Answering Top-k Queries Over a Mixture of Attractive and Repulsive Dimensions | 2012 | VLDB |
| 10 | 6,030 | Answering Top-k Representative Queries on Graph Databases | 2014 | SIGMOD |