DBScholar

Back to papers

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)

Paper ID
4512
Venue
SIGMOD
Year
2011
Pagerank
5.7850397e-05
Overall Rank
6,746 | 53.72%
DOI
10.1145/1989323.1989429

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{li_sigmod11,
        title = {{Flexible Aggregate Similarity Search}},
        author = {Li, Yang and Li, Feifei and Yi, Ke and Yao, Bin and Wang, Min},
        series = {{SIGMOD} '11},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1989323.1989429},
        url = {https://dl.acm.org/doi/10.1145/1989323.1989429},
        year = {2011}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
4,850 Nearest-Neighbor Searching Under Uncertainty 2012 PODS 6.480347e-05
6,251 The Flexible Socio Spatial Group Queries 2019 VLDB 5.9415675e-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.

Previous Page 1 / 1 Next

Semantically Similar Papers