Alternatives and similar repositories for BlockEpsilonTree

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

• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆36Updated 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.
  ☆34Updated 10 months ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 4 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 3 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆31Updated 10 months ago
• vigna / sux
  Succinct data structures in C/C++
  ☆93Updated last year
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆36Updated 11 months ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 5 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 3 years ago
• thm-mni-ii / sea
  Space efficient (graph) algorithms
  ☆18Updated 5 years ago
• google / zuckerli
  ☆28Updated 3 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• eBay / IOManager
  IOManager tries to bridge the gap in existing async framework to build full async networked database/storage/keyvalue storage
  ☆11Updated this week
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 8 years ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆11Updated 6 months 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
• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆40Updated 11 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 4 years ago
• tudocomp / compact_sparse_hash
  A blend of the compact and sparse hash table implementations.
  ☆15Updated 4 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆58Updated 3 years ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆51Updated 7 months 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
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆57Updated 2 years ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆89Updated 5 years ago