Continuous monitoring of nearest neighbors on land surface

Proceedings of the VLDB Endowment

Volumn 2, Issue 1, 2009, Pages 1114-1125

  Xing, Songhua ^a   Shahabi, Cyrus ^a   Pan, Bei ^a  

^a University of Southern California ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENCY; GEOGRAPHIC INFORMATION SYSTEMS; LOCATION BASED SERVICES; MOTION COMPENSATION; NEAREST NEIGHBOR SEARCH; ONLINE SYSTEMS; QUERY PROCESSING; SURFACE DEFECTS; SURFACE MEASUREMENT; TELECOMMUNICATION SERVICES;

CONTINUOUS MONITORING; DYNAMIC ENVIRONMENTS; EMERGING APPLICATIONS; K NEAREST NEIGHBOR (KNN); K-NEAREST NEIGHBORS; REALISTIC RENDERING; SHORTEST PATH COMPUTATIONS; VISUALIZATION PLATFORMS;

FORESTRY;

EID: 78650588403     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1687627.1687753     Document Type: Article

References (21)

1. J. Chen and Y. Han: Shortest paths on a polyhedron. 6th ACM Symp. Comput. Geometry, pages 360-369, 1990.
2. K. Deng, X. Zhou, H. T. Shen, K. Xu, X. Lin: Surface k-NN Query Processing. ICDE 2006.
3. K. Deng, X. Zhou, H.T. Shen, Q. Liu, K. Xu and X. Lin: A Multi-resolution Surface Distance Model for k-NN Query Processing. The VLDB Journal, Volume 17, August 2008.
4. C. Shahabi, L. Tang and S. Xing: Indexing Land Surface for Efficient kNN Query. PVLDB Volume 1(1), 2008.
5. E. W. Dijkstra: A note on two problems in connection with graphs. Numeriche Mathematik, 1:269-271, 1959.
6. B. Kaneva and J.O'Rourke: An implementation of Chen & Han's shortest paths algorithm. Proc. of 12th Canadian Conf.on Comput. Geom, 2000.
7. K. Mouratidis, M. Yiu, D. Papadias and N. Mamoulis:Continuous nearest neighbor monitoring in road networks. VLDB 2006.
8. D. Wagner, T. Willhalm, C. Zaroliagis: Geometric containers for efficient shortest-path computation. J. Exp. Algorithmics
9. H. Samet, J. Sankaranarayanan,H. Alborzi: Scalable network distance browsing in spatial databases. SIGMOD 2008.
10. D. Papadias, J. Zhang, N. Mamoulis, Y. Tao: Query Processing in Spatial Network Databases. VLDB 2003.
11. Http://data.geocomm.com.
12. A. Guttman: R-trees: a Dynamic Index Structure for Spatial Searching: SIGMOD 1984.
13. H. Samet: Foundations of Multidimensional and Metric Data Structures 2005.
14. N. Roussopoulos, S. Kelley, and F. Vincent: Nearest neighbor queries. SIGMOD 1995.
15. F. Korn, and S. Muthukrishnan: Influence Sets Based on Reverse Nearest Neighbor Queries. SIGMOD 2000.
16. Y. Tao, D. Papadias, and X. Lian: Reverse kNN search in arbitrary dimensionality. VLDB 2004.
17. Y. Tao and D. Papadias: Time-parameterized queries in spatio-temporal databases. SIGMOD 2002.
18. Y. Tao, D. Papadias and Q. Shen: Continuous Nearest Neighbor Search. VLDB 2002.
19. C. Shahabi, M. R. Kolahdouzan and M. Sharifzadeh: A road network embedding technique for k-nearest neighbor search in moving object databases. ACM-GIS 2002.
20. M. Kolahdouzan and C. Shahabi: Voronoi-based k nearest neighbor search for spatial network databases. VLDB 2004.
21. X. Yu, K. Q. Pu, and N. Koudas: Monitoring k-nearest neighbor queries over moving objects. ICDE, 2005.