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.
Supported by the National Natural Science Foundation of China under Grant No. 60073046.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gaede, V., Gunther, O.: Multidimensional Access Methods. ACM Computing Surveys 30(2), 170–231 (1998)
Guttman, A.: R-trees: A Dynamic Index Structure for Spatial Searching. In: ACM SIGMOD International Conference on Management of Data, Aug. 1984, pp. 47–57 (1984)
Sellis, T.K., Roussopoulos, N., Faloutsos, C.: The R+-Tree: A Dynamic Index for Multi-Dimensional Objects. In: Proceeding of the 13th International Conference on VLDB, pp. 507–518 (1987)
Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In: ACM SIGMOD Conf., pp. 322–331 (1990)
Katayama, N., Satoh, S.: The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries. In: ACM SIGMOD International Conference on Management of Data, May 1997, pp. 369–380 (1997)
Berchtold, S., Kriegel, C., Hriegel, H.: The Pyramid-tree: Breaking the Curse of Dimensionality. In: ACM SIGMOD, pp. 142–153 (1998)
Sakurai, Y., Yoshikawa, M., Uemura, S., Kojima, H.: The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation. In: VLDB 2000, pp. 516–526 (2000)
Weber, R., Schek, H.J., Blott, S.: A quantitative analysis and performance study for similarity search methods in high dimensional space. In: VLDB 1998, pp. 194–205 (1998)
Moon, B., Jagadish, H.V., Faloutsos, C., Saltz, J.H.: Analysis of the Clustering Properties of Hilbert Space-Filling Curve. IEEE Trans. on Knowledge and Data Engineering (IEEE-TKDE) 13(1), 124–141 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Liu, Y., Tang, C., Duan, L., Zeng, T., Li, C. (2007). An Efficient Spatial Search Method Based on SG-Tree. In: Dong, G., Lin, X., Wang, W., Yang, Y., Yu, J.X. (eds) Advances in Data and Web Management. APWeb WAIM 2007 2007. Lecture Notes in Computer Science, vol 4505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72524-4_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-72524-4_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72483-4
Online ISBN: 978-3-540-72524-4
eBook Packages: Computer ScienceComputer Science (R0)