Alternatives and similar repositories for compression-int:

Users that are interested in compression-int are comparing it to the libraries listed below

• rohansuri / adaptive-radix-tree
  A fast and space efficient Radix tree in Java
  ☆123Updated 4 years ago
• bnyeggen / lash
  Disk-backed hashmaps for Java
  ☆31Updated 8 years ago
• komiya-atsushi / xor-filter
  Production-ready Java implementation of the Xor Filter.
  ☆17Updated 5 years ago
• apache / datasketches-memory
  High performance native memory access for Java.
  ☆125Updated last month
• koendeschacht / count-db
  A fast key-value store written in Java that outperforms levelDB, kyoto cabinet and rocksDB
  ☆53Updated 2 years ago
• richardstartin / vectorbenchmarks
  ☆29Updated 3 years ago
• richardstartin / splitmap
  Parallel boolean circuit evaluation
  ☆20Updated 6 years ago
• vigna / Sux4J
  Sux4J is an effort to bring succinct data structures to Java.
  ☆161Updated last year
• cfelde / BinaryOffheapHashMap
  A hashmap implementation for Java that stores map entries off-heap
  ☆70Updated 4 years ago
• jordw / heftydb
  High performance persistent LSM key-value store library for the JVM.
  ☆164Updated 2 years 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
• aitusoftware / recall
  Single-threaded off-heap object store
  ☆45Updated 2 years ago
• TimeAndSpaceIO / java-primitive-specializations-generator
  ☆32Updated 2 years ago
• zrlio / jaio
  Java API for libaio
  ☆15Updated 3 years ago
• ankurdave / part
  Persistent Adaptive Radix Trees in Java
  ☆80Updated 4 years ago
• boilerbay / airconcurrentmap
  AirConcurrentMap is a fast, memory efficient Java ConcurrentNavigableMap implementation
  ☆32Updated 7 years ago
• lmdbjava / benchmarks
  Benchmark of open source, embedded, memory-mapped, key-value stores available from Java (JMH)
  ☆141Updated 2 years ago
• rxin / fast-byte-buffer
  ByteBuffer utilities using Unsafe for fast reads.
  ☆21Updated 10 years ago
• batterseapower / btreemap
  A simple and high-performance Java B-tree: drop-in replacement for java.util.TreeMap
  ☆28Updated 5 years ago
• benalexau / hash-bench
  Java Hashing, CRC and Checksum Benchmark (JMH)
  ☆68Updated 3 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
• 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
• ssedano / jump-consistent-hash
  Java implementation of the jump consistent hash
  ☆30Updated 3 years ago
• metamx / bytebuffer-collections
  ByteBuffer collection classes for java and jvm-based languages.
  ☆33Updated 6 years ago
• terma / fast-select
  Extremely fast and compact in-memory embedded column oriented database
  ☆19Updated 7 years ago
• davidmoten / bplustree
  B+-tree in java that stores to disk using memory mapped files, supports range queries and duplicate keys
  ☆47Updated 3 weeks ago
• aragozin / JMemStore
  Direct memory storage for java
  ☆15Updated 13 years ago
• kutschkem / fpc-compression
  (Java-)Implementation of the compression method of Burtscher and Ratanaworabhan, "High Throughput Compression of Double-Precision Floati…
  ☆23Updated 11 years ago
• richardstartin / multi-matcher
  simple rules engine
  ☆91Updated 4 years ago
• alexkasko / unsafe-tools
  Tools to work with off-heap memory using sun.misc.Unsafe
  ☆136Updated 7 years ago