dibyendumajumdar / simpledbmLinks
SimpleDBM is an Open Source Multi-Threaded Embeddable Transactional Database Engine in Java.
☆60Updated 2 years ago
Alternatives and similar repositories for simpledbm
Users that are interested in simpledbm are comparing it to the libraries listed below
Sorting:
- High performance persistent LSM key-value store library for the JVM.☆166Updated 3 years ago
- A fast key-value store written in Java that outperforms levelDB, kyoto cabinet and rocksDB☆54Updated 2 years ago
- zero copy in Java and C☆50Updated 10 years ago
- A fast and space efficient Radix tree in Java☆128Updated 5 years ago
- Provides a simple in-memory POJO Multi Version Concurrency Control (MVCC) cache☆46Updated 11 years ago
- HawtDB is an embedded MVCC Key/Value Database☆79Updated 11 years ago
- B+-tree in java that stores to disk using memory mapped files, supports range queries and duplicate keys☆48Updated this week
- Disk-based B+-tree written in Pure Java☆224Updated 4 years ago
- Implementation of Basho's bitcask in Java☆72Updated 13 years ago
- Benchmark of open source, embedded, memory-mapped, key-value stores available from Java (JMH)☆142Updated 2 years ago
- KVStore is a simple Key-Value Store based on B+Tree (disk & memory) for Java☆101Updated 11 months ago
- A hashmap implementation for Java that stores map entries off-heap☆71Updated 5 years ago
- Raft distributed consensus protocol in Java☆103Updated 9 years ago
- Disk based index database implementation. Purely written in Java.☆19Updated 7 years ago
- High-performance Raft-based Java Web Container☆63Updated 6 years ago
- A Scalable Concurrent Key-Value Map for Big Data Analytics☆270Updated last year
- Networking and buffer APIs and implementations for use in Copycat and Atomix☆51Updated 8 years ago
- Useful Java utilities☆151Updated last year
- A java.util.HashMap compatible map that won't stall puts or gets when resizing☆152Updated 2 years ago
- A fast, log structured key-value store.☆519Updated 2 years ago
- Low latency, lock free, primitive bounded blocking queues backed by an primitive arrays such as an int[]. These classes mimic the interfa…☆68Updated 4 years ago
- A library that provides a set of map and cache implementations that store data outside of the normal Java heap☆96Updated 7 months ago
- Low-latency java socket implementation (using shared memory)☆113Updated 5 years ago
- Persistent Adaptive Radix Trees in Java☆82Updated 4 years ago
- Mirror of Apache Omid Incubator☆90Updated last week
- Java port of a concurrent trie hash map implementation from the Scala collections library☆29Updated 6 months ago
- A simple and high-performance Java B-tree: drop-in replacement for java.util.TreeMap☆28Updated 5 years ago
- Berkeley DB Java Edition☆62Updated 4 years ago
- Java implementation of the Sparkey key value store☆122Updated last year
- Tools to work with off-heap memory using sun.misc.Unsafe☆136Updated 8 years ago