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 6 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆31Updated 3 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
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆18Updated 7 years ago
• ot / semi_index
  Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"
  ☆58Updated 13 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆24Updated 5 years ago
• jarulraj / postgresql-cpp
  C++11 port of the PostgreSQL DBMS
  ☆70Updated 9 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆109Updated 8 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆93Updated last year
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆36Updated 3 years ago
• lemire / programmingishard
  Long-term book project
  ☆34Updated 4 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆121Updated 8 years ago
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆139Updated last year
• dw / csvmonkey
  Header-only vectorized, lazy-decoding, zero-copy CSV file parser
  ☆99Updated last year
• ademakov / Oroch
  A C++ library for integer array compression
  ☆30Updated 3 years ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 10 years ago
• dice-group / hypertrie
  A monolithic index that supports worst-case optimal joins (WCOJ) by providing all collation orders in a single redundancy eliminating dat…
  ☆16Updated 4 months ago
• rix0rrr / libbruce
  B-tree library for use with remote storage (DynamoDB, S3) in C++
  ☆22Updated 8 years ago
• lysevi / nkvdb
  nkvdb - is a numeric time-series database.
  ☆35Updated 8 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.
  ☆44Updated 9 years ago
• aplf / sdk2tree
  Code used in the paper "On dynamic succinct graph representations".
  ☆11Updated 4 years ago
• apankrat / notes
  Assorted notes
  ☆84Updated 2 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
• det / segmented_tree
  Sequence data structure with efficient random access insert and erase
  ☆13Updated 2 years ago
• uwescience / raco
  Compilation and rule-based optimization framework for relational algebra. Raco is the language, optimization, and query translation layer…
  ☆74Updated 7 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
• erikbern / annul
  Successor to Annoy https://github.com/spotify/annoy
  ☆13Updated 10 years ago
• danieldk / dictomaton
  Finite state dictionaries in Java
  ☆132Updated 4 years ago
• efficient / fast-succinct-trie
  ☆27Updated 8 years ago