期刊文献+

一种适用于点和区间混合型维度数据集的多维索引 被引量:1

A Multidimensional Indexing for Data Sets of Point and Interval Dimensions
下载PDF
导出
摘要 点和区间混合型维度数据集是空间数据库系统和GIS中重要的数据对象。在分析研究R*树和SS树的基础上,提出了一种适用于索引点和区间混合型维度数据集的索引结构——PI树。PI树利用超球划分数据集的多维空间,以提高结点存储利用率,从而降低数据插入时的I/O次数。文章给出了PI树插入、删除和查询算法的形式化描述。理论分析和实验结果表明,所提的PI树性能上总体优于R*树。 Data sets of point and interval dimensions are important in spatial database system and GIS. This paper proposes an index structure PI-tree for the data sets of point and interval dimensions, based on an analysis of R^* -tree and SS-tree, of which the former is used to demarcade multidimensional space of data set using hyper-sphere with the aim of improving accessing and reducing the I/O times of inserting data. Furthermore, the algorithm of insertion, deletion and retrieval of H-tree is also presented. Finally, the analysis and results of experiment show that PI-tree outperforms R^*-tree.
出处 《国防科技大学学报》 EI CAS CSCD 北大核心 2009年第3期104-109,共6页 Journal of National University of Defense Technology
基金 国家自然科学基金资助项目(60172012) 湖南省自然科学基金重点资助项目(03JJY3110)
关键词 点和区间混合型维度 多维索引 PI树 point and interval dimensions multidimensional indexing PI-tree
  • 相关文献

参考文献9

  • 1Gaede V, Gunther O. Multidimensional Access Methods[J]. AC..M Computing Surveys, 1998,30(2) : 170 - 231.
  • 2Guttman A. R-tree: A Dynamic Index Structure for Spatial Searching[ C]//Proceedings of the ACM SIGMOD International Conference on the Management of Data, 1984:47 - 54.
  • 3Beckmann N,Kriegel H,Schneider R ,et al.The R* tre:An Efficient and Robust Access Methods for Points and Rectangles[C]//Proceedings of the SCM SIGMOD Internatiolan Conference on the Management of Data,1990:322-331.
  • 4White D A, Jain R. Similarity Indexing with the SS-tree[ C]//Proceedings of the 12^th IEEE International Conference on Data Engineering, 1996:516 - 523.
  • 5Katayama N, Satoh S. The SR-tree: An Index Structure for High-dimensional Nearest Neighbor Queries[C]//Proceedings of the ACM SIGMOD International Conference on the Management of Data, 1997:369 - 380.
  • 6杨建武,陈晓鸥.半结构化数据相似搜索的索引技术研究[J].计算机学报,2002,25(11):1219-1226. 被引量:11
  • 7陈冬霞,吉根林,方昭辉.基于内容的图像检索中SS-树索引的Java实现[J].南京师范大学学报(工程技术版),2005,5(4):53-56. 被引量:2
  • 8张明波,陆锋,申排伟,程昌秀.R树家族的演变和发展[J].计算机学报,2005,28(3):289-300. 被引量:94
  • 9古毅,吴中福,魏丽,钟将,马金亮.高维空间数据索引结构分析研究[J].计算机科学,2006,33(5):142-145. 被引量:2

二级参考文献130

  • 1[3]White D A, Jain R. Similarity indexing with the SS-tree [C]// Proc 12th IEEE Int Conf on Data Engineering. New Orleans, 1996: 516-523.
  • 2[4]Wang S, Hellerstein J, Lipkind I. Near-neighbor query performance in search trees [C]// Technical Report. California: UC Berkeley, 1998: CSD-98-1012.
  • 3[5]Roussopoulos N, Kelly S, Vincent F. Nearest neighbor queries [C]// Proc ACM SIGMOD Int Conf on Management of Data. California: San Jose, 1995: 71-79.
  • 4[6]Zhang H J, Zhong D. A Scheme for visual feature-based image indexing[C]// Proc of SPIE Conf on Storage and Retrival for Image and Video DatabasesIII. California: San Jose, 1995: 36-46.
  • 5Papadopoulos A.N., Manolopoulos Y.. Performance of nearest neighbor queries in R-trees. In: Proceedings of ICDT, Delphi, Greece, 1997, 394~408.
  • 6An N., Yang Zhen-Yu, Sivasubramaniam A.. Selectivity estimation for spatial joins. In: Proceedings of ICDE, Heidelberg, Germany, 2001, 368~375.
  • 7Sun Chengyu, Agrawal D., Abbadi A.E.. Selectivity estimation for spatial joins with geometric selections. In: Proceedings of EDBT, Prague, Czech Republic, 2002, 609~626.
  • 8Kamel I., Faloutsos C.. Parallel R-trees. In: Proceedings of SIGMOD, San Diego, California, 1992, 195~204.
  • 9Papadopoulos A., Manolopoulos Y.. Similarity query processing using disk arrays. In: Proceedings of SIGMOD, Seattle, Washington, USA, 1998, 225~236.
  • 10Koudas N., Faloutsos C., Kamel I.. Declustering spatial databases on a multi-computer architecture. In: Proceedings of EDBT, Avignon, France, 1996, 592~614.

共引文献105

同被引文献1

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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