| Spatial database is widely applied to these fields such as computer vision, computer aided design, computational geometry and geography information system. In spatial database, spatial database index technique is a core problem in its applications. In recent years, the studies about spatial index attract domestic and foreign scholars'great attention. And many structures and approaches about spatial index are successively proposed, but these methods have their own limitations.Firstly, the spatial index technique is introduced overall in this thesis, meanwhile, the formation of spatial data, the spatial object search and spatial object approximate technology are comprehensively described. By the analysis of structure characters and index process of spatial database, the breakthrough of new index structures to improve the properties of spatial database is investigated in the thesis.Secondly, seeking improvement from database's space occupancy and index speed, the index method based on minimum bounding circle is proposed, and a detailed description of structural principle of the spatial index structure is given. In view of the characteristics of spatial index structure based on minimum bounding circle, the algorithms of the query, the search, the node insertion, and the node deletion are given. At the same time, the node splitting algorithm is given when the overflow happens when inserting or deleting the node. Far less storage space is required in the index structure based on minimum bounding circle, and its index speed and accuracy is higher.In spatial direction query field, many spatial data index methods couldn't meet its special needs. In view of the characteristics of spatial direction query, the spatial index approach based on minimum encircling sector is put forward in the thesis, and corresponding search, node insertion and node deletion algorithms of the spatial index structure based on the minimum encircling sector are proposed. |
PDF Full Text Request