A Kind of Index Technology Based on Binary Tree Efficient Space

Hong Ming Chen; Hai Yan Zhou

doi:10.4028/www.scientific.net/AMM.239-240.1537

Paper Titles

Fuzzy-Neural Networks Based on Subtractive Clustering and its Applications in Soft Sensor
p.1516

A Determinant Elimination Method for Bottleneck Assignment and Generalized Assignment Problems
p.1522

An Improved Quantum-Inspired Evolutionary Algorithm Based on P Systems with a Dynamic Membrane Structure for Knapsack Problems
p.1528

Classification of Chinese Herbal Medicine Based on Improved LDA Algorithm Using Machine Olfaction
p.1532

A Kind of Index Technology Based on Binary Tree Efficient Space
p.1537

A Parallel BP Neural Network Based on the FPGA
p.1541

A Fractal Based Subpixel Image Edge Detection Algorithm
p.1546

Research on Intelligent Layout System of Blanking Parts
p.1552

A Heuristic Algorithm on Solving the Great Group Dividing of Figure
p.1557

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 239-240A Kind of Index Technology Based on Binary Tree...

A Kind of Index Technology Based on Binary Tree Efficient Space

Abstract:

Space index is one of the key technologies of spatial database, and also one of the biggest problems with puzzling GIS workers. So , how to build a more effective spatial index structure ,which has been the most realistic, most urgent, also to the forefront of research subject to GIS domain and graphics processing. This paper introduces several typical spatial index methods in the e GIS domain and graphics processing fields, and puts forward a binary tree index structure generated space grid step by step. The average time complexity of the index structure is the same with the quad tree index structure, but the maximum time complexity is reduced a third than the quadtree index structure, that is, the search efficiency improving a third.

You might also be interested in these eBooks

Measurement Technology and its Application

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 239-240)

Pages:

1537-1540

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.239-240.1537

Citation:

Cite this paper

Online since:

December 2012

Authors:

Hong Ming Chen, Hai Yan Zhou

Keywords:

Binary Tree Index, Spatial Database, Spatial Index Method

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Dong Peng, Yang ChongJun, Rui XiaoPing. A selecting algorithm based on improved GIS space of the four binary tree. Computer engineering and applications, 2003, 13: -61(In Chinese).

Google Scholar

[2] Zheng MeiXia, Wang YanBing, Ma XiangXu. The efficient synthesis algorithm based on the four binary tree index constructing TIN . Geographic and geographic information science, 2012, 28 (2) : -23.

Google Scholar

[3] Guo LiJin; Shuai WuXi; Li Ying; Li FuXiang. The algorithm of four binary tree based on adaptive grid. Control and decision, 2011, (11) : 1690-1694.

Google Scholar

[4] Xie ShunPing; Feng XueZhi; Wang JieChen; Zhou LiGuo. A construction algorithm and four binary tree based on an advantaged attribute storage . Wuhan university press (information science edition) 2009, 34 (6) : 663-666(In Chinese).

Google Scholar

[5] Zhao Bo; Bian FuLing. The dynamic four binary tree space index algorithm for the mobile GIS . Computer engineering. 2007, (15) : 86-87(In Chinese).

Google Scholar