rahulyesantharao / b-epsilon-treeLinks
A simple implementation of the write-optimized BΞ΅ Tree π³ - for MIT 6.854 (Advanced Algorithms).
β24Updated 5 years ago
Alternatives and similar repositories for b-epsilon-tree
Users that are interested in b-epsilon-tree are comparing it to the libraries listed below
Sorting:
- The world's first wait-free KV store with generic durable linearizable transactionsβ41Updated 3 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?β29Updated 4 years ago
- Transactional Data Structure Librariesβ12Updated 7 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Javaβ35Updated last year
- β28Updated 4 years ago
- β12Updated 3 years ago
- β14Updated 2 years ago
- Fast Approximate Membership Filters (C++)β22Updated 4 years ago
- β51Updated 6 months ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collectionβ34Updated 8 years ago
- Optimizing database queries with array programmingβ18Updated 4 years ago
- β38Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.β35Updated 2 years ago
- An Evaluation of Linear Probing Hashtable Algorithmsβ31Updated last year
- β20Updated 2 years ago
- Public-facing version of the Twizzler OS source code. Note: this is not completely up-to-date with internal Twizzler code.β65Updated 4 years ago
- Dependably fast multi-core in-memory transactionsβ20Updated 7 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)β80Updated 3 years ago
- Cache Oblivious Lookahead Arraysβ27Updated 11 years ago
- A Wait-Free Universal Construct for Large Objectsβ97Updated 5 years ago
- Key-Value Store for Non-Volatile Memories uDepotβ46Updated 3 years ago
- β12Updated 6 years ago
- Bumped Ribbon Retrieval and Approximate Membership Queryβ44Updated 3 weeks ago
- In-memory, columnar, arrow-based database.β46Updated 2 years ago
- β53Updated last year
- AnchorHash - A Scalable Consistent Hashβ25Updated 3 years ago
- A B-Tree that exploits cache locality without prior knowledge of the memory hierarchy.β13Updated 2 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.β29Updated 2 years ago
- Supporting code for the concurrency hierarchy described in this blog post: https://travisdowns.github.io/blog/2020/07/06/concurrency-costβ¦β26Updated 3 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactionsβ46Updated 2 years ago