Efficiently Answering Top-k Typicality Queries on Large Databases
Summary: Applies psychological typicality to databases, defining top-k simple and discriminative typicality for representative or distinguishing instances. Presents approximations: linear-time tournament; VP-tree local typicality with guarantees; Local Typicality Tree index; experiments show practicality. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ming Hua
- 2. Jian Pei
- 3. Ada W. C. Fu
- 4. Xuemin Lin
- 5. Ho-Fung Leung
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,654 | Using Trees to Depict a Forest | 2009 | VLDB | 6.873144e-05 |
| 3,928 | Tighter Estimation using Bottom-k Sketches | 2008 | VLDB | 6.6254568e-05 |
| 4,080 | Sliding-Window Top-k Queries on Uncertain Streams | 2008 | VLDB | 6.4652983e-05 |
| 5,373 | Robust and Efficient Algorithms for Rank Join Evaluation | 2009 | SIGMOD | 5.5425231e-05 |
| 6,080 | Answering Top-k Representative Queries on Graph Databases | 2014 | SIGMOD | 5.2214553e-05 |
| 8,507 | ARCube: Supporting Ranking Aggregate Queries in Partially Materialized Data Cubes | 2008 | SIGMOD | 4.4955397e-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 |
|---|---|---|---|---|
| 7 | Optimal Aggregation Algorithms for Middleware [Extended Abstract] | 2001 | PODS | 0.0015496097 |
| 1,784 | Continuous Monitoring of Top-k Queries over Sliding Windows | 2006 | SIGMOD | 0.00010567363 |
| 2,933 | Answering Top-k Queries Using Views | 2006 | VLDB | 7.8679669e-05 |
| 4,711 | Answering Top-k Queries with Multi-Dimensional Selections: The Ranking Cube Approach | 2006 | VLDB | 5.9790683e-05 |
| 7,180 | Spatially-Decaying Aggregation Over a Network: Model and Algorithms | 2004 | SIGMOD | 4.807579e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,276 | Efficient and Generic Evaluation of Ranked Queries | 2011 | SIGMOD | 4.7798595e-05 |
| 2,933 | Answering Top-k Queries Using Views | 2006 | VLDB | 7.8679669e-05 |
| 3,665 | Ad-hoc Top-k Query Answering for Data Streams | 2007 | VLDB | 6.8633354e-05 |
| 7,963 | Efficient Top-K Processing Over Query-Dependent Functions | 2008 | VLDB | 4.613363e-05 |
| 9,351 | On Efficient Approximate Queries over Machine Learning Models | 2023 | VLDB | 4.3524472e-05 |
| 5,854 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD | 5.3006473e-05 |
| 7,135 | Anytime Measures for Top-k Algorithms | 2007 | VLDB | 4.8221884e-05 |
| 12,111 | Optimal Top-k Generation of Attribute Combinations based on Ranked Lists | 2012 | SIGMOD | 4.1945683e-05 |
| 12,135 | Answering Top-k Queries Over a Mixture of Attractive and Repulsive Dimensions | 2012 | VLDB | 4.1945683e-05 |
| 6,080 | Answering Top-k Representative Queries on Graph Databases | 2014 | SIGMOD | 5.2214553e-05 |