Share Email Print
cover

Proceedings Paper

SHG-Tree: an efficient granularity-based spatial index structure
Author(s): Yintian Liu; Yingming Liu; Kaikuo Xu; Tao Zeng; Jiaoling Zheng
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

To improve the access efficiency of multidimensional spatial database, this study proposes a new index structure named Space Hypercube Grid Tree (SHG-Tree). By avoiding the problems of node split and recombination, SHG-Tree can efficiently support the common operations over spatial database containing objects with dynamic region. The main contributions of this paper include: (1) Proposes SHG-Tree of n-dimensional space with a hierarchical tree structure. It reflects the region overlapping relationship of hypercube grid units with different granularity. (2) Proposes the linearization methods to present the bounding rectangle of object as a union of variant granularity hypercube grids. (3) Gives operations of SHG-Tree. Experiments result shows the size of SHG-Tree is small enough to remain in main memory even to very large spatial database by applying proper linearization strategy and the queries on SHG-Tree are less than ten milliseconds to ensure the real-time of query.

Paper Details

Date Published: 10 November 2008
PDF: 11 pages
Proc. SPIE 7146, Geoinformatics 2008 and Joint Conference on GIS and Built Environment: Advanced Spatial Data Models and Analyses, 714603 (10 November 2008); doi: 10.1117/12.813093
Show Author Affiliations
Yintian Liu, Chengdu Univ. of Information Technology (China)
Sichuan Univ. (China)
Yingming Liu, Sichuan Univ. (China)
Kaikuo Xu, Sichuan Univ. (China)
Tao Zeng, Tianjin Normal Univ. (China)
Jiaoling Zheng, Chengdu Univ. of Information Technology (China)


Published in SPIE Proceedings Vol. 7146:
Geoinformatics 2008 and Joint Conference on GIS and Built Environment: Advanced Spatial Data Models and Analyses
Lin Liu; Xia Li; Kai Liu; Xinchang Zhang, Editor(s)

© SPIE. Terms of Use
Back to Top