Alternatives and similar repositories for lash

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

• 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 2 years ago
• cojen / TuplDB
  TuplDB is a high-performance, concurrent, transactional, scalable, low-level embedded database.
  ☆121Updated 3 weeks ago
• rohansuri / adaptive-radix-tree
  A fast and space efficient Radix tree in Java
  ☆126Updated 5 years ago
• richardstartin / multi-matcher
  simple rules engine
  ☆92Updated 5 years ago
• richardstartin / splitmap
  Parallel boolean circuit evaluation
  ☆24Updated 6 years ago
• lemire / bloofi
  Bloofi: A java implementation of multidimensional Bloom filters
  ☆79Updated last week
• sameeraxiomine / LargeCollections
  ☆17Updated 10 years ago
• apache / datasketches-memory
  High performance native memory access for Java.
  ☆124Updated 2 months ago
• ankurdave / part
  Persistent Adaptive Radix Trees in Java
  ☆82Updated 4 years ago
• aitusoftware / recall
  Single-threaded off-heap object store
  ☆47Updated 2 years ago
• boilerbay / airconcurrentmap
  AirConcurrentMap is a fast, memory efficient Java ConcurrentNavigableMap implementation
  ☆32Updated 7 years ago
• DataDog / sketches-java
  DDSketch: A Fast and Fully-Mergeable Quantile Sketch with Relative-Error Guarantees.
  ☆120Updated 2 months ago
• metamx / bytebuffer-collections
  ByteBuffer collection classes for java and jvm-based languages.
  ☆33Updated 7 years ago
• vigna / Sux4J
  Sux4J is an effort to bring succinct data structures to Java.
  ☆163Updated 3 weeks ago
• spotify / sparkey-java
  Java implementation of the Sparkey key value store
  ☆120Updated last year
• LiveRamp / HyperMinHash-java
  Union, intersection, and set cardinality in loglog space
  ☆56Updated 2 years ago
• alexkasko / unsafe-tools
  Tools to work with off-heap memory using sun.misc.Unsafe
  ☆136Updated 8 years ago
• davidmoten / bplustree
  B+-tree in java that stores to disk using memory mapped files, supports range queries and duplicate keys
  ☆47Updated 2 weeks ago
• TimeAndSpaceIO / java-primitive-specializations-generator
  ☆32Updated 3 years ago
• richardstartin / vectorbenchmarks
  ☆30Updated 3 years ago
• AugustNagro / utf8.java
  Vectorized UTF-8 Validation for Java
  ☆64Updated last year
• romix / java-concurrent-hash-trie-map
  Java port of a concurrent trie hash map implementation from the Scala collections library
  ☆152Updated 4 years ago
• cfelde / BinaryOffheapHashMap
  A hashmap implementation for Java that stores map entries off-heap
  ☆70Updated 5 years ago
• pcdv / jocket
  Low-latency java socket implementation (using shared memory)
  ☆110Updated 5 years ago
• ndimiduk / orderly
  Schema and type system for creating sortable byte[]
  ☆46Updated 12 years ago
• benalexau / rpc-bench
  RPC Benchmark of gRPC, Aeron and KryoNet
  ☆70Updated 2 years ago
• burmanm / compression-int
  64-bit integer compression algorithms in Java
  ☆15Updated 6 years ago
• FastFilter / fastfilter_java
  Fast Approximate Membership Filters (Java)
  ☆250Updated last year
• ashwanthkumar / suuchi
  सूचि - Toolkit to build Distributed Data Systems
  ☆53Updated 2 years ago
• davidmoten / sparse-hilbert-index
  Java library to create and search random access files (including in S3) using the space-filling hilbert index (sparse)
  ☆48Updated 2 weeks ago