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
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆40Updated 10 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 5 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆21Updated 9 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆88Updated 11 months ago
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆55Updated last year
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 7 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 3 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆35Updated 7 months ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆49Updated 6 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 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.
  ☆31Updated 5 months ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆27Updated 5 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
• ot / ds2i
  A library of inverted index data structures
  ☆150Updated 2 years ago
• TsinghuaDatabaseGroup / Similarity-Search-and-Join
  similarity join and search algorithms for edit distance and jaccard
  ☆18Updated 7 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 6 months ago
• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• eBay / IOManager
  IOManager tries to bridge the gap in existing async framework to build full async networked database/storage/keyvalue storage
  ☆11Updated 3 months ago
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆15Updated 7 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 5 years ago
• jermp / tongrams
  A C++ library providing fast language model queries in compressed space.
  ☆132Updated 2 years ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆11Updated last month
• thm-mni-ii / sea
  Space efficient (graph) algorithms
  ☆18Updated 5 years ago
• rossanoventurini / Variable-BMW
  ☆12Updated 7 years ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆87Updated 4 years ago