A树——一种新颖的空间数据索引方法被引量：1

下载PDF

导出

摘要本文介绍了一种新颖的空间数据索引方法——A树.A树对精确查询、各种拓扑关系上的查询、NN查询以及面向对象语义的良好支持,证明A树不仅具有对空间数据进行索引时的先进性,并且能够满足大多数空间数据库的应用要求.

作者易文根韩波

机构地区武汉大学计算机科学系

出处《电脑与信息技术》 1996年第3期2-6,共5页 Computer and Information Technology

关键词 A树空间数据索引法数据结构

参考文献1

1ShashiShekhar SanjayChawla 谢昆青马修军杨冬青译.空间数据库[M].北京:机械工业出版社,2004.63-88.
2V Gaede, O Gunther. Multidimensional access methods [ J].Computing Surveys, 1998,30(2).
3Yu-chen Fu, Zhi-yong Hu. QR-tree: A hybrid spatial index structure[A]. Proceedings of Second International Conference on Machine Learning and Cybernetics[ C ]. Xi' an, 2-5 November 2003.
4A Guttman. R-tree: A dynamic index structure for spatial searctfing[ A]. Proc. ACM SIGMOD Conf. [C]. Boston, MA,1984.47-57.
5Finkel R, Bentley J L. Quadtree: A data structure for retrieval of composite keys[J]. Aeta Inf., 1974(4) : 1-9.
6N Becknmnn, H Kriegel, R Schneider, et al. The R* -tree: An efficient and robust access method for points and rectangles[ A]. Proc. ACM SIGMOD Conf. [ C]. Atlantic City, NJ, 1990.
7J P Peloux, G Reynal de St Miclrel, Michel Scholl. Evaluation of Spatial Indices Implemented with the DB.MS O2[DB/OL].http://osage, inria, fr/verso/Gemo/PUBLI/all-byyear, php,2001-06-01.
8Hutflesz A , H W Six, P Widmayer. Globally order preserving multidimensional liner hashing[ A]. Proc. 4th IEEE Int. Conf.on Data Eng. [C]. 1998.572-579.
9Smith T R, P Gao. Experimental performance evaluations on spatial access methods[ A]. Proc. 4th Int. Symp. on Spatial Data Handing[C] .Zurich, 1990.991-1002.
10Greene D. An implementation and performance analysis of spatim data access methods[A].Proc. 5th IEEE Int. Conf. on Data Eng. [ C] .1989.606-615.

电脑与信息技术

1996年第3期

内容加载中请稍等...