Alternatives and similar repositories for ARTful:

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

• malbrain / rwlock
  Phase Fair and Standard Reader Writer Locks
  ☆17Updated 5 years ago
• JerrySievert / judyarray
  Automatically exported from code.google.com/p/judyarray
  ☆17Updated 9 years ago
• nidium / libapenetwork
  Fast cross-platform async network library
  ☆16Updated 5 years ago
• malbrain / javascript-database
  Vanilla JavaScript interpreter with built-in NO-SQL document database with Btree & ARTful indexing from the database project.
  ☆13Updated 4 years ago
• PeterScott / netstring-c
  Netstring parsing in C
  ☆35Updated 4 years ago
• willemt / bmon
  Batch Monitor - Gain performance by combining work from multiple threads into a single batch
  ☆30Updated 9 years ago
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆117Updated 9 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 6 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 8 years ago
• timrc-git / mdbm
  MDBM a very fast memory-mapped key/value store.
  ☆77Updated last year
• coriolanus / libhhash
  Automatically exported from code.google.com/p/libhhash
  ☆32Updated 9 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 5 years ago
• halayli / lthread_cpp
  Lthread C++11 binding
  ☆10Updated 10 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• argv0 / nbds
  C implementations of several scalable non-blocking data structures for x86 and x86-64.
  ☆38Updated 13 years ago
• epfl-labos / wren
  Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store
  ☆8Updated 6 years ago
• stedolan / libfib
  A library for high-performance lightweight threads
  ☆20Updated 13 years ago
• xant / libiomux
  iomux - High performance aynchronous I/O multiplexing and timers
  ☆14Updated 9 years ago
• efficient / fast-succinct-trie
  ☆25Updated 8 years ago
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆49Updated 7 years ago
• kennethho / mvcc11
  A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.
  ☆26Updated 9 years ago
• Shardcached / libshardcache
  C implementation of a caching and cache-filling library inspired to groupcache
  ☆43Updated 9 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
• skywind3000 / memslab
  Slab Memory Allocator in Application Layer
  ☆28Updated 7 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• RoaringBitmap / CBitmapCompetition
  A comparison between different integer set techniques
  ☆14Updated 6 years ago
• janneku / btree_db
  A very fast on-disk database for SHA1-identified objects
  ☆58Updated 8 years ago
• andy-yx-chen / cornerstone
  A C++ Raft implementation, project moved
  ☆24Updated 8 years ago
• mpapierski / http-server
  100% async http-server library written in C
  ☆17Updated 9 years ago
• chriso / columnix
  Columnar storage and query engine
  ☆9Updated 6 years ago