首页 | 本学科首页   官方微博 | 高级检索  
     

时态数据的可变Hash索引
引用本文:蒋夏军,吴慧中,李蔚清.时态数据的可变Hash索引[J].计算机科学,2006,33(1):130-133.
作者姓名:蒋夏军  吴慧中  李蔚清
作者单位:南京理工大学计算机系,南京,210094
摘    要:索引技术是时态数据库查询优化的重要方法之一。本文提出的可变Hash(VH)索引是建立在时间属性上的一种新的动态索引技术,主要目的是提高时态数据库快照查询的效率。由于时间的不确定性,在时态数据的时间属性上建立Hash索引比较困难。VH索引克服了Hash索引这一难点,提出了索引参数可变的思想,并应用B^+-树对Hash参数进行组织。查询时由时间值在B^+-树上获得Hash参数,进而确定数据的存储地址。通过对其时间复杂度和空间复杂度的理论分析以及实验验证,表明该索引技术可以减少索引查找以及读取数据的I/O次数,并具有理想的空间利用率。

关 键 词:时态数据库  可变Hash索引  快照查询  时间复杂度

An Experimental Study on Biodegradation of Phenol in Soil
YANG Jun,ZHU Kun,HUANG Tao.An Experimental Study on Biodegradation of Phenol in Soil[J].Computer Science,2006,33(1):130-133.
Authors:YANG Jun  ZHU Kun  HUANG Tao
Abstract:Index technology is one of the important factors during the process of data query optimizing,especially for temporal database.A new hashing method for temporal data is designed to improve the efficiency of database snapshot query in this paper,and the method is called Variable Hashing (VH).Generally,it's difficult to establish hashing in- dex for time value because of the time's indeterminacy.VH solves this problem,and it is based on the start time of a database's transaction time attribute.The parameters of hashing function are variableaccording to the time attribute of tuples,and they are organized as a B~+-tree.Using a time value to query the B~+-tree can get the hashing parameters, and the parameters can be used to calculate the address of target data.Carefull analysis and experimental test show that the time complexity of VH's snapshot query is better than other snapshot index methods,and its space complexity is also optimal.
Keywords:Temporal database  Variable hashing method  Snapshot query  Timecomplexity
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号