西安理工大学学报2017，Vol.33Issue(1)：13-17,5.DOI:10.19322/j.cnki.issn.1006-4710.2017.01.003
哈希桶Variety-B树的数据流处理方法
Storage and query of data stream based on Hash bucket Variety-B Tree
摘要
Abstract
To facilitate the flow of data storage and query,the paper proposes an improved Variety-B Tree structure.By opening up the circular buffer in memory and introducing the concept of hash buckets,a novel hash function is designed to reduce hash bucket address conflicts caused by data storage so as to improve query efficiency.Based on the above methods,the algorithms of store and query of the data stream are designed and analyzed.Experimental results show that the improved Variety-B Tree of computer resources to store and query historical data streams costs less consumption than the Variety-B Tree.关键词
数据流/Variety-B树/循环缓冲区/哈希桶Key words
data stream/Variety-B Tree/circular buffer/Hash bucket分类
信息技术与安全科学引用本文复制引用
王竹荣,伊珍珍,黑新宏,冯华萍,费蓉..哈希桶Variety-B树的数据流处理方法[J].西安理工大学学报,2017,33(1):13-17,5.基金项目
国家自然科学基金资助项目(61273127,U1334211) （61273127,U1334211）
陕西省重大科技统筹创新资助项目(2015KTZDGY01-04) （2015KTZDGY01-04）
陕西省教育厅产业化专项资助项目(15JF024) （15JF024）
