The Study and Design of QR*-Tree Spatial Indexing Structure

Xiao Yu Song; Yong Hui Wang; Shou Jin Wang

doi:10.4028/www.scientific.net/AMM.182-183.2030

Paper Titles

Research and Realization of Streaming Media Video Conferencing System Based on P2P
p.2008

A Study of Mobile Node Localization Algorithm Based on Ranging MCL for WSN
p.2012

Management Technology for Satellite Network Based on Service
p.2019

A Novel Algorithm for Key Frames Selection
p.2025

The Study and Design of QR*-Tree Spatial Indexing Structure
p.2030

Calculation Analysis on Audio Frequency Compression Based on Wavelet Packet Decomposition
p.2035

A Fast Algorithm for Lip Contour and Feature Extraction
p.2040

The Analysis of Single-Radio Mode, Dual-Radio Mode and Multi-Radio Mode WMN’s Capacity
p.2045

Airspace Congestion Prediction Based on Evidence Theory
p.2050

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 182-183The Study and Design of QR*-Tree Spatial Indexing...

The Study and Design of QR*-Tree Spatial Indexing Structure

Abstract:

In this study, we will discuss a fast spatial indexing structure called QR*-tree based on R*-tree and quad-tree. Now, R*-tree and R-tree are widely used in spatial database as a spatial indexing structure, But for each algorithm alone, it is not suitable for the huge data volume. The hybrid structure that we proposed is composed of many R*-trees based on space partitioned by quad-tree. Although it demands more storage space than R*-tree or quad-tree, it gains better performance in insertion, deletion, and searching especially, and the more the amount of spatial data is, the better performance the hybrid-tree has.

You might also be interested in these eBooks

Applied Mechanics and Mechatronics Automation

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 182-183)

Pages:

2030-2034

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.182-183.2030

Citation:

Cite this paper

Online since:

June 2012

Authors:

Xiao Yu Song, Yong Hui Wang, Shou Jin Wang

Keywords:

QR-Tree, Quad-Tree, R-Tree, Spatial Indexing

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Zhang Ming-bo, Lu Feng, Shen Pai-wei et al. The Evolvement and Progress of R-Tree Family [J]. Chinese Journal of Computers, 2005, 28(3)：289-300.

Google Scholar

[2] Kyoung Soo Bok, Ho Won Yoon, Dong Min Seo et al. Indexing the Current Positions of Moving Objects on Road Networks[J]. Lecture Notes in Computer Science, 2007, (4537): 247-252.

DOI: 10.1007/978-3-540-72909-9_28

Google Scholar

[3] N Beckmann, H P Kriegel , R Schnieider etal. The R*-tree : An Efficient and Robust Access Method for Points and Rectangles[C]. In: Proc ACM SIGMOD, Atlantic City, USA, 1990. 300-350.

DOI: 10.1145/93605.98741

Google Scholar

[4] Ji-Dong Chen, Xiao-Feng Meng. Indexing Future Trajectories of Moving Objects in a Constrained Network[J]. Journal of Computer Science and Technology, 2007, 22(2): 245-251.

DOI: 10.1007/s11390-007-9031-9

Google Scholar

[5] Brakatsoulas S., Pfoser D., Theodoridis Y., Revisiting R-tree construction principles[C]. In Proceedings of the 6th ADBIS, Bratislava, Slovakia, 2009, 149~162.

DOI: 10.1007/3-540-45710-0_13

Google Scholar

[6] Lee T., Sukno. OMT: Overlap minimizing top-down bulk loading algorithm for R-tree. Advanced Information Systems Engineering, 2008, 7: 69-72.

Google Scholar