期刊文献+

一种高效的空间索引结构 被引量:6

An Efficient Spatial Index Structure
下载PDF
导出
摘要 为高效地处理空间数据 ,必须对数据库建立索引机制以快速存取数据。然而 ,由于空间数据的特殊性使得传统索引方法不能很好地适应空间数据的存取。介绍了一种目前较流行的索引结构———R树及其主要算法。在所研究的空间分析数据库系统SADBS中实现了R树索引。 In order to handle spatial data efficiently, a database system needs an index mechanism that will help it retrieve data items quickly. However, traditional index methods are not well suited to access spatial data objects because of the special properties of spatial data. In this paper we introduce one of the most popular index structure Rtree and its major algorithms. We implement the R-tree indexing in SADBS which is a spatial analysis database system developed by us.
作者 李萍
出处 《盐城工学院学报(自然科学版)》 CAS 2002年第2期27-31,共5页 Journal of Yancheng Institute of Technology:Natural Science Edition
关键词 空间索引结构 空间数据 R树 最小边界矩形 索引机制 空间分析数据库系统 Spatial data Rtree Index Algorithm Minimum bounding rectangle
  • 相关文献

参考文献8

  • 1[1]Guttman A. R-trees:A Dynamic Index Structure for Spatial Searching[J]. In Proc. ACM SIGMOD Intl. Conf. on Management of Data, 1984,(5):47-57.
  • 2[2]Brinkhoff T, Kriegel H P, Seeger B. Efficient processing of spatial joins using R-trees[J]. ACM SIGMOD Int. Conf. on Management of Data. 1993,22(6):237-246.
  • 3[3]Roussopoulos N,Kelley S, Vincent F. Nearest Neighbor Queries[J]. In Proc. ACM SIGMOD conf., 1995,(5):71-79.
  • 4[4]Beckmann N,Kriegel H P, Schneider R etc. The R*tree: An Efficient and Robust Access Method for Points and Rectangles[J]. In Proc. ACM SIGMOD Intl. Symp. on the Management of Data, 1990,19(2):322-331.
  • 5[5]Leutenegger S,Edgington J, Lopez M. STR: a Simple and Efficient Algorithm for Rtree Packing. In Proc[J]. IEEE Intl. Conf. on Data Engineering(ICDE), 1997,(13):497-506.
  • 6[6]Kamel I, Faloutsos C. On Packing R-trees[J]. In Proc. Intl. Conf. on Information and Knowledge Management,1993,(2):490-499.
  • 7[7]Sellis T K, Roussopoulos N, Faloutsos C. The R+-Trees: A Dynamic Index for Multidimensional Objects[J] In Proc. of Intl. Conf. on Very Large Databases(VLDB) 1988,(13):507-518.
  • 8[8]Güting R H, Schneider M. Realms: A Foundation for Spatial Data Types in Database System[J]. Proc. Intl. Symposium on Large Spatial Databases, 1993,(3):14-35.

同被引文献33

  • 1张明波,陆锋,申排伟,程昌秀.R树家族的演变和发展[J].计算机学报,2005,28(3):289-300. 被引量:94
  • 2刘艳,胡卓玮.3维地理信息系统中的视景裁剪[J].测绘与空间地理信息,2005,28(2):64-67. 被引量:3
  • 3张震波,杨鹤标,马振华.基于LRU算法的Web系统缓存机制[J].计算机工程,2006,32(19):68-70. 被引量:30
  • 4白燕斌 史惠康.OpenGL三维图形库编程指南[M].北京:机械工业出版社,1999.93-122.
  • 5王宏武 董士海.一个与视点相关的动态多分辨率地形模型.测绘学报,2003,32(1):47-52.
  • 6OTTOSON P, HAUSKA H. Ellipsoidal Quadtrees for Indexing of Global Geographical Data [ J]. Int, J. Geographical Information Science, 16 (3) : 213 -226.
  • 7Güting RH, Schneider M. Realms: A foundation for Spatial Data Types in Database Systems[A]. Proc. 3rd Intl. Symposium on Large Spatial Databases[C]. Singapore, 1993, 14-35.
  • 8Guttman A. R-tree: A dynamic index structure for spatial searching[ A]. Proc. of the ACM SIGMOD Intl. Conf. on Management of Data[ C], 1984.47 - 54.
  • 9Beckmann N, Kriegel H-P, Schneider R, et al. The R^+ - tree: An Efficient and Robust Access Method for Points and Rectangles[ A].Proc. ACM SIGMOD Intl. Conf. on Management of Data[ C],1990. 322 - 331.
  • 10Sellis TK, Roussopoulos N, Faloutsos C. The R^+ -Trees: A Dynamic Index for Multidimensional Objects[ A]. Prec. of the 13th Infl. Conf. on Very Large Databases(VLDB) [ C], 1988. 507 -518.

引证文献6

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部