Flexible aggregate similarity search

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2011, Pages 1009-1020

  Li, Yang ^a   Li, Feifei ^b   Yi, Ke ^c   Yao, Bin ^b   Wang, Min ^d  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b FLORIDA STATE UNIVERSITY   (United States)

^c HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^d HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

aggregate nearest neighbor; aggregate similarity search; nearest neighbor; similarity search

Indexed keywords

APPROXIMATION ALGORITHMS; NEAREST NEIGHBOR SEARCH; QUERY PROCESSING;

AGGREGATE NEAREST NEIGHBORS; AGGREGATE SIMILARITY SEARCH; MULTIMEDIA DATABASE; NEAREST-NEIGHBOR QUERY; NEAREST-NEIGHBOUR; QUERY OBJECT; SIMILARITY SEARCH; SIMPLE++; SPATIAL DATABASE;

AGGREGATES;

EID: 79959955779     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989323.1989429     Document Type: Conference Paper

References (24)

1. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. Journal of ACM, 45(6):891-923, 1998.
2. S. Berchtold, C. Böhm, D. A. Keim, and H. P. Kriegel. A cost model for nearest neighbor search in high-dimensional data space. In PODS, 1997.
3. M. Berg, M. Kreveld, M. Overmars, and O. Schwarzkopf. Computational geometry: algorithms and applications. Springer, 1997.
4. C. Böhm. A cost model for query processing in high dimensional data spaces. ACM Transaction on Database Systems, 25(2):129-178, 2000.
5. C. Böhm and H.-P. Kriegel. Determining the convex hull in large multidimensional databases. In International Conference on Data Warehousing and Knowledge Discovery, 2001.
6. K. Chakrabarti, K. Porkaew, and S. Mehrotra. The Color Data Set. http://kdd.ics.uci.edu/databases/CorelFeatures/ CorelFeatures.data.html.
7. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In VLDB, 1997.
8. R. Fagin, R. Kumar, and D. Sivakumar. Efficient similarity search and classification via rank aggregation. In SIGMOD, 2003.
9. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, 2001.
10. A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In VLDB, 1999.
11. G. R. Hjaltason and H. Samet. Distance browsing in spatial databases. ACM Trans. Database Syst., 24(2), 1999.
12. H. V. Jagadish, B. C. Ooi, K.-L. Tan, C. Yu, and R. Zhang. iDistance: An adaptive B+-tree based indexing method for nearest neighbor search. ACM Trans. Database Syst., 30(2):364-397, 2005. (Pubitemid 41204994)
13. P. Kumar, J. S. B. Mitchell, and E. A. Yildirim. Approximate minimum enclosing balls in high dimensions using core-sets. ACM Journal of Experimental Algorithmics, 8, 2003.
14. Y. LeCun and C. Cortes. The MNIST Data Set. http://yann.lecun.com/exdb/ mnist/.
15. F. Li, B. Yao, and P. Kumar. Group enclosing queries. IEEE TKDE, To Appear, 2010.
16. H. Li, H. Lu, B. Huang, and Z. Huang. Two ellipse-based pruning methods for group nearest neighbor queries. In GIS, 2005.
17. D. Papadias, Q. Shen, Y. Tao, and K. Mouratidis. Group nearest neighbor queries. In ICDE, 2004.
18. D. Papadias, Y. Tao, K. Mouratidis, and C. K. Hui. Aggregate nearest neighbor queries in spatial databases. ACM TODS, 30(2):529-576, 2005. (Pubitemid 41204998)
19. H. L. Razente, M. C. N. Barioni, A. J. M. Traina, C. Faloutsos, and C. Traina, Jr. A novel optimization approach to efficiently process aggregate similarity queries in metric access methods. In CIKM, 2008.
20. K. Rose and B. S. Manjunath. The CORTINA Data Set. http://www.scl.ece. ucsb.edu/datasets/index.htm.
21. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In SIGMOD, 1995.
22. Y. Tao, K. Yi, C. Sheng, and P. Kalnis. Quality and efficiency in high dimensional nearest neighbor search. In SIGMOD, 2009.
23. M. L. Yiu, N. Mamoulis, and D. Papadias. Aggregate nearest neighbor queries in road networks. IEEE TKDE, 17(6):820-833, 2005. (Pubitemid 40860461)
24. H. Yu, P. K. Agarwal, R. Poreddy, and K. R. Varadarajan. Practical methods for shape fitting and kinetic data structures using core sets. In SoCG, 2004.