计算机工程2011，Vol.37Issue(13)：272-274,278,4.DOI:10.3969/j.issn.1000-3428.2011.13.090
基于Bloom过滤器的精确位图索引
Precise Bitmap Index Based on Bloom Filter
肖琳 1梁军 2钮文良1
作者信息
- 1. 北京联合大学应用科技学院,北京,102200
- 2. 北京联合大学电子信息技术实验实训基地,北京,100101
- 折叠
摘要
Abstract
A precise bitmap index named FPT-Index is proposed to solve the problem that the query results are not precise in approximate bitmap index base on bloom filter. FPT-Index uses bloom filter to compress the basic bitmap index and introduces false positive table to screen the query results. The query results from FPT-Index are precise. Through theoretical analysis, the minimum of compression ratio and the corresponding number of hash functions can be worked out when the keyword frequency is confirmed. Experimental results show that FPT-Index does better in compression ratio and search performance than WAH.关键词
位图索引/Bloom过滤器/假阳率/假阳表/压缩率/查询效率Key words
bitmap index/ Bloom Filter(BF)/ false positive probability/ false positive table/ compression ratio/ search efficiency.分类
信息技术与安全科学引用本文复制引用
肖琳,梁军,钮文良..基于Bloom过滤器的精确位图索引[J].计算机工程,2011,37(13):272-274,278,4.
