VoR-tree: R-trees with voronoi diagrams for efficient processing of spatial nearest neighbor queries

Proceedings of the VLDB Endowment

Volumn 3, Issue 1, 2010, Pages 1231-1242

  Sharifzadeh, Mehdi ^a   Shahabi, Cyrus ^b  

^a GOOGLE INC   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; DECISION TREES; GRANULATION; GRAPHIC METHODS; NEAREST NEIGHBOR SEARCH;

HIERARCHICAL STRUCTURES; INDEX STRUCTURE; LOCAL NEIGHBORHOODS; LOGARITHMIC TIME; NEAREST NEIGHBOR QUERIES; NEAREST-NEIGHBORS; SPATIAL QUERIES; VORONOI DIAGRAMS;

FORESTRY;

ALGORITHMS; COMPUTATION; DECISION THEORY; DIAGRAMS; GEOMETRY; GRANULATION; GRAPHIC METHODS; HIERARCHICAL SYSTEMS;

EID: 78650614611     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1920994     Document Type: Article

References (18)

1. S. Börzsönyi, D. Kossmann, and K. Stocker. The Skyline Operator. In ICDE'01, pages 421-430, 2001.
2. J. V. den Bercken, B. Seeger, and P. Widmayer. A Generic Approach to Bulk Loading Multidimensional Index Structures. In VLDB'97, 1997.
3. A. Guttman. R-trees: a Dynamic Index Structure for Spatial Searching. In ACM SIGMOD '84, pages 47-57, USA, 1984. ACM Press.
4. M. Hagedoorn. Nearest Neighbors can be Found E_ciently if the Dimension is Small relative to the input size. In ICDT'03, volume 2572 of Lecture Notes in Computer Science, pages 440-454. Springer, January 2003.
5. G. R. Hjaltason and H. Samet. Distance Browsing in Spatial Databases. ACM TODS, 24(2):265-318, 1999.
6. M. Kolahdouzan and C. Shahabi. Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases. In VLDB'04, pages 840-851, Toronto, Canada, 2004.
7. S. Berchtold, B. Ertl, D. A. Keim, H. Kriegel, and T. Seidl. Fast Nearest Neighbor Search in High-Dimensional Space. In ICDE'98, pages 209-218, 1998.
8. F. Korn and S. Muthukrishnan. Inuence Sets based on Reverse Nearest Neighbor Queries. In ACM SIGMOD'02, pages 201-212. ACM Press, 2000.
9. S. Maneewongvatana. Multi-dimensional Nearest Neighbor Searching with Low-dimensional Data. PhD thesis, Computer Science Department, University of Maryland, College Park, MD, 2001.
10. A. Okabe, B. Boots, K. Sugihara, and S. N. Chiu. Spatial Tessellations, Concepts and Applications of Voronoi Diagrams. John Wiley and Sons Ltd., 2nd edition, 2000.
11. D. Papadias, Y. Tao, G. Fu, and B. Seeger. Progressive Skyline Computation in Database Systems. ACM TODS, 30(1):41-82, 2005.
12. D. Papadias, Y. Tao, K. Mouratidis, and C. K. Hui. Aggregate Nearest Neighbor Queries in Spatial Databases. ACM TODS, 30(2):529-576, 2005.
13. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest Neighbor Queries. In SIGMOD'95, pages 71-79, USA, 1995.
14. M. Sharifzadeh and C. Shahabi. The Spatial Skyline Queries. In VLDB'06, September 2006.
15. I. Stanoi, D. Agrawal, and A. E. Abbadi. Reverse Nearest Neighbor Queries for Dynamic Databases. In ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pages 44-53, 2000.
16. Y. Tao, D. Papadias, and X. Lian. Reverse kNN Search in Arbitrary Dimensionality. In VLDB'04, pages 744-755, 2004.
17. J. Xu, B. Zheng, W.-C. Lee, and D. L. Lee. The D-Tree: An Index Structure for Planar Point Queries in Location Based Wireless Services. IEEE TKDE, 16(12):1526-1542, 2004.
18. B. Zheng and D. L. Lee. Semantic Caching in Location -dependent Query Processing. In SSTD'01, pages 97-116.