期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于SR-树的空间对象反最近邻查询技术研究 被引量：2

Nearest Neighbor Queries of Spatial Object Based on SR-tree
下载PDF
导出
摘要 反最近邻查询是空间数据库的重要应用之一,是在最近邻查询基础上提出的一种新的查询类型,以往基于范围查询或最近邻查询的方法搜索影响集效率不高,本文在分析RNN查询的基本概念和存储区域的基础上,区别于R*-树,提出了基于SR-树的RNN查询方法,优化了空间对象的反最近查询性能,在高维空间查询上具有明显优势。 The nearest neighbor query is one of the most important applications in spatial database,its conception extension,namely in the similarity queries of objects,which uses former location query and range query can not well solve the nearest neighbor query.On the foundation of analyzing the basic concepts and storage range of NN queries,this paper proposes an approach,which is different from former ones based on SR-tree multi-objects NN query method.In the method proposed an optimal scheme is achieved by finding out the nearest one or k spots in the case of some query spots.
作者 张奋 肖政宏
机构地区 湖南文理学院计算机系 中南大学信息与工程学院
出处 《西华大学学报（自然科学版）》 CAS 2007年第3期44-47,共4页 Journal of Xihua University:Natural Science Edition
基金 湖南省教育厅科研基金项目(No.05C719)
关键词 R＊-树 SR-树 反最近邻 空间对象 R*-tree SR-tree nearest neighbor spatial object
分类号 TP311 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献4

  • 1[1]Roussopoulos N,Kelley S,Vincent F.Nearest Neighbor Queries[C].Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data,1995:71-79.
  • 2[2]N.Katayama,S.Satoh.The SR-tree:An Index Structure for High-dimensional Nearest Neighbor Queries[C].Transactions of the Institute of Electronics,Information and Communication Engineers,1997,703-717.
  • 3[3]R.Kumiawati,JS Jin and JA Shepherd.The SS + -tree:An Improved Index Structure for Similarity Searches in a High-dimensional Feature Space[C].Proc.of SPIE/IS&T Conf.on Storage and Retrieval for Image and Video Databases,San Jose,CA,1997:110-120.
  • 4郝忠孝,刘永山.空间对象的反最近邻查询[J].计算机科学,2005,32(11):115-118. 被引量：11

二级参考文献5

  • 1Kom F, Muthukrishnan S. Influence Sets Based on Reverse Nearest Neighbor Queries. In: Weidong Chen, Jeffrey F. Naughton and Philip A. Bernstein,eds. Proc. of the 2000 ACM SIGMOD Intl. Conf. on Management of Data, Dallas, Texas, USA, 2000. New York,NY,USA,ACM Press,2000. 201-212.
  • 2Yang C, Lin K I. An Index Structure for Efficient Reverse Nearest Neighbor Queries. In: George Kollios, ed. Proc. of the IEEE Intl. Conf. onData Engineering, Heidelberg, Germany, 2001.Washington, IEEE Computer Society, 2001. 485-492.
  • 3Berchtold S, Bohm C. On Optimizing Nearest Neighbor Queries in High-Dimensional Dats Spaces. In: Jan Van den Bussche, Victor Vianu,eds Database Theory-ICDT 2001, 8th Intl. Conf London,UK,2001. Springer,2001.435-449.
  • 4Katayama N,Satoh S. The SR-tree:An Index Structure for Highdimens ional Nearest Neighbor Queries. Transactions of the Institute of Electronics, Information and Communication Engineers,1997. 703-717.
  • 5White D A,Jain R. Similarity Indexing with the SS-tree. Stanley Y. W. Su. ICDE, New Orleans, Louisiana, 1996. Washington,IEEE Computer Society, 1996. 46-52.

共引文献10

同被引文献7

  • 1郝忠孝,刘永山.空间对象的反最近邻查询[J].计算机科学,2005,32(11):115-118. 被引量：11
  • 2程淼,胡圣,袁正午,葛君伟,裴海英.时空数据库中多个最近邻对象的查询算法[J].计算机工程,2006,32(19):60-61. 被引量：7
  • 3Roussopoulos N,Kelley S,Vincent F.Nearest Neighbor Queries[C] //The 1995 ACM SIGMOD International Conference on Management of Data.SanJose,California,USA:[s.n.].1995:71-79.
  • 4Korn F,Muthukrishnan S.Influence sets based on reverse nearest neighbor queries[C] //The 2000 ACM SIGMOD International Conference on Management of Data.Dallas,Texas,USA:[s.n.].2000:201-212.
  • 5Yang C,Lin K I.An Index Structure for Efficient Reverse Nearest Neighbor Queries[C] //Proceedings of the IEEE International Conference no Data Engineering.Washington:IEEE Computer Society,2001-485-492.
  • 6Katayama N,Satoh S.The SR-tree:An Index Structure for High Dimensional Nearest Neighbor Queries[C] //Proc.ACMSIGMOD Int.Conf.on Management of Data.[s.l.] :[s.n.].1997:703-717.
  • 7陈菲,秦小麟.空间索引的研究[J].计算机科学,2001,28(12):59-62. 被引量：8

引证文献2

二级引证文献1

西华大学学报（自然科学版）
2007年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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