引用本文:肖予钦,张巨,景宁,李军.基于R树的方向关系查询处理.软件学报,2004,15(1):103-111
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览 5004次   下载 6745 本文二维码信息
码上扫一扫!
分享到: 微信 更多
基于R树的方向关系查询处理
肖予钦1, 张巨1, 景宁1, 李军1
国防科学技术大学,电子科学与工程学院,湖南,长沙,410073
摘要:
方向关系描述了对象间的空间顺序关系.近年来,方向关系查询处理逐渐受到空间数据挖掘和地理信息系统等空间数据库应用领域研究者的关注.方向关系查询处理需要执行方向连接操作,目前有关空间连接的研究主要集中在拓扑关系和距离关系方面,而较少考虑方向关系.研究了基于R树的方向关系查询处理方法,定义了四元组模型表示对象MBR间的方向关系,提出了基于R树的处理方向关系查询过滤(filter)步骤的方法,并将提炼(refinement)步骤细化为3种不同的操作.所提出的方法能够高效处理任意对象间的方向关系查询.考虑到空间数据挖掘中方向关系查询通常是在满足一定距离约束条件的对象之间进行,还提出了一种同时利用方向和距离约束限制R树搜索空间的查询处理算法.实验证明,与不利用R树的方向关系查询处理方法相比,所提出的方法在I/O开销和CPU开销两方面都具有很高的性能.
关键词:  方向关系  方向连接  空间数据库  空间数据挖掘  地理信息系统
DOI:
分类号:
基金项目:Supported by the National High-Tech Research and Development Plan of China under Grant Nos.2002AA131010, 2002AA134010 (国家高技术研究发展计划(863)); the Pre-Research Project of National University of Defense Technology of China under Grant No.JC02-04-18 (国防科学技术大学预研基
Direction Relation Query Processing Using R-Trees
XIAO Yu-Qin,ZHANG Ju,JING Ning,LI Jun
Abstract:
Direction relations deal with order in space. Recently, direction relation query processing has gradually gained attention in geospatial databases applications, such as Spatial Data Mining (SDM) and GIS (geographic information system). The processing of direction relation queries needs spatial join operations. Until now, the research work on processing of spatial joins has primarily focused on topological and distance relations. There is little work on processing joins with direction predicates. This paper presents an efficient method for processing direction relation queries using R-trees. The quad-tuples model is defined to represent direction relations between MBRs (minimum bounding rectangles) of spatial objects. An algorithm of processing the filter step using R-trees is given and the refinement step is further decomposed into three different operations. The method presented can efficiently process direction relation queries between objects of any data types in a 2D space. Using both direction and distance constraints restricting the search space when traversing R-trees, this paper also presents an algorithm of direction relation query processing in SDM. Performance evaluation of the proposed method is conducted using real world datasets and the experiment results show that it performs well with respect to both I/O- and CPU-time.
Key words:  direction relation  direction join  spatial database  spatial data mining  GIS (geographic information system)

引用本文:
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览次   下载  
分享到: 微信 更多
摘要:
关键词:  
DOI:
分类号:
基金项目:
Abstract:
Key words: