期刊文献+

基于直角多边形近似的空间连接查询 被引量:4

Spatial Join Query Based Orthogonal Polygons Approximation
在线阅读 下载PDF
导出
摘要 空间查询效率是衡量空间数据库性能的关键 ,而空间连接查询是最耗时、最重要的空间查询 .本文在分析了空间连接以往工作的基础上 ,采用一种新的空间近似方法——直角多边形近似 ,改进空间对象的近似精度 ,并用于基于 R树的空间连接方法 ,给出了连接算法 ,并用实验验证了方法的有效性 . Efficiency of spatial query is the key to evaluate the performance of spatial databases. Spatial join is the most time-consuming and important query. After analyzing the previous researches on the spatial join, this paper introduced a new method, orthogonal polygons, to approximate actual spatial data in spatial access methods and, to join spatial relation based on R-trees, an algorithm for spatial join was given. The experiment reveals the flexibility of the methods.
出处 《上海交通大学学报》 EI CAS CSCD 北大核心 2001年第2期279-282,共4页 Journal of Shanghai Jiaotong University
关键词 空间连接 空间存取方法 R树 空间数据库 Data acquisition Database systems Query languages Trees (mathematics)
  • 相关文献

参考文献7

  • 1[1]Gaede V, Gunther O. Multidimentional access methods[J]. ACM Computing Surveys, 1988,30(2):123~169.
  • 2[2]Orenstein J A. Spatial query processing in an objectoriented database system [A]. Proc ACM SIGMOD Int Conf on Management of Data[C]. Washington D C, 1986. 181~190.
  • 3[3]Brinkhoff T, Kriegel H P, Seeger B. Efficient processing of spatial joins using R-trees[A]. ACM SIGMOD Int Conf on Management of Data[C]. 1993. 237~246.
  • 4[4]Lo M L, Ravishankar C V. Spatial hash joins[A]. ACM SIGMOD[C]. Washingtion D C, 1996. 247~258.
  • 5[5]Lo M L, Ravishankar C V. The design and implementation of seeded trees: an efficient method for spatial joins[J]. IEEE Trans on Knowledge and Data Engineering, 1998,10(1):136~152.
  • 6[6]Guttman A. R-tree: a dynamic index structure for spatial search[A]. Proc ACM SIGMOD Int Conf on Management of data[C]. Boston M A, 1984.47~57.
  • 7[7]Esperanca C, Samet H. Orthogonal polygons as bounding structures in filter-refine query processing strategies [A]. Proc The 5th Symposium on Spatial Databases[C]. Berlin, 1997. 197~220.

同被引文献15

  • 1张明波,陆锋,申排伟,程昌秀.R树家族的演变和发展[J].计算机学报,2005,28(3):289-300. 被引量:95
  • 2崔阳,王华,乔淑娟.基于GIS的空间数据库构建与应用研究[J].微计算机信息,2006,22(02X):199-201. 被引量:32
  • 3Guttman A. R-tree: A dynamic index structure for spatial search [C]. Pro.ACM SIGMOD.Ann.Meeting,1984:47-57.
  • 4Theodoridis Y, Stefanakis, Sellis T. Efficient cost models for spatial queries using R-trees [J]. IEEE Transactions on Knowledge and Dat a Engineering, 2000,12(1): 19-32.
  • 5Mamoulis N, Papadias D. Muhiway. Spatial Joins[J]. ACM Trans. On Database Syst., 2001, 26(4): 424--475.
  • 6Brinkhoff T., Kriegel H.P., Schneider R. Comparison of Approximations of Complex Objects used for Approximation-based Query Processing in Spatial Database Systems[C]. Proc. 9th Int.Conf. on Data Engineering(ICDE). Austria: Vienna, 1993: 40--49.
  • 7Shekhar S,Chawla S.谢昆青,等.空间数据库[M].北京:机械工业出版社,2004,1~300.
  • 8Guttman A. R-Trees: A dynamic index structure for spatial searching [C].Proc. ACM SIGMOD Conf. Ann. Meeting, 1984:47-57.
  • 9李俊洁.基于直角多边形近似的R树插入算法[J].信息技术,2007,31(11):93-95. 被引量:1
  • 10方裕,楚放.空间查询优化[J].中国图象图形学报(A辑),2001,6(4):307-314. 被引量:11

引证文献4

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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