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

存取代价模型R-tree优化算法的研究

Research of R-tree＇s Optimization Based the Cost Model of Access
下载PDF
导出
摘要 Guttman的R-tree是在空间数据索引上用处最广泛的动态索引。然而试验显示：R-tree及其变种索引的存储使用率仅仅达到70％左右，插入，删除，查询的平均时间也比较高。本文中，提出一个R-tree空间数据索引的存取数目代价模型，在对该模型分析的基础上提出的一种紧骤R-tree算法，这种算法与其他的R-tree及其变种相比是很有竞争力的：它的存储使用率几乎可以达到100％，同时建造一个紧骤R-tree的代价是最低的。 In recent years, spatial database have been increasingly and widely userd.Guttman＇s R-tree is the most popular dynamic index structure for efficiently retrieving objects from a spatial database according to spatial location. However, experiments show Gutman＇s R-tree and its variants can only achieve about 70% storage utilization, and its time＇s cost is also high. In this paper, we present an analytical model that predicts the R-tree according to knowledge of the propefities of nodes. Based on this model, we have modified Guttman＇s R-tree, and got our R-tree,experiments show that this modified algorithm can achieve almost 100% storage utilization and its time cost is also competive with others.
作者 丁建秀
机构地区 浙江省财税信息中心
出处 《电脑知识与技术》 2006年第8期13-14,共2页 Computer Knowledge and Technology
关键词 R-TREE 空间数据结构 优化 R-tree Spatial data structure Optimization
分类号 TP301 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献2

二级参考文献16

  • 1Koperski Krzysztof, Han Jiawei. Discovery of spatial association rules in geographic information database [A]. In: Proceedings of the 4th International Conference on Large Spatial Database,Maine, 1995. 47～66.
  • 2Haining Robert. Spatial Data Analysis in the Social and Environmental Sciences[ M ]. Cambridge: Cambridge University Press, 1989.
  • 3Krugman Paul. Development, Geography, and Economic Theory [M]. Cambridge: MIT Press, 1997.
  • 4Cressie Noel A C. Statistics for Spatial Data [M]. New York:John Wiley and Sons, 1993.
  • 5Agarwal Rakesh, Srikant Ramakrishnan. Fast algorithms for mining association rules [A]. In: Proceedings of the 20th International Conference on Very Large Data Bases, Santiago,Chile, 1994. 487～499.
  • 6Morimoto Yasuhiko. Mining frequent neighboring class sets in spatial databases [A]. In: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, California, 2001. 353～358.
  • 7Shekhar Shsshi, Huang Yan. Discovering spatial co-location patterns: A summary of results [A]. In: Proceedings of the 7th International Symposium on Spatial and Temporal Databases,Redondo Beach, CA, 2001. 236～256.
  • 8[美]ShekharShashi SanjayChawla 谢昆青 马修军 杨冬青 译.空间数据库[M].北京:机械工业出版社,2004..
  • 9Huang Yan, Xiong Hui, Shekhar Shashi, et al. Mining confident co-location rules without a support threshold [A]. In:Proceedings of the 2003 ACM symposium on Applied Computing, Melbourne, Florida, 2003. 497～501.
  • 10A Guttman. R-tree: A dynamic index structure for spatial search[A]. In: Proceedings of Annual Meeting on SIG on Management of Data. Boston, Massachusetts, 1984. 47～57

共引文献6

电脑知识与技术
2006年 第8期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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