Hi zhonghang, > The bitmap size can be calculated as follows: bitmap size = next offset - > offset
Can you use this size to deserialize bitmap from bytes in your pull request [1]? [1] https://github.com/apache/paimon/pull/4956 Best, Jingsong On Thu, Jan 23, 2025 at 5:40 PM zhonghang <1649067...@qq.com.invalid> wrote: > > Hi, JiaLiang. > > > This is the configuration in the code: > public static final int ROW_COUNT = 1000000; > public static final int APPROX_CARDINALITY = 100000; > > > Best, > Zhonghang. > > > zhonghang > 1649067...@qq.com > > > > > > > > > ------------------ 原始邮件 ------------------ > 发件人: > "jialiang tan" > > <tanjialiang1...@gmail.com>; > 发送时间: 2025年1月23日(星期四) 下午5:28 > 收件人: "zhonghang"<1649067...@qq.com>; > > 主题: Re: PIP-30: Optimize bitmap index format > > > > Very thanks to Zhonghang privoding the benchmark! > > Seems to introduce the secondary index is necessary. > > > By the way, how many cardinary in this benchmark? > > > Best, > JiaLiang. > > > zhonghang <1649067...@qq.com> 于2025年1月23日周四 16:46写道: > > Hi JiaLiang, > > > I added a benchmark for bitmap index queries without changing the current > index serialization format. > There are only two variables in these test cases, namely bitmap index version > v1/v2, > and whether BufferedInputStream is used. > > > Here are the test results: > > > bitmap-index-query-benchmark: > > > Best/Avg Time(ms) > Row Rate(K/s) Per Row(ns) Relative > -------------------------------------------------------------------------------------------------------------------------------------------------------------------- > OPERATORTEST_bitmap-index-query-benchmark_format-v1 > > > 843 / 852 > 0.1 8428130.9 1.0X > OPERATORTEST_bitmap-index-query-benchmark_format-v1-buffered-input > > 17 / > 17 6.0 > 166435.5 50.6X > OPERATORTEST_bitmap-index-query-benchmark_format-v2 > > > 8 / 8 > 13.2 75760.8 > 111.2X > OPERATORTEST_bitmap-index-query-benchmark_format-v2-buffered-input > > 0 > / 0 267.5 > 3737.8 2254.9X > > > Best, > Zhonghang. > > > > zhonghang > 1649067...@qq.com > > > >