Alternatives and similar repositories for BlockEpsilonTree

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

• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• tkbtkysms / solca
  A Space-Optimal Grammar Compression
  ☆10Updated 4 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 9 months ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆27Updated 2 months ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆15Updated 7 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆35Updated 4 months ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• koeppl / separate_chaining
  Hash table with separate chaining layout
  ☆9Updated 3 years ago
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆30Updated 2 months ago
• rossanoventurini / Variable-BMW
  ☆12Updated 7 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• thm-mni-ii / sea
  Space efficient (graph) algorithms
  ☆18Updated 4 years ago
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆26Updated last year
• TsinghuaDatabaseGroup / Similarity-Search-and-Join
  similarity join and search algorithms for edit distance and jaccard
  ☆18Updated 7 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 5 years ago
• dominikkempa / fsais
  External memory suffix array construction using inducing
  ☆11Updated 4 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
  ☆54Updated last year
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆11Updated 2 years ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆15Updated 7 years ago