期刊文献+

向量空间划分类索引的动态更新代价分析 被引量:2

Cost analysis for dynamic update of vector space partitioning strategy index
下载PDF
导出
摘要 代价分析是借助代价模型预测和评估空间索引结构的一种有效方法。针对索引的空间划分和数据划分这两种策略,在已有的索引结构基础上建立了向量空间划分类型索引的代价模型,该模型可实现查询以及动态更新的性能评价。以KDB-树系为评估对象,从结点存取次数(NA)值推导计算出页面存取次数(PA)的估计值,并在标准数据分布上对估计值的相关误差率进行了验证。结果表明代价模型的平均相关误差率较低,不超过12%。代价分析的结果有助于对索引结构的动态更新代价的预估和查询的优化。 Cost analysis can predict and estimate the spatial index structure with the cost model.According to two main index partition strategy named space partition and data partition,the efficient cost model is presented to estimate the query and dynamic update of the vector space partitioning strategy index.The new cost model deduces and calculates the estimated value of page access from the number of node access based on the KDB-tree family.The experiment result indicates that the average relative error ratio of estimated value is less than 12% on the typical uniform data distribution.The result of cost analysis contributes to the performance prediction of dynamic update in index and the optimization in query.
出处 《计算机工程与应用》 CSCD 北大核心 2009年第18期18-21,共4页 Computer Engineering and Applications
基金 国家自然科学基金No.60673136 黑龙江省自然科学基金No.F200601~~
关键词 代价模型 空间划分 索引结构 KDB-树系 cost model space partition index structure KDB-tree family
  • 相关文献

参考文献7

二级参考文献22

  • 1张明波,陆锋,申排伟,程昌秀.R树家族的演变和发展[J].计算机学报,2005,28(3):289-300. 被引量:94
  • 2肖伟器,冯玉才,肖大海.地图数据库中的空间索引[J].计算机工程与应用,1995,31(2):10-13. 被引量:10
  • 3龚育昌,王卫红.e—B^+树:面向多用户数据库系统优化的索引技术[J].软件学报,1996,7(5):314-320. 被引量:5
  • 4Faloutsos C, Kamel I. Beyond uniformity and independence:analysis of r-trees using the concept of fractal dimention [C].Proc. 13^th ACM PODS Symposium, 1994, 299-310.
  • 5Theodoridis Y, Sellis T. A model for the prediction of r-tree performance[C]. Proe. 15^th ACM PODS Symposium,1996, 341-356.
  • 6Guttman A. R-Trees: A dynamic index structure for spatial searching [C] Proc. ACM SIGMOD Conf. , Ann. Meeting ,1984, 47-57.
  • 7Shakhar Set al. Spatial Databases--Accomplishments and research needs [J]. IEEE Transactions on Knowledge and Data Engineering, Jan./Feb, 1999, 11(1): 45-55.
  • 8Faloutsos C, Sellis T. Analysis of object oriented spatial access methods. Proc. ACM SIGMOD Conf. Management of Data,1987, 151-170.
  • 9Leutenegger S T. The effect of buffering on the performance of R-Trees[C]. Proe. 14^th IEEE Int'l Conf. Data Eng. (ICDE), 1998,337-352.
  • 10Pagel B-U et al. Towards an analysis of range query performance[C]. Proc. 12^th ACM Symp. Principles of Database Systems(PODS), 1993, 293-308.

共引文献27

同被引文献21

  • 1罗丽姗.垂直搜索引擎发展概述[J].图书馆学研究,2006(12):68-70. 被引量:22
  • 2罗伟,李陶深.一种基于本体的个性化搜索引擎模型[J].广西科学院学报,2006,22(4):256-259. 被引量:2
  • 3仇明华,殷丽华,李斌.基于多维二进制搜索树的异常检测技术[J].计算机工程与应用,2007,43(22):122-125. 被引量:3
  • 4吴晓,李丹宁,林洁,等.个性化搜索引擎中用户兴趣模型的研究[C]//第三届全国信息检索与内容安全学术会议论文集,2007.
  • 5Bentley J L.Multidimensional binary search trees used for associative searching[J].Communications of ACM,1975,18(9):509-517.
  • 6Robinson J T.The K-D-B tree:a search structure for large multidimensional dynamic indexes[C] //Proceedings of ACM SIGMOD,1981:10-18.
  • 7Kumar A.G-tree:a new data structure for organization multidimensional data[J].IEEE Transactions on Knowledge and Data Engineering,1994,6(2):341-347.
  • 8Orenstein J A,Merrett T H.A class of data structure for associative searching[C] //Proceedings of the 3rd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems,Waterloo,Canada,1984:181-190.
  • 9Guttman A.R-trees:a dynamic index structure for spatial searching[C] //Proceedings of ACM SIGMOD,1984:47-57.
  • 10Orenstein J A,Merrett T H.A class of data structure for associative searching[C] //Proceedings of the 3rd ACM SIGMOD Symposium on Principles of Database Systems,Waterloo,Canada,1984:181-190.

引证文献2

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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