The V*Diagram: A query-dependent approach to moving KNN queries

Proceedings of the VLDB Endowment

Volumn 1, Issue 1, 2008, Pages 1095-1106

  Nutanong, Sarana ^a,b   Zhang, Rui ^a   Taniny, Egemen ^b   Kulik, Lars ^a,b  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

MEMBERSHIP FUNCTIONS; MOTION COMPENSATION; NEAREST NEIGHBOR SEARCH; TEXT PROCESSING;

COMPUTATION COSTS; DATABASE COMMUNITY; HIGH POTENTIAL; K-NEAREST NEIGHBORS; MOVING QUERY; ORDERS OF MAGNITUDE; QUERY POINTS; SEARCH SPACES;

QUERY PROCESSING;

EID: 77950023510     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1453856.1453973     Document Type: Article

References (23)

1. N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. In SIGMOD, pages 322-331, 1990.
2. R. Benetis, C. S. Jensen, G. Karciauskas, and S. Saltenis. Nearest and reverse nearest neighbor queries for moving objects. VLDB J., 15(3):229-249, 2006.
3. H. J. Cho and C. W. Chung. An efficient and scalable approach to CNN queries in a road network. In VLDB, pages 865-876, 2005.
4. A. Guttman. R-trees: a dynamic index structure for spatial searching. In SIGMOD, pages 47-57, 1984.
5. G. R. Hjaltason and H. Samet. Ranking in spatial databases. In Symposium on Large Spatial Databases, pages 83-95, 1995.
6. G. R. Hjaltason and H. Samet. Distance browsing in spatial databases. ACM Trans. Database Syst., 24(2):265-318, 1999.
7. H. Hu, J. Xu, and D. L. Lee. A generic framework for monitoring continuous spatial queries over moving objects. In SIGMOD, pages 479-490, 2005.
8. X. Huang, C. S. Jensen, H. Lu, and S. Saltenis. S-GRID: A versatile approach to efficient query processing in spatial networks. In SSTD, pages 93-111, 2007.
9. X. Huang, C. S. Jensen, and S. Saltenis. The islands approach to nearest neighbor querying in spatial networks. In SSTD, pages 73-90, 2005.
10. +-tree based indexing method for nearest neighbor search. ACM Trans. Database Syst., 30(2):364-397, 2005.
11. M. R. Kolahdouzan and C. Shahabi. Voronoi-based k nearest neighbor search for spatial network databases. In VLDB, pages 840-851, 2004.
12. M. R. Kolahdouzan and C. Shahabi. Alternative solutions for continuous k nearest neighbor queries in spatial network databases. GeoInformatica, 9(4):321-341, 2005.
13. L. Kulik and E. Tanin. Incremental rank updates for moving query points. In GIScience, pages 251-268, 2006.
14. A. Okabe, B. Boots, and K. Sugihara. Spatial tessellations: concepts and applications of Voronoi diagrams. John Wiley & Sons, Inc., 1992.
15. D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao. Query processing in spatial network databases. In VLDB, pages 802-813, 2003.
16. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In SIGMOD, pages 71-79, 1995.
17. H. Samet, J. Sankaranarayanan, and H. Alborzi. Scalable network distance browsing in spatial databases. In SIGMOD, pages 43-55, 2008.
18. Z. Song and N. Roussopoulos. K-nearest neighbor search for moving query point. In SSTD, pages 79-96, 2001.
19. Y. Tao and D. Papadias. Time-parameterized queries in spatio-temporal databases. In SIGMOD, pages 334-345, 2002.
20. Y. Tao, D. Papadias, and Q. Shen. Continuous nearest neighbor search. In VLDB, pages 287-298, 2002.
21. 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. Knowl. Data Eng., 16(10):1169-1184, 2004.
22. X. Yu, K. Q. Pu, and N. Koudas. Monitoring k-nearest neighbor queries over moving objects. In ICDE, pages 631-642, 2005.
23. J. Zhang, M. Zhu, D. Papadias, Y. Tao, and D. L. Lee. Location-based spatial queries. In SIGMOD, pages 443-454, 2003.