FA-Tree - A dynamic indexing structure for spatial data

Non-standard database applications such as CAD/CAM or geographic information processing are becoming increasingly important. Such application systems must be equipped with the capability of effective accessibility to spatial data. The spatial domain consists of many spatial objects that are made up of points, lines, regions, and even high dimensional data. In order to effectively manipulate the spatial data, the tree structure is applied. In this paper, we consider such problems as spatial data retrieval, dynamic manipulation and storage utilization by indexing the large spatial data. A new tree structure, Five-Area Tree (denotes to FA-Tree), is proposed to organize the spatial data. Also, our experimental results show that the FA-Tree has better storage utilization than the Nine-Area Tree (also known as the NA-Tree).