Alternatives and similar repositories for SIMD-Based-Posting-lists:

Users that are interested in SIMD-Based-Posting-lists are comparing it to the libraries listed below

• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• eloraiby / rl-json-parser
  Ragel/Lemon based json-parser
  ☆17Updated 6 years ago
• coriolanus / libhhash
  Automatically exported from code.google.com/p/libhhash
  ☆32Updated 9 years ago
• hnsl / librcd
  A library for Rapid {C|Concurrency|Correct} Development
  ☆34Updated 9 years ago
• blynn / blt
  Crit-bit tree (trie) library
  ☆32Updated 10 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• ned14 / uthash
  A GIT clone of uthash.sourceforge.net, a hash table, implemented in C, supporting constant-time add/find/remove of C structures. Any stru…
  ☆36Updated 11 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 years ago
• rlu-sync / rlu-rht
  RLU resizable hash-table
  ☆17Updated 9 years ago
• clibs / zerodbg
  Useful macros for debugging purposes.
  ☆16Updated 10 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆106Updated 8 years ago
• armon / c-minheap-indirect
  Implements a Min-Heap / Priority Queue in C using an indirection table for memory efficiency.
  ☆28Updated 10 years ago
• malbrain / rwlock
  Phase Fair and Standard Reader Writer Locks
  ☆17Updated 5 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 5 years ago
• blu / ascii_pruner
  Pruning of blanks from an ASCII stream - musings in AMD64 and ARM64
  ☆10Updated 4 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
  ☆53Updated last year
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• chriso / roaring-bitmap
  Roaring bitmaps in C
  ☆17Updated 9 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• halayli / lthread_cpp
  Lthread C++11 binding
  ☆11Updated 10 years ago
• rescrv / e
  Library containing high-performance datastructures and utilities for C++
  ☆74Updated 8 years ago
• schani / linbin
  Linear vs binary search benchmark
  ☆40Updated 5 years ago
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆15Updated 8 years ago
• troydhanson / kvspool
  A library to support streaming data applications
  ☆24Updated 4 years ago
• aji / libco
  userspace threads and coroutines for C
  ☆18Updated 9 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
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 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 last year