Abstract
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).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
N. Beckmann, H. P. Kriegel, R. Schneider and B. Seeger, “The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles,” In Proceedings of the ACM SIGMOD International Conference on Management of Data, 1990, pp. 322–331.
Y. I. Chang, C. H. Liao and H. L. Chen, “NA-Trees: A Dynamic Index for Spatial Data,” Journal of Information Science and Engineering, Vol. 19, 2003, pp. 103–139.
C. Faloutsos and I. Kamel, “Beyond Uniformity and Independence: Analysis of R-trees Using the Concept of Fractal Dimension,” In Proceedings of the 13 th ACM Symposium on Principles of Database Principles, 1994, pp. 4–13.
V. Gaede and O. Günther, “Multidimensional Access Methods,” ACM Computing Surveys, Vol. 30, No. 2, 1998, pp. 170–231.
O. Gunther and J. Bilmes, “Tree-Based Access Methods for Spatial Databases: Implementation and Performance Evaluation,” IEEE Transactions on Knowledge and Data Engineering, Vol. 3, 1991, pp. 342–356.
A. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” In Proceedings of the ACM SIGMOD International Conference on Management of Data, 1984, pp. 47–57.
A. Kumar, “G-Tree: A New Data Structure for Organizing Multidimensional Data,” IEEE Transactions on Knowledge and Data Engineering, Vol. 6, 1994, pp. 341–347.
S. T. Leutenegger and M. A. Lopez, “The Effect of Buffering on the Performance of R-Trees,” In Proceedings of the 14 th International Conference on Data Engineering, 1998, pp. 164–171.
K. J. Li and R. Laurini, “The Spatial Locality and a Spatial Indexing Method by Dynamic Clustering in Hypermap System,” In Proceedings of the 2 nd Symposium Large Spatial Databases, 1991, pp. 207–223.
Y. Ohsawa and M. Sakauchi, “A New Tree Type Data Structure with Homogeneous Nodes Suitable for a Very Large Spatial Database,” In Proceedings of the 6 th IEEE International Conference on Data Engineering, 1990, pp. 296–303.
T. Sellis, N. Roussopoulos and C. Faloutsos, “The R +-Tree: A Dynamic Index for Multi-Dimensional Objects,” In Proceedings of the 13 th VLDB Conference, 1987, pp. 507–518.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chang, CC., Shen, JJ., Chou, YC. (2005). FA-Tree — A Dynamic Indexing Structure for Spatial Data. In: Abraham, A., Dote, Y., Furuhashi, T., Köppen, M., Ohuchi, A., Ohsawa, Y. (eds) Soft Computing as Transdisciplinary Science and Technology. Advances in Soft Computing, vol 29. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32391-0_110
Download citation
DOI: https://doi.org/10.1007/3-540-32391-0_110
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25055-5
Online ISBN: 978-3-540-32391-4
eBook Packages: EngineeringEngineering (R0)