An efficient spatial search method based on SG-tree

Authors:
Yintian Liu;Changjie Tang;Lei Duan;Tao Zeng;Chuan Li
Affiliations:
College of Computer Science, Sichuan University, Chengdu, China;College of Computer Science, Sichuan University, Chengdu, China;College of Computer Science, Sichuan University, Chengdu, China;College of Computer Science, Sichuan University, Chengdu, China;College of Computer Science, Sichuan University, Chengdu, China
Venue:
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Year:
2007

Citing 9
Cited 0

The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The SR-tree: an index structure for high-dimensional nearest neighbor queries

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
The pyramid-technique: towards breaking the curse of dimensionality

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Multidimensional access methods

ACM Computing Surveys (CSUR)
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Analysis of the Clustering Properties of the Hilbert Space-Filling Curve

IEEE Transactions on Knowledge and Data Engineering
A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

To solve the overlapping search of multidimensional spatial database containing large quantity of objects with dynamic spatial extent, this paper proposes an index structure named Space Grid Tree (SG-Tree) based on Peano Space-Filling Curve (SFC) to index the region of object. By appropriate linearization strategy, the bounding box of a spatial object can be presented by a union of mutually disjoint hypercube grids with different granularity, and only the object's oid, i.e. the identifier which is used to refer to this object in the database, is registered on the nodes relative to these grids. The overlapping queries of spatial objects can be operated real-time directly on SG-Tree. Experiments show that SG-Tree is feasible and efficient to solve the overlapping search of multidimensional spatial objects.