Alternatives and similar repositories for lash

Users that are interested in lash are comparing it to the libraries listed below

• cojen / TuplDB
  TuplDB is a high-performance, concurrent, transactional, scalable, low-level embedded database.
  ☆126Updated last month
• alexkasko / unsafe-tools
  Tools to work with off-heap memory using sun.misc.Unsafe
  ☆136Updated 8 years ago
• richardstartin / splitmap
  Parallel boolean circuit evaluation
  ☆26Updated 7 years ago
• indeedeng / mph-table
  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
• richardstartin / vectorbenchmarks
  ☆30Updated 4 years ago
• ChinaXing / io_uring-java
  java binding for io_uring
  ☆21Updated 5 years ago
• cfelde / BinaryOffheapHashMap
  A hashmap implementation for Java that stores map entries off-heap
  ☆73Updated 5 years ago
• rohansuri / adaptive-radix-tree
  A fast and space efficient Radix tree in Java
  ☆132Updated 5 years ago
• richardstartin / multi-matcher
  simple rules engine
  ☆92Updated 5 years ago
• lemire / bloofi
  Bloofi: A java implementation of multidimensional Bloom filters
  ☆84Updated 6 months ago
• ankurdave / part
  Persistent Adaptive Radix Trees in Java
  ☆82Updated 5 years ago
• ifesdjeen / blomstre
  Concurrent Bloom Filter
  ☆16Updated 8 years ago
• lmdbjava / benchmarks
  Benchmark of open source, embedded, memory-mapped, key-value stores available from Java (JMH)
  ☆143Updated 2 months ago
• spotify / sparkey-java
  Java implementation of the Sparkey key value store
  ☆124Updated last month
• pcdv / jocket
  Low-latency java socket implementation (using shared memory)
  ☆114Updated 6 years ago
• apache / datasketches-memory
  High performance native memory access for Java.
  ☆128Updated 8 months ago
• romix / java-concurrent-hash-trie-map
  Java port of a concurrent trie hash map implementation from the Scala collections library
  ☆153Updated 5 years ago
• burmanm / compression-int
  64-bit integer compression algorithms in Java
  ☆15Updated 7 years ago
• davidmoten / bplustree
  B+-tree in java that stores to disk using memory mapped files, supports range queries and duplicate keys
  ☆51Updated last week
• FastFilter / fastfilter_java
  Fast Approximate Membership Filters (Java)
  ☆257Updated last week
• aitusoftware / recall
  Single-threaded off-heap object store
  ☆49Updated 3 years ago
• vigna / Sux4J
  Sux4J is an effort to bring succinct data structures to Java.
  ☆171Updated 7 months ago
• zrlio / jaio
  Java API for libaio
  ☆15Updated 4 years ago
• DataDog / sketches-java
  DDSketch: A Fast and Fully-Mergeable Quantile Sketch with Relative-Error Guarantees.
  ☆127Updated 4 months ago
• komiya-atsushi / xor-filter
  Production-ready Java implementation of the Xor Filter.
  ☆18Updated 6 years ago
• ikorennoy / jasyncfio
  Java asynchronous file I/O based on io_uring Linux interface
  ☆81Updated 2 years ago
• bp-alex / rpc-bench
  RPC Benchmark of gRPC, Aeron and KryoNet
  ☆73Updated 2 years ago
• vlsi / compactmap
  Memory efficient java.util.Map implementation modelled after http://code.google.com/apis/v8/design.html
  ☆63Updated last year
• aloksingh / disk-backed-map
  A simple java disk backed map
  ☆29Updated 14 years ago
• koendeschacht / count-db
  A fast key-value store written in Java that outperforms levelDB, kyoto cabinet and rocksDB
  ☆56Updated 3 years ago