vmg / libewok

Related projects ⓘ

Alternatives and complementary repositories for libewok

• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• chriso / roaring-bitmap
  Roaring bitmaps in C
  ☆16Updated 8 years ago
• demerphq / BeagleHash
  Fast 64 bit evolved hash.
  ☆32Updated 7 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆53Updated 10 months ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 8 years ago
• efficient / fast-succinct-trie
  ☆25Updated 7 years ago
• willemt / bmon
  Batch Monitor - Gain performance by combining work from multiple threads into a single batch
  ☆31Updated 9 years ago
• diegocaro / compression
  Algorithms to compress sorted arrays of integers
  ☆18Updated 10 years ago
• stasis / stasis
  Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…
  ☆53Updated 11 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆50Updated 6 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆51Updated 7 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 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(…
  ☆49Updated 7 months ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 5 years ago
• lemire / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆117Updated 6 months ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆62Updated 5 months ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆115Updated 7 years ago
• stg7 / haesni
  haesni is a small hash function using aes-ni for fast string hashing
  ☆16Updated 6 years ago
• aklomp / sse-strings
  SSE string functions for x86-64 Linux
  ☆21Updated 2 years ago
• dryman / hash_bench
  Popular hash table implementation benchmarks
  ☆27Updated 7 years ago
• xant / libiomux
  iomux - High performance aynchronous I/O multiplexing and timers
  ☆14Updated 9 years ago
• pvachon / rbtree
  A simple, intrusive, zero-allocation red-black tree implementation
  ☆43Updated 3 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 6 years ago
• btrask / lsmdb
  Proof of concept LSM-tree built on MDB
  ☆17Updated 9 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 10 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆104Updated 7 years ago