期刊文献+

大型空间数据库的并发索引策略CQR树 被引量:2

CQR-Tree:Concurrent Strategy for Spatial Index Structure in Spatial Database
原文传递
导出
摘要 提出了适用于客户端模式空间数据库引擎并发控制的空间索引结构——CQR树,将静态R树与四叉树相结合,采用四叉树编码与空间对象绑定的方式管理被编辑过的对象,仅在删除叶子结点包中的对象时对相关索引包加锁,缩短系统响应时间。算法简单易实现,在保证空间查询效率的前提下解决多客户端并发操作的问题,同时降低了索引的维护难度。 R-tree is incapable of managing spatial objects in concurrent environment, w e proposes the CQR-tree (concurrent quad-tree & R-tree) to satisfy this situation, which is easy to integrate with existing R-tree systems. Firstly, we point out the limitation of R-tree in concurrent environment and the limitation of the R-link tree in the special system. Secondly, we introduce the CQR-tree to solve the problem. Thirdly, we list the algorithms of the CQR-tree, including insert, add, and delete operators, and the query strategy. Then, some experimental results confirm that the proposed CQR-tree performs well in concurrent environment.
出处 《武汉大学学报(信息科学版)》 EI CSCD 北大核心 2009年第7期856-858,863,共4页 Geomatics and Information Science of Wuhan University
基金 国家863计划资助项目(2001AA135190)
关键词 空间数据库 空间索引 并发控制 R树 四叉树 spatial database spatial index concurrent control R-tree quad-tree
  • 相关文献

参考文献5

  • 1Komacker M, Banks D. High Concurrency in R-trees[C]. The 21st International Con~erence on VLDB, Zurich, Switzerland, 1995.
  • 2夏英.多维空间数据索引结构的并发控制方案[J].重庆邮电学院学报(自然科学版),2002,14(1):73-77. 被引量:2
  • 3Chen J K, Huang Y F, Chin Y H. A Study of Concurrent Operations on R-Trees[J]. Infromation Science, 1997,98:263-300.
  • 4张明波,陆锋,申排伟,程昌秀.R树家族的演变和发展[J].计算机学报,2005,28(3):289-300. 被引量:95
  • 5陈俊华,宋关福,李绍俊.基于RDBMS的空间数据库的设计与实现[C].2001年中国GIS年会,成都,2005.

二级参考文献106

  • 1[1]CHAKRABARTI K, MEHROTRA S. Dynamic granular locking approach to phantom protection in R-trees[C]. Proc. of International Conf on Data Engineering, 1998,446-454.
  • 2[2]SONG S, LEE S H, YOO J S. An efficient concurrency control algorithm for high-dimensional index structures[C]. Proc. of the International Conf on Information Intelligence and Systems, 1999.
  • 3[3]KOMACKER M, BANKS D. High-concurrency in R-trees[C]. Proc 21th International conference on VLDB, 1995,134-145.
  • 4[4]MOHAN C, LEVINE F. ARIES/IM: An efficient and high concurrency index management method using write-ahead logging[C]. ACM SIGMOD, 1992. 371-380.
  • 5[5]LEMAN P L, YAO S B. Efficient locking for concurrent operation on B-Trees[C]. ACM TODS, 1981.
  • 6Papadopoulos A.N., Manolopoulos Y.. Performance of nearest neighbor queries in R-trees. In: Proceedings of ICDT, Delphi, Greece, 1997, 394~408.
  • 7An N., Yang Zhen-Yu, Sivasubramaniam A.. Selectivity estimation for spatial joins. In: Proceedings of ICDE, Heidelberg, Germany, 2001, 368~375.
  • 8Sun Chengyu, Agrawal D., Abbadi A.E.. Selectivity estimation for spatial joins with geometric selections. In: Proceedings of EDBT, Prague, Czech Republic, 2002, 609~626.
  • 9Kamel I., Faloutsos C.. Parallel R-trees. In: Proceedings of SIGMOD, San Diego, California, 1992, 195~204.
  • 10Papadopoulos A., Manolopoulos Y.. Similarity query processing using disk arrays. In: Proceedings of SIGMOD, Seattle, Washington, USA, 1998, 225~236.

共引文献95

同被引文献42

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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