Efficient methods in finding aggregate nearest neighbor by projection-based filtering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4707 LNCS, Issue PART 3, 2007, Pages 821-833

  Luo, Yanmin ^a,b   Chen, Hanxiong ^a   Furuse, Kazutaka ^a   Ohbo, Nobuo ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

^b HUAQIAO UNIVERSITY   (China)

Author keywords

Aggregate nearest neighbor; Pruning strategies; Search region

Indexed keywords

ALGORITHMS; DATA MINING; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; OPTIMIZATION;

AGGREGATE NEAREST NEIGHBOR; MULTIPLE QUERY POINTS; PRUNING STRATEGIES; SEARCH REGION;

DATABASE SYSTEMS;

EID: 38349063599     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74484-9_70     Document Type: Conference Paper

References (18)

1. Papadopoulos, A., Manolopoulos, Y.: Performance of Nearest Neighbor Queries in R-Trees. In: Afrati, F.N., Kolaitis, P.G. (eds.) ICDT 1997. LNCS, vol. 1186, pp. 394-408. Springer, Heidelberg (1996)
2. Jain, A.K., Narasimha Murty, M., Flynn, P.J.: Data Clustering: A Review. ACM Comput. Surv. 31(3), 264-323 (1999)
3. Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: Proc. of ACM SIGMOD Int'l Conference, pp. 47-57 (1984)
4. Aggarwal, C.C., Yu, P.S.: Outlier Detection for High Dimensional Data. In: SIGMOD Conference, pp. 37-46 (2001)
5. Jensen, C.S., Kolárvr, J.: Torben Bach Pedersen, Igor Timko: Nearest neighbor queries in road networks. In: GIS 2003, pp. 1-8 (2003)
6. Papadias, D., Tao, Y., Mouratidis, K., Hui, C.K.: Aggregate nearest neighbor queries in spatial databases. ACM Trans. Database Syst. 30(2), 529-576 (2005)
7. Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group Nearest Neighbor Queries. In: ICDE 2004, pp. 301-312 (2004)
8. Li, H., Lu, H., Huang, B., Huang, Z.: Two ellipse-based pruning methods for group nearest neighbor queries. In: GIS 2005, pp. 192-199 (2005)
9. Uhlmann, J.K.: Satisfying general proximity/ similary queries with metric trees. Information Processing Letters 40, 175-179 (1991)
10. Lin, K.-I., Nolen, M., Kommeneni, K.: Utilizing Indexes for Approximate and On-Line Nearest Neighbor Queries. In: IDEAS 2005, pp. 83-88 (2005)
11. Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is Nearest Neighbors Meaningful? In: Proc. of the Int. Conf. Database Theorie, pp. 217-235 (1999)
12. Yiu, M.L., Mamoulis, N., Papadias, D.: Aggregate Nearest Neighbor Queries in Road Networks. IEEE Trans. Knowl. Data Eng. 17(6), 820-833 (2005)
13. Paolo Ciaccia, M.P., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: Proceedings of the 23rd VLDB Conference, Athenes, Greece, 1997, pp. 357-368 (1997)
14. Ishikawa, M., Chen, H., Furuse, K., Yu, J.X., Ohbo, N.: MB+Tree: A Dynamically Updatable Metric Index for Similarity Searches. Web.-Age. Information Management, 356-373 (2000)
15. Roussopoulos, N., Kelley, S., Vincent, F.: Nearest Neighbor Queries. In: SIGMOD Conference 1995, pp. 71-79 (1995)
16. Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proc. of ACM SIGMOD Int'l Conference, pp. 322-331 (1990)
17. Brin, S.: Near neighbor search in large metric spaces. In: Proceedings of the 21st VLDB Conference, pp. 574-584 (1995)
18. Bozkaya, T., Ozsoyoglu, M.: Distance-based inde- xing for high-dimensional metric spaces. In: Proceedings of the ACM SIGMOD Conference on Management of Data, Tucson, Arizona, pp. 357-368 (May 1997)