TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Benchmarking 32bit integer key compression for a C++ Btree

36 pointsby cruppstahlabout 9 years ago

2 comments

mtanskiabout 9 years ago
We do something similar with compressing integers. Unlike the article we pick from 3 different compression schemes: SIMD FastPFOR, Bitpack (max value) and delta encoding.<p>Which one we pick depends on the distribution of the integers. FastPFOR we use when the values are mostly smallish but there&#x27;s an occasional large value. Works great. Bitpack we use when there is a tight band (ex. all values are ~5 -&gt; ~7 bits). Delta works well for (mono) increasing values.<p>Also, we&#x27;ve adapted most of these to 64bit integers since we work with those more commonly.
评论 #11477616 未加载
ddorian43about 9 years ago
How about using a bitlist&#x2F;bitmap&#x2F;bitset&#x2F;bitstring&#x2F;bitarray, maybe even a compressed one, like roaring-bitsets ?<p>Edit: question: is there any type of index better than compressed bitsets when you have per-column index and you want to AND,OR, basically combine them ?
评论 #11475410 未加载