%0 Journal Article
%T Variable Hashing for Temporal Data<br>时态数据的可变Hash索引
%A JIANG Xia-Jun
%A WU Hui-Zhong
%A LI Wei-Qing
%A <br>蒋夏军
%A 吴慧中
%A 李蔚清
%J 计算机科学
%D 2006
%I 
%X 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.
%K Temporal database
%K Variable hashing method
%K Snapshot query
%K Timecomplexity<br>时态数据库
%K 可变Hash索引
%K 快照查询
%K 时间复杂度
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=DDE3CABA20F36170&yid=37904DC365DD7266&vid=27746BCEEE58E9DC&iid=CA4FD0336C81A37A&sid=B47A0E731AF43EB2&eid=76B5E24D6EC46B4B&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=8