chriso / columnix
Columnar storage and query engine
☆9Updated 6 years ago
Alternatives and similar repositories for columnix:
Users that are interested in columnix are comparing it to the libraries listed below
- Batch Monitor - Gain performance by combining work from multiple threads into a single batch☆30Updated 10 years ago
- Bloom filter alternative (C++)☆18Updated 6 years ago
- Very simple noSQL database, created as an example during a talk. See FineDB for a real high-performance noSQL database.☆14Updated 11 years ago
- NetBSD cdb (constant database) library☆14Updated 5 years ago
- ☆13Updated 2 years ago
- Fast 64 bit evolved hash.☆32Updated 8 years ago
- Roaring bitmaps in C☆17Updated 9 years ago
- actordb storage engine☆20Updated 5 years ago
- MDBM a very fast memory-mapped key/value store.☆77Updated 2 years ago
- C implementation of a compressed trie lookup map☆21Updated 5 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- A comparison between different integer set techniques☆14Updated 7 years ago
- ☆11Updated 8 years ago
- A toy http server written in C using libdill coroutines. Will probably get you owned if you run in prod.☆10Updated 7 years ago
- AA-tree implementation in C☆29Updated last year
- Automatically exported from code.google.com/p/judyarray☆17Updated 9 years ago
- ☆11Updated 7 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- lock free modified prefix B+tree append-only database☆117Updated 9 years ago
- ARTful radix tree☆13Updated 8 years ago
- A very fast on-disk database for SHA1-identified objects☆58Updated 8 years ago
- zookeeper c++11. Uses facebook folly.☆9Updated 9 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
- A simple, intrusive, zero-allocation red-black tree implementation☆45Updated 3 years ago
- The libdill tutorial.☆16Updated 5 years ago
- Fast cross-platform async network library☆16Updated 5 years ago
- Dynamic-language-like data structure for C☆13Updated 8 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 10 years ago
- Lock-free slab allocator / freelist.☆66Updated 9 years ago