Alternatives and similar repositories for partitioned_elias_fano

Users that are interested in partitioned_elias_fano are comparing it to the libraries listed below

• ot / ds2i
  A library of inverted index data structures
  ☆151Updated 2 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆125Updated last year
• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆43Updated 8 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆53Updated last year
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 7 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 8 years ago
• bytedance / terark-zip
  A data structure and algorithm library built for TerarkDB
  ☆67Updated 3 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 6 years ago
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆15Updated 7 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• diegocaro / compression
  Algorithms to compress sorted arrays of integers
  ☆19Updated 11 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆28Updated 6 months ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆49Updated 6 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• hillbig / tx-trie
  Automatically exported from code.google.com/p/tx-trie
  ☆29Updated 10 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆88Updated last year
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 5 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆86Updated 8 years ago