检索
E-mail
RSS
作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (16): 85-86.doi: 10.3969/j.issn.1000-3428.2008.16.029

• 软件技术与数据库 • 上一篇    下一篇

一种新型索引结构

黎浩宏   

  1. (浙江工贸职业技术学院信息工程系，温州 325003)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-08-20 发布日期:2008-08-20

Novel Index Structure

LI Hao-hong   

  1. (Department of Information Engineering, Zhejiang Industry & Trade Polytechnic, Wenzhou 325003)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-08-20 Published:2008-08-20

PDF

1232

被引次数

2

摘要： 传统Hash算法中溢出桶与主桶、溢出桶与溢出桶之间一般通过指针实现链接，对海量数据的等值查询采用指针方式效率很低。该文提出一种动态哈希索引算法，用B+树结构表示桶地址表，在桶地址表与记录键值之间建立一个B+树结构，通过二分查找可直接找到相应桶元素。实验结果表明，该算法的综合性能优于其他索引，其等值查询效率提高了15%。

关键词: 哈希算法, B+树, 索引

Abstract: In conventional Hash algorithms, the overflow buckets are linked with not only main bucket but also overflow bucket by the pointer. It is inefficient to search a value corresponding to a overflow bucket. This paper presents a novel dynamic Hash indexing structure called DL tree which uses B+tree structure to describe bucket address table, and establishes a B+tress between the bucket address table and register key assignments. The bucket element can be found by dimidiate research. The experimental results show that its comprehensive performance is better than other indexing algorithm. It can improve 15% of the equivalent inquiry efficiency.

Key words: Hash algorithm, B+tree, index

中图分类号: