hermanstehouwer / Enhanced-Suffix-Arrays

Related projects: ⓘ

• simongog / RoSA
  Reduced on-disk Suffix Array
  ☆20Updated 10 years ago
• jianingy / libtrie
  An Implementation of Two-Trie and Tail-Trie using Double Array
  ☆22Updated 11 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆24Updated 4 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆52Updated 8 months ago
• efficient / fast-succinct-trie
  ☆24Updated 7 years ago
• google / refr
  A framework for building reranking models.
  ☆30Updated 9 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• RoaringBitmap / CBitmapCompetition
  A comparison between different integer set techniques
  ☆14Updated 6 years ago
• maximecaron / SIMD-Based-Posting-lists
  Implementation of Alexander A. Stepanov inverted Index Compression algorithms
  ☆21Updated 8 years ago
• lemire / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆48Updated 7 months ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 8 years ago
• efficient / libcuckoo-c
  High-performance Concurrent Cuckoo Hashing Library
  ☆46Updated 9 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• Const-me / MemoryAccessCosts
  ☆13Updated 6 years ago
• queertypes / boost-bloom-filters
  A collection of generic, C++ Bloom Filter classes developed for the Boost C++ Libraries.
  ☆23Updated 7 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆19Updated 4 years ago
• krareT / terark-hashmap
  A very fast and small(memory efficient) hash map
  ☆7Updated 8 years ago
• tkbtkysms / solca
  A Space-Optimal Grammar Compression
  ☆10Updated 3 years ago
• c0D3M / Suffix-Arrays
  Algorihms about Suffix Array Construction, Suffix Tree, Longest Common Prefix, Burrows Wheeler Transform,
  ☆11Updated 4 years ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated 7 months ago
• pcarrier / cdb64
  Format-incompatible 64-bit version of cdb (no 4GB limit)
  ☆14Updated 10 years ago
• epfl-labos / wren
  Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store
  ☆8Updated 6 years ago
• ronmrdechai / Pie
  Provide an idiomatic C++ interface to CPython's C API.
  ☆27Updated 7 years ago
• TsinghuaDatabaseGroup / Similarity-Search-and-Join
  similarity join and search algorithms for edit distance and jaccard
  ☆18Updated 6 years ago
• maciekgajewski / coroutines
  Go-style coroutines and channels for C++
  ☆33Updated 10 years ago
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆37Updated 9 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 5 years ago
• nicola-gigante / bitvector
  A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …
  ☆21Updated 2 years ago
• chokkan / cdbpp
  C++ implementation of Constant Database (CDB++)
  ☆21Updated 13 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.
  ☆40Updated 7 years ago