salmans / coddLinks
A minimal in-memory database with relational algebraic expressions as queries
☆61Updated 3 years ago
Alternatives and similar repositories for codd
Users that are interested in codd are comparing it to the libraries listed below
Sorting:
- The simd optimized escape code☆54Updated last week
- Composable, lock-free, allocation-light data structures☆60Updated 7 years ago
- Proof of concept of procedural macro input parsed by LALRPOP☆52Updated 2 years ago
- An experimental columnar arena☆43Updated 7 months ago
- Lockfree resizeable concurrent hash table.☆54Updated 3 years ago
- Retriever stores ordinary rust data types in a similar manner as a NoSQL database.☆48Updated 2 years ago
- An experimental asynchronous runtime based on `io-uring`.☆77Updated 4 years ago
- Concurrent hash trie☆54Updated 4 years ago
- Type-level named values with partial dependent type support in Rust☆57Updated 3 years ago
- Generic SIMD abstractions for Rust.☆47Updated 2 years ago
- Compact sets in rust☆57Updated 3 months ago
- PEG parser generator built on top of nom☆70Updated 5 years ago
- Rust library providing `Zc` for self-referential zero-copy structures☆41Updated 4 years ago
- scraps of a potential language☆37Updated 4 years ago
- Utility for reusing memory☆53Updated 5 years ago
- Yet Another Async Runtime (yaar) focused on forbid(unsafe) and scalability☆81Updated 3 years ago
- A fast pure-rust no-unsafe implementation of LZ4 compression and decompression☆109Updated last year
- A flexible and convenient high-level mmap for zero-copy file I/O.☆114Updated 3 months ago
- ☆53Updated 5 years ago
- ☆110Updated last year
- A growable bit-vector for Rust, optimized for size☆41Updated 4 months ago
- Pillars for Transactional Systems and Data Grids☆132Updated last year
- Log call tree summaries after each request for rust programs instrumented with `tracing`.☆44Updated 3 years ago
- Cache & In-Memory optimizations for Rust, revived from the slabs of Sumer.☆30Updated 5 years ago
- super simple in-memory blocking LSM for constant-size keys and values☆71Updated 3 months ago
- Set theory applied on sorted and deduplicated slices.☆45Updated 2 years ago
- Rust crate to support allocation in contexts☆15Updated 2 years ago
- ☆40Updated 6 years ago
- A futures abstraction that runs a set of futures which may complete in any order.☆90Updated 2 months ago
- An intrusive splay tree implementation that is no-std compatible and free from allocation and moves☆67Updated last month