期刊文献+

一种基于B+树的混合索引结构 被引量:11

Hybrid Index Structure Based on B+ Tree
下载PDF
导出
摘要 针对文件中存在字符属性和数值属性特点的数据,提出一种基于B+树的2层混合索引结构。在索引创建过程中,将文件中的数据根据其类型进行分类,第1层是为数据属性建立B+树索引结构,第2层是根据不同的数据类型建立不同的索引结构。实验结果表明,该索引结构能实现跨数据范围的检索,提高索引的创建速度和空间利用率。 Considering the numerical attribute data's cross-data range retrieval needs for the files that have the property of character and number, a 2-layer hybrid index structure based on B+ tree is proposed. That data in the files is classified according to their types in the process of creating index, the first layer sets up a B+ tree index structure for the attribute of the data and the second layer constructs different index structure according to the different types of data. Experimental results show that the hybrid index structure not only adapts to the above retrieval needs, but also effectively improves the index creation speed and the space utilization.
出处 《计算机工程》 CAS CSCD 2012年第14期35-37,40,共4页 Computer Engineering
基金 国家"973"计划基金资助项目(2009CB426302)
关键词 倒排索引 B+树 混合索引 时间开销 空间利用率 查询效率 inverted index B+ tree hybrid index time overhead space utilization query efficiency
  • 相关文献

参考文献8

二级参考文献47

  • 1刘小珠,孙莎,曾承,彭智勇.基于缓存的倒排索引机制研究[J].计算机研究与发展,2007,44(z3):153-158. 被引量:8
  • 2李栋,史晓东.一种支持高效检索的实时更新倒排索引策略[J].情报学报,2006,25(1):16-20. 被引量:6
  • 3Schmuck F, Haskin R. GPFS: A Shared-dlsk File System for Large Computing Clusters//Darrell D E, ed. Proceedings of the Conference on File and Storage Technologies. Monterey: FAST02,2002: 231-244
  • 4Seltzer M. Analysis of extent allocation policies in file systems. Masters Report. EECS Dept. , University of California, Berkeley,Ca,1988; 1-73
  • 5Berchtold S, Keim D A, Kriegel H P. The X-Tree: An index structure for high-dimensional data//Anon, ed. Proceedings of the 22th International Conference on Very Large Data Bases India. 1996 : 28-39
  • 6Johson T, Shasha D. The performance of concurrent B-tree algorithms. ACM Transaction on Database Systemns, 1993,18 ( 1 ) : 51-101
  • 7Bryant R, Forester S R, Hawkes J. Filesystem performance and scalability in linux 2. 4. 17//Anon, ed. Proceedings of the USENIX Annual Technical Confernce. CA: USENIX Association, 2002 : 235-245
  • 8Hitz D, Lau J, Malcolm M. File System Design for an NFS File Server Appliance//Anon, ed. Proceedings of USENIX 1994. San Francisco : Network Appliance, 1994 : 103-105
  • 9[1]D E Knuth.The Art of Computer Programming,Sorting and Searching.1st ed.Reading,MA:Addision-Wesley,1973
  • 10[2]Gonzalo Navarro,Edleno Silva Demoura,Nivio Ziviani.Adding compression to block addressing inverted indices.Information Retrieval Journal,2000,3(1):49-77

共引文献27

同被引文献88

  • 1沈文海.从云计算看气象部门未来的信息化趋势[J].气象科技进展,2012,2(2):49-56. 被引量:31
  • 2徐德智,郭玉珂,孙莹,陈学工.XML数据B树存储索引研究[J].计算机工程与应用,2004,40(22):168-170. 被引量:3
  • 3高洁,吉根林.文本分类技术研究[J].计算机应用研究,2004,21(7):28-30. 被引量:36
  • 4郎洪亮.全国气象宽带网络系统体系结构研究[J].气象科技,2006,34(B09):1-4. 被引量:16
  • 5CHEN Su, Doi B C, Tan K L, et al. STe B-Tree: A Self tunable Spatio-Temporal B+-Tree Index for Moving Objects [C]//Proc of SIGM()D~08. New York: ACM Press, 2008:29 42.
  • 6Wires J, Feeley M J. Secure File System Versioning at the Block Level [C]//Proceedings of the End ACM SIGOPS/EuroSys European Conference onCompu*er Systems. New York: ACM, 2007: 203-215.
  • 7Yu C, Bailey J, Montefusco J, et al. Enhancing the B-Tree by Dynamic Node Popularity Caehing[J]. Information Processing Letters, 2010, 110(7): 268-273.
  • 8I.IU Xiao-zhu. Efficient Maintenance Scheme of Inverted Index for I.arge-Scale Full Text Retrieval [C]//Proc of International Conf on Future Computer and C;ommunication. Piscataway.- IEEE Press, 2010: 565-570.
  • 9CHEN Tian-huang, YAN(; Zhi-yong. The Improvement Based on the B + Tree Index Mechanism [C]// International Conference on Wireless'Communications, Networking and Mobile Computing. Piseataway: IEEE Press, 2007:3139-3142.
  • 10刘彩苹,李仁发,刘喜苹.面向嵌入式数据库的改进B^+-树索引机制[J].计算机工程与科学,2007,29(1):101-102. 被引量:7

引证文献11

二级引证文献43

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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