Nearest Surrounder Queries

In this paper, we present a new type of spatial queries called Nearest Surrounder (NS) queries. An NS query determines the nearest polygon-shaped spatial objects (referred to as nearest surrounder objects) and their orientations with respect to a query point from an object set. Besides, we derive two NS query variants, namely, multitier NS (m-NS) queries and angle-constrained NS (ANS) queries. An m-NS query searches multiple layers of NS objects for the same range of angles from a query point. An ANS query searches for NS objects within a specified range of angles. To evaluate NS queries and their variants, we explore angle-based and distance-based bound properties of polygons, and devise two efficient algorithms, namely, Sweep and Ripple, based on R-tree. The algorithms access objects in an order according to their orientations and distances with respect to a given query point, respectively. They are efficient as they can finish a search with one index lookup. Besides, they can progressively deliver a query result. Through empirical studies, we evaluate the proposed algorithms and report their performance for both synthetic and real object sets.

[1]  Ken C. K. Lee,et al.  Nearest Surrounder Queries , 2006, IEEE Transactions on Knowledge and Data Engineering.

[2]  Flip Korn,et al.  Influence sets based on reverse nearest neighbor queries , 2000, SIGMOD 2000.

[3]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[4]  Nick Roussopoulos,et al.  Nearest neighbor queries , 1995, SIGMOD '95.

[5]  Hanan Samet,et al.  Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates , 2003, VLDB.

[6]  Yufei Tao,et al.  Time-parameterized queries in spatio-temporal databases , 2002, SIGMOD '02.

[7]  Jirí Matousek,et al.  Ray Shooting and Parametric Search , 1993, SIAM J. Comput..

[8]  Carlo H. Séquin,et al.  Occlusion horizons for driving through urban scenery , 2001, I3D '01.

[9]  Angela Lee,et al.  Perspectives on … Environmental Systems Research Institute, Inc , 1997 .

[10]  Hanan Samet,et al.  Distance browsing in spatial databases , 1999, TODS.

[11]  Divyakant Agrawal,et al.  Constrained Nearest Neighbor Queries , 2001, Encyclopedia of GIS.

[12]  Jing Zhou,et al.  An efficient algorithm for predictive continuous nearest neighbor query processing and result maintenance , 2005, MDM '05.

[13]  David Salomon,et al.  Computer Graphics and Geometric Modeling , 1999, Springer New York.

[14]  Timos K. Sellis,et al.  Efficient Cost Models for Spatial Queries Using R-Trees , 2000, IEEE Trans. Knowl. Data Eng..

[15]  Yufei Tao,et al.  Continuous Nearest Neighbor Search , 2002, VLDB.

[16]  Kyriakos Mouratidis,et al.  Group nearest neighbor queries , 2004, Proceedings. 20th International Conference on Data Engineering.

[17]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[18]  Christos Faloutsos,et al.  The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.

[19]  Mario A. López,et al.  A greedy algorithm for bulk loading R-trees , 1998, GIS '98.

[20]  Christian S. Jensen,et al.  Nearest neighbor and reverse nearest neighbor queries for moving objects , 2002, Proceedings International Database Engineering and Applications Symposium.