Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Berg, M. Kreveld, M. Overmars, O. Schwarzkopf (1996)
Computational Geometry: Algorithms and Applications Chap. 7
R.F. Sproull (1991)
Refinements to nearest-neighbor searching in k-dimensional treesAlgorithmica, 6
J. Nievergelt, H. Hinterberger, K.C. Sevcik (1984)
The grid file: an adaptable, symmetric multikey file structureACM Trans. Database Syst., 9
K.L. Cheung, W.-C. Fu (1998)
Enhanced nearest neighbour search on the r-treeSIGMOD Rec., 27
D.L. Lee, W.-C. Lee, J. Xu, B. Zheng (2002)
Data management in location-dependent information servicesIEEE Pervas. Comput., 1
S. Berchtold, D.A. Keim, H.P. Kriegel, T. Seidl (2000)
Indexing the solution space: a new technique for nearest neighbor search in high-dimensional spaceIEEE Trans. Knowl. Data Eng., 12
Gí.R. Hjaltason, H. Samet (1999)
Distance browsing in spatial databasesACM Trans. Database Syst., 24
(2003)
IT Roadmap to a Geospatial Future
T. Imielinski, S. Viswanathan, B.R. Badrinath (1997)
Data on air: organization and accessIEEE Trans. Knowl. Data Eng., 9
Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on the locations of data objects: using some distance heuristics on object locations. The latter is built on a precomputed solution space. Thus, NN queries can be reduced to and processed as simple point queries in this solution space. Both approaches exhibit some disadvantages, especially when employed for wireless data broadcast in mobile computing environments. In this paper, we introduce a new index method, called the grid-partition index , to support NN search in both on-demand access and periodic broadcast modes of mobile computing. The grid-partition index is constructed based on the Voronoi diagram, i.e., the solution space of NN queries. However, it has two distinctive characteristics. First, it divides the solution space into grid cells such that a query point can be efficiently mapped into a grid cell around which the nearest object is located. This significantly reduces the search space. Second, the grid-partition index stores the objects that are potential NNs of any query falling within the cell. The storage of objects, instead of the Voronoi cells, makes the grid-partition index a hybrid of the solution-based and object-based approaches. As a result, it achieves a much more compact representation than the pure solution-based approach and avoids backtracked traversals required in the typical object-based approach, thus realizing the advantages of both approaches. We develop an incremental construction algorithm to address the issue of object update. In addition, we present a cost model to approximate the search cost of different grid partitioning schemes. The performances of the grid-partition index and existing indexes are evaluated using both synthetic and real data. The results show that, overall, the grid-partition index significantly outperforms object-based indexes and solution-based indexes. Furthermore, we extend the grid-partition index to support continuous-nearest-neighbor search. Both algorithms and experimental results are presented.
The VLDB Journal – Springer Journals
Published: Jan 1, 2006
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.