Alternatives and similar repositories for RealisticTabularDataSets

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

• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 5 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
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 5 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 10 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆88Updated 10 months ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• lysevi / nkvdb
  nkvdb - is a numeric time-series database.
  ☆35Updated 8 years ago
• ot / semi_index
  Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"
  ☆58Updated 12 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆30Updated 2 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆105Updated 8 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 years ago
• ademakov / Oroch
  A C++ library for integer array compression
  ☆29Updated 3 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• lemire / FastShuffleExperiments
  How fast can we shuffle values?
  ☆38Updated last year
• ot / succinct
  A collection of succinct data structures
  ☆209Updated last year
• lemire / programmingishard
  Long-term book project
  ☆34Updated 3 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 14 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 6 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.
  ☆42Updated 8 years ago
• fclaude / libcds
  Compact Data Structures Library
  ☆128Updated 11 years ago
• fast-pack / PyFastPFor
  Python bindings for the fast integer compression library FastPFor.
  ☆61Updated last year
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• danieldk / dictomaton
  Finite state dictionaries in Java
  ☆131Updated 3 years ago
• kzn / fsa
  Deterministic Acyclic Finite State Automaton implementation for morphological analysis
  ☆18Updated 4 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆107Updated 11 years ago