Two ellipse-based pruning methods for group nearest neighbor queries

GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems

Volumn , Issue , 2005, Pages 192-199

  Li, Hongga ^a   Huang, Bo ^b   Lu, Hua ^c   Huang, Zhiyong ^c  

^a INSTITUTE OF REMOTE SENSING APPLICATIONS   (China)

^b UNIVERSITY OF CALGARY   (Canada)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

GNN; Group nearest neighbor query; Query optimization

Indexed keywords

APPROXIMATION THEORY; DATA STRUCTURES; GEOGRAPHIC INFORMATION SYSTEMS; OPTIMIZATION; QUERY LANGUAGES; TREES (MATHEMATICS);

-TREE; GROUP NEAREST NEIGHBOR (GNN); GROUP NEAREST NEIGHBOR QUERY; QUERY OPTIMIZATION; R;

DATABASE SYSTEMS;

EID: 33644584756     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1097064.1097092     Document Type: Conference Paper

References (16)

1. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, A. Y. Wu. An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed Dimensions. Journal of ACM, 45(6):891-923, 1998.
2. C. Aggrawal, P. Yu. Outlier detection for high dimensional data. In Proc. of ACM SIGMOD Int'l Conference, 2001.
3. N. Beckmann, H. P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An efficient and robust access method for points and rectangles. In Proc. of ACM SIGMOD Int'l Conference, 1990.
4. M. Ester, H.-P. Kriegel, and J. Sander. Knowledge discovery in spatial databases. Invited paper at German Conf. On Artificial Intelligence, 1999.
5. H. Ferhatosmanoglu, I. Stanoi, D. Agrawal, and A. E. Abbadi. Constrained Nearest Neighbor Queries. In Proc. of Symposium on Spatial and Temporal Databases (SSTD), 2001.
6. C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In Proc. of ACM SIGMOD Int'l Conference, 1994.
7. A. Guttman. R-tree: a dynamic index structure for spatial searching. In Proc. of ACM SIGMOD Int'l Conference, 1984.
8. G. Hjaltason, and H. Samet. Distance browsing in spatial database. ACM Trans, on Database Systems, 24(2):265-318, 1999.
9. A. Jain, M. Murthy, and P. Flynn. Data clustering: A review. ACM Comp. Surveys, 31(3):64-323, 1999.
10. K. Nakano, and S. Olariu, An optimal algorithm for the angle-restricted all nearest neighbor problem on the reconfigurable mesh, with applications. IEEE Trans. on Parallel and -Distributed Systems, 8(9):983-990, 1997.
11. D. Papadias, Q. Shen, Y. Tao, and K. Mouratidis. Group nearest neighbor queries. In Proc. of Int'l Conf. on Data Engineering (ICDE), 2004.
12. A. Papadopoulos, and Y. Manolopoulos. Performance of nearest neighbor queries in R-trees, In Proc. of Int'l Conf. on Database Theory (ICDT), 1997.
13. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In Proc. of ACM SIGMOD Int'l Conference, 1995.
14. T. Seidl and H. Kriegel. Optimal Multi-Step k-Nearest Neighbor Search. In Proc. of ACM SIGMOD Int'l Conference, 1998.
15. Y. Tao, J. Zhang, D. Papadias, and N. Mamoulis. An Efficient Cost Model for Optimization of Nearest Neighbor Search in Low and Medium Dimensional Spaces. IEEE Trans. on Knowledge and Data Engineering, 2004.
16. C. Yu, B. Ooi, K.-L. Tan, and H. V, Jagadish. Indexing the Distance: An Efficient Method to KNN Processing. In Proc. of Very Large Data Bases Conference (VLDB), 2001.