A New Spatial Index 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. During the process 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.