基于分段位图索引在求解成员查询算法中的研究

The research of evaluating membership query algorithm based on sub-bitmap index

从成员查询的特点出发,对各种位图索引求解成员查询的过程进行介绍。针对分段位图编码模式求解成员查询时,会出现重复扫描位图的情况,提出一种基于分段位图索引求解成员查询的高效算法。

The characteristics of member queries from various members of the bitmap index query solving process are introduced.While having bitmap encoding for solving the sub-member inquiry,there will be duplication of bitmap scans,so we put forward a bitmap index based on sub-efficient algorithm for solving the members of the inquiry.