A new spatial inder tree based on triangle folding algorithm

摘要：

The index of spatial database is the key technology to improve the efficiency of spatial database storage and the retrieval performance. In this paper, based on the Minimum Bounding Rectangle MBR, a new spatial index tree (dot marked triple tree) based on triangle folding algorithm is proposed to compress data storage space, thereby the storage efficiency of space is increased. Du rin g the pro cess of inserting, deleting, querying, it only needs to find two regions starting from the leaf nodes, I.e. The completely contained by a sub-regional and intersecting with cross-lines. The algorithm can reduce the complexity, find the smallest area of a triangle surrounded and improve the efficiency of the query, comparing to the search beginning directly from the root, it is no longer needs to compare the size of the surrounding area.

关键词： space retrieval MBR triangle folding algorithm compress data storage space

作者: Guobin Li Jine Tang

作者单位: School of Computer Science and Technology Henan Polytechnic University Jiaozuo, China

会议类型: 国际会议

会议名称: 电子商务、工程及科学领域的分布计算和应用国际会议(DCABES 2010)

会议地点: 香港

会议语种:英文

页码: 576-579

在线出版日期: 2010-08-10（万方平台首次上网日期，不代表论文的发表时间）