Alternatives and similar repositories for lash:

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

• ankurdave / part
  Persistent Adaptive Radix Trees in Java
  ☆80Updated 4 years ago
• burmanm / compression-int
  64-bit integer compression algorithms in Java
  ☆15Updated 6 years ago
• koendeschacht / count-db
  A fast key-value store written in Java that outperforms levelDB, kyoto cabinet and rocksDB
  ☆53Updated 2 years ago
• boilerbay / airconcurrentmap
  AirConcurrentMap is a fast, memory efficient Java ConcurrentNavigableMap implementation
  ☆32Updated 7 years ago
• alexkasko / unsafe-tools
  Tools to work with off-heap memory using sun.misc.Unsafe
  ☆136Updated 7 years ago
• aitusoftware / recall
  Single-threaded off-heap object store
  ☆45Updated 2 years ago
• richardstartin / splitmap
  Parallel boolean circuit evaluation
  ☆20Updated 6 years ago
• apache / datasketches-memory
  High performance native memory access for Java.
  ☆125Updated last month
• richardstartin / vectorbenchmarks
  ☆29Updated 3 years ago
• lemire / bloofi
  Bloofi: A java implementation of multidimensional Bloom filters
  ☆79Updated 9 years ago
• cfelde / BinaryOffheapHashMap
  A hashmap implementation for Java that stores map entries off-heap
  ☆70Updated 4 years ago
• TimeAndSpaceIO / java-primitive-specializations-generator
  ☆32Updated 2 years ago
• metamx / bytebuffer-collections
  ByteBuffer collection classes for java and jvm-based languages.
  ☆33Updated 6 years ago
• sameeraxiomine / LargeCollections
  ☆17Updated 9 years ago
• cojen / TuplDB
  TuplDB is a high-performance, concurrent, transactional, scalable, low-level embedded database.
  ☆118Updated 3 weeks ago
• RobAustin / low-latency-primitive-concurrent-queues
  Low latency, lock free, primitive bounded blocking queues backed by an primitive arrays such as an int[]. These classes mimic the interfa…
  ☆67Updated 4 years ago
• edwardcapriolo / nibiru
  A NoSql database designed for maximum plugablitily and configurability.
  ☆16Updated 9 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…
  ☆98Updated last year
• rohansuri / adaptive-radix-tree
  A fast and space efficient Radix tree in Java
  ☆123Updated 4 years ago
• peter-lawrey / HugeCollections-OLD
  Huge Collections for Java using efficient off heap storage
  ☆274Updated 10 years ago
• vigna / Sux4J
  Sux4J is an effort to bring succinct data structures to Java.
  ☆161Updated last year
• richardstartin / multi-matcher
  simple rules engine
  ☆91Updated 4 years ago
• lmdbjava / benchmarks
  Benchmark of open source, embedded, memory-mapped, key-value stores available from Java (JMH)
  ☆141Updated 2 years ago
• belliottsmith / injector
  ☆59Updated 9 years ago
• deephacks / RxLMDB
  Then comes thunder.
  ☆22Updated 8 years ago
• atomix / catalyst
  Networking and buffer APIs and implementations for use in Copycat and Atomix
  ☆52Updated 7 years ago
• jordw / heftydb
  High performance persistent LSM key-value store library for the JVM.
  ☆164Updated 2 years ago
• romix / java-concurrent-hash-trie-map
  Java port of a concurrent trie hash map implementation from the Scala collections library
  ☆151Updated 4 years ago
• bdupras / guava-probably
  Probabilistic data structures for Guava.
  ☆54Updated 4 years ago
• zrlio / jaio
  Java API for libaio
  ☆15Updated 3 years ago