Alternatives and similar repositories for tkrzw-rpc:

Users that are interested in tkrzw-rpc are comparing it to the libraries listed below

• maximecaron / SIMD-Based-Posting-lists
  Implementation of Alexander A. Stepanov inverted Index Compression algorithms
  ☆21Updated 9 years ago
• felix-lang / judy
  A C library for creating and accessing dynamic arrays with near O(log-base-256) scalability into the peta-element range
  ☆31Updated 14 years ago
• rusnikola / lfsmr
  Hyaline Reclamation (PLDI '21, PODC '19)
  ☆20Updated 3 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated 2 years ago
• nojb / llvm-tiger
  A compiler for the Tiger programming language targeting LLVM
  ☆13Updated 7 years ago
• epfl-labos / wren
  Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store
  ☆8Updated 6 years ago
• naskitis / HAT-trie
  The HAT-trie, written in C, as described in my PhD thesis.
  ☆19Updated 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
• AlexKashuba / SQLite_JIT
  ☆27Updated 6 years ago
• bryankate / pequod
  A distributed key-value cache with builtin materialized views.
  ☆26Updated 10 years ago
• luceracloud / libfasttime
  Fast time calls from user space.
  ☆11Updated 9 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 6 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• stasis / stasis
  Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…
  ☆53Updated 12 years ago
• kuba-- / ut
  Yet Another Efficient Unification Algorithm
  ☆26Updated 6 months ago
• tokenrove / fixie-trie
  Compact tries for fixed-width keys
  ☆25Updated 6 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.
  ☆41Updated 8 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• rmind / libcdb
  NetBSD cdb (constant database) library
  ☆14Updated 5 years ago
• rmind / nxsearch
  nxsearch: a full-text search engine
  ☆15Updated 3 months ago
• dcreager / varon-t
  C implementation of Disruptor queues
  ☆22Updated 2 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• efficient / fast-succinct-trie
  ☆25Updated 7 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 10 years ago
• JerrySievert / judyarray
  Automatically exported from code.google.com/p/judyarray
  ☆17Updated 9 years ago
• fpaxos / fpaxos-tlaplus
  TLA+ specification of Flexible Paxos
  ☆38Updated last year
• blynn / blt
  Crit-bit tree (trie) library
  ☆32Updated 10 years ago
• kyx0r / pikevm
  Russ Cox/Rob Pike pikevm regex implementation
  ☆32Updated 2 years ago