Dynamic and hierarchical spatial access method using integer searching

Dynamic and complex computation in the area of Geographic Information System (GIS) or Mobile Computing System involves huge amount of spatial objects such as points, boxes, polygons, etc and requires a scalable data structure and an efficient management tool for this information. In this paper, for a dynamic management of spatial objects, we construct a hierarchical dynamic data structure, called an IST/OPG hierarchy, which may overcome some limitations of existing Spatial Access Methods (SAMs). The hierarchy is constructed by combining three primary components: (1) Minimum Boundary Rectangle (MBR), which is the most widely used method among SAMs; (2) the population-based domain slicing, which is modified from the Grid File [14]; (3) extended optimal Integer Searching algorithm [4]. For dynamic management of spatial objects in the IST/OPG hierarchy, a number of primary and supplementary operations are introduced. This paper includes a comparative analysis of our approach with previous SAMs, such as R-Tree, R+-Tree and R*-Tree and QSF-Tree. The results of analysis show that our approach is better than other SAMs in construction and query time and space requirements. Specifically, for a given search domain with n objects, our query operations yield $O($ \scriptsize $\sqrt {\frac {\log n} {\log\log n}}$\normalsize $)$ compared to $O(\log n)$ of the fast SAM and an IST/OPG hierarchy containing $n$ objects can be constructed in $O(n$ \scriptsize $\sqrt {\frac {\log n}{\log\log n}}$\normalsize $)$ time and O(n) space.

[1]  Hans-Werner Six,et al.  The R-file: an efficient access structure for proximity queries , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

[2]  Christos Faloutsos,et al.  Hilbert R-tree: An Improved R-tree using Fractals , 1994, VLDB.

[3]  Hans-Peter Kriegel,et al.  The Performance of Object Decomposition Techniques for Spatial Query Processing , 1991, SSD.

[4]  Oliver Günther,et al.  Multidimensional access methods , 1998, CSUR.

[5]  Peter van Oosterom,et al.  Reactive Data Structures for Geographic Information Systems , 1993 .

[6]  Jeff A. Bilmes,et al.  Tree-Based Access Methods for Spatial Databases: Implementation and Performance Evaluation , 1991, IEEE Trans. Knowl. Data Eng..

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

[8]  Hans-Werner Six,et al.  Spatial searching in geometric databases , 1988, Proceedings. Fourth International Conference on Data Engineering.

[9]  T. H. Merrett,et al.  A class of data structures for associative searching , 1984, PODS.

[10]  TheodoridisYannis,et al.  Topological relations in the world of minimum bounding rectangles , 1995 .

[11]  Byunggu Yu,et al.  Simple QSF-trees: an efficient and scalable spatial access method , 1999, CIKM '99.

[12]  Ramesh C. Jain,et al.  Similarity indexing with the SS-tree , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[13]  Mikkel Thorup,et al.  Tight(er) worst-case bounds on dynamic searching and priority queues , 2000, STOC '00.

[14]  Oliver Günther,et al.  The design of the cell tree: an object-oriented index structure for geometric databases , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

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

[16]  Timos K. Sellis,et al.  Topological relations in the world of minimum bounding rectangles: a study with R-trees , 1995, SIGMOD '95.

[17]  Arne Andersson,et al.  Sublogarithmic searching without multiplications , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[18]  Jürg Nievergelt,et al.  The Grid File: An Adaptable, Symmetric Multikey File Structure , 1984, TODS.

[19]  Timos K. Sellis,et al.  Review - The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles , 2000, ACM SIGMOD Digital Review.

[20]  Paul H. Lewis,et al.  A study on data point search for HG-trees , 1999, SGMD.

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

[22]  Arne Andersson Faster deterministic sorting and searching in linear space , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[23]  Klaus H. Hinrichs,et al.  Implementation of the grid file: Design concepts and experience , 1985, BIT.

[24]  Christian S. Jensen Review - R-Trees: A Dynamic Index Structure for Spatial Searching , 1999, ACM SIGMOD Digit. Rev..

[25]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[26]  Jiong Yang,et al.  PK-tree: A Spatial Index Structure for High Dimensional Point Data , 1998, FODO.