google / szlLinks
A compiler and runtime for the Sawzall language
☆70Updated 5 years ago
Alternatives and similar repositories for szl
Users that are interested in szl are comparing it to the libraries listed below
Sorting:
- Iterator library.☆80Updated 5 years ago
- Mirror of Apache Lucy☆100Updated 7 years ago
- Git mirror for the FastBit library Subversion repository.☆71Updated 8 years ago
- Feed-forward Bloom filters☆53Updated 14 years ago
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 12 years ago
- RWMutex for sharing of multicore machines.☆17Updated 6 years ago
- Supersonic is an ultra-fast, column oriented query engine library written in C++☆207Updated 5 years ago
- Low-Level Data Structure - efficient data structures, and fast data access in the 3.x/4.x/5.x/6.x kernel☆120Updated 2 years ago
- Compiler intermediate language for static analysis.☆107Updated 6 years ago
- C code indexer using language semantic from clang☆60Updated 6 years ago
- MDBM a very fast memory-mapped key/value store.☆77Updated 2 years ago
- A Distributed Key-Value Store for FAWN☆77Updated 14 years ago
- Cache Commons☆102Updated 3 years ago
- ☆24Updated 11 years ago
- RIBS (Robust Infrastructure for Backend Systems) version 2☆130Updated 6 years ago
- C++11 port of the PostgreSQL DBMS☆70Updated 9 years ago
- A distributed key-value cache with builtin materialized views.☆25Updated 10 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆43Updated 8 years ago
- A system for maintaining replicated state machines☆116Updated 8 years ago
- C network daemon for HyperLogLogs☆451Updated 4 years ago
- ♥ Janusz Brzozowski☆163Updated last year
- simple consistent hashing implementation☆56Updated 7 years ago
- A C++ library for working with App Containers☆53Updated 9 years ago
- Demonstrating the importance of laying out data in memory.☆47Updated 7 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆38Updated 6 years ago
- A high-performance, memory-efficient concurrent hash table☆36Updated 12 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago