Flexible Aggregate Similarity Search
Summary: Introduces flexible aggregate similarity (FANN), extending ANN by aggregating distances to any subset of Q with phi in (0,1). Proposes exact and approximate algorithms; simple, efficient, constant-factor guarantees in any dimension; strong empirical results from 2–74D. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,724 | Nearest-Neighbor Searching Under Uncertainty | 2012 | PODS | 5.9697823e-05 |
| 6,499 | The Flexible Socio Spatial Group Queries | 2019 | VLDB | 5.0382007e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 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 |
| 34 | Similarity Search in High Dimensions via Hashing | 1999 | VLDB | 0.00076637636 |
| 47 | Nearest Neighbor Queries | 1995 | SIGMOD | 0.0007015885 |
| 91 | M-tree: An Efficient Access Method for Similarity Search in Metric Spaces | 1997 | VLDB | 0.0005181666 |
| 682 | Quality and Efficiency in High Dimensional Nearest Neighbor Search | 2009 | SIGMOD | 0.00018201541 |
| 709 | Efficient Similarity Search and Classification via Rank Aggregation | 2003 | SIGMOD | 0.00017768547 |
Previous
Page 1 / 1
Next