cojen / TuplDBLinks
TuplDB is a high-performance, concurrent, transactional, scalable, low-level embedded database.
☆126Updated last month
Alternatives and similar repositories for TuplDB
Users that are interested in TuplDB are comparing it to the libraries listed below
Sorting:
- Tools to work with off-heap memory using sun.misc.Unsafe☆136Updated 8 years ago
- ☆143Updated 4 years ago
- Persistent Collections for Java☆223Updated last year
- A hashmap implementation for Java that stores map entries off-heap☆73Updated 5 years ago
- A fork of Cliff Click's High Scale Library. Improved with bug fixes and a real build system.☆420Updated 10 years ago
- Offheap Java POJOs with guaranteed memory alignment☆192Updated 12 years ago
- Huge Collections for Java using efficient off heap storage☆275Updated 11 years ago
- Disk-backed hashmaps for Java☆31Updated 9 years ago
- A fast and space efficient Radix tree in Java☆131Updated 5 years ago
- High performance native memory access for Java.☆127Updated 8 months ago
- Fast Approximate Membership Filters (Java)☆253Updated last week
- Bloofi: A java implementation of multidimensional Bloom filters☆83Updated 6 months ago
- Large off-heap arrays and mmap files for Scala and Java☆404Updated 3 years ago
- Java classes designed with optimizable object layout in mind☆411Updated last year
- A Mavenized fork of http://high-scale-lib.sourceforge.net/☆163Updated last year
- Sux4J is an effort to bring succinct data structures to Java.☆171Updated 6 months ago
- Java port of a concurrent trie hash map implementation from the Scala collections library☆152Updated 5 years ago
- Java implementation of the Sparkey key value store☆123Updated last month
- Benchmark of open source, embedded, memory-mapped, key-value stores available from Java (JMH)☆143Updated last month
- ☆59Updated 10 years ago
- ☆111Updated this week
- A Scalable Concurrent Key-Value Map for Big Data Analytics☆274Updated last year
- Probabilistic data structures for Guava.☆54Updated 5 years ago
- Immutable key/value store with efficient space utilization and fast reads. They are ideal for the use-case of tables built by batch proce…☆100Updated 2 years ago
- Library for creating In-memory circular buffers that use direct ByteBuffers to minimize GC overhead☆140Updated 3 years ago
- LMDB for Java☆205Updated 4 years ago
- Networking and buffer APIs and implementations for use in Copycat and Atomix☆52Updated 8 years ago
- Persistent Adaptive Radix Trees in Java☆82Updated 5 years ago
- simple rules engine☆92Updated 5 years ago
- A java.util.HashMap compatible map that won't stall puts or gets when resizing☆151Updated 3 years ago