Alternatives and similar repositories for RealisticTabularDataSets

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

• 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
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 10 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 5 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• btrask / lsmdb
  Proof of concept LSM-tree built on MDB
  ☆17Updated 10 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• ot / semi_index
  Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"
  ☆57Updated 12 years ago
• ot / succinct
  A collection of succinct data structures
  ☆207Updated last year
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆30Updated 2 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• rix0rrr / libbruce
  B-tree library for use with remote storage (DynamoDB, S3) in C++
  ☆22Updated 7 years ago
• lemire / programmingishard
  Long-term book project
  ☆34Updated 3 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆21Updated 9 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 6 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• fclaude / libcds
  Compact Data Structures Library
  ☆128Updated 10 years ago
• dcjones / hat-trie
  An efficient trie implementation.
  ☆255Updated 4 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 14 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆107Updated 11 years ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆86Updated 7 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆88Updated 10 months 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
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• luispedro / diskhash
  Diskbased (persistent) hashtable
  ☆164Updated 10 months ago
• lemire / StronglyUniversalStringHashing
  Benchmark showing the we can randomly hash strings very quickly with good universality
  ☆137Updated 6 months ago
• lysevi / nkvdb
  nkvdb - is a numeric time-series database.
  ☆35Updated 8 years ago
• uwescience / raco
  Compilation and rule-based optimization framework for relational algebra. Raco is the language, optimization, and query translation layer…
  ☆73Updated 7 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago