[B! bitset][integer] yassのブックマーク

yass id:yass

bitsetとintegerに関するyassのブックマーク (2)

Frame of Reference and Roaring Bitmaps
Postings listsWhile it may surprise you if you are new to search engine internals, one of the most important building blocks of a search engine is the ability to efficiently compress and quickly decode sorted lists of integers. Why is this useful? As you may know, Elasticsearch shards, which are Lucene indices under the hood, split the data that they store into segments which are regularly merged
yass 2016/06/11
integer

compression

delta encoding

bit packing

lucene

BitSet

bitmap index

roaringbitmap
リンク
Roaring Bitmaps
A better compressed bitset Roaring bit maps are compressed bit maps. They can be hundreds of times faster. Grab one of our research papers Roaring Bit maps on GitHub Widely used Roaring is found in Google Procella: YouTube’s SQL Engine, Apache Lucene and derivative systems such as Solr and Elasticsearch, Apache Druid, Apache Spark, Apache Hive, Apache Tez, Apache Zeppelin, Apache Doris, Apache Carbon
yass 2015/03/22
" It divides the data into chunks of 2^16 integers (e.g., [0, 2^16), [2^16, 2 x 2^16), ...). Within a chunk, it can use an uncompressed bitmap, a simple list of integers, or a list of runs. / they all allow you to check for the present of any one value quickly (e.g., with a binary search). "

BitSet

integer

binary search

roaringbitmap
リンク
1

お知らせ

もっと読む

公式Twitter

@HatenaBookmark
リリース、障害情報などのサービスのお知らせ
@hatebu
最新の人気エントリーの配信

キーボードショートカット一覧

j次のブックマーク

k前のブックマーク

lあとで読む

eコメント一覧を開く

oページを開く

設定を変更しましたx