prasanthj / count-min-sketchLinks
Java implementation of Count-Min sketch for finding frequency of events in a stream of data within specified error bounds
☆11Updated 10 years ago
Alternatives and similar repositories for count-min-sketch
Users that are interested in count-min-sketch are comparing it to the libraries listed below
Sorting:
- A convenient copy for evolution of Evan Jones's set of experiments☆23Updated 12 years ago
- A hashmap implementation for Java that stores map entries off-heap☆70Updated 5 years ago
- A fluent API for generating Java byte code☆14Updated 12 years ago
- Tools to work with off-heap memory using sun.misc.Unsafe☆136Updated 8 years ago
- A fast and space efficient Radix tree in Java☆126Updated 5 years ago
- Java Hashing, CRC and Checksum Benchmark (JMH)☆68Updated 4 years ago
- Java Off Heap Object Pool and On the Fly Instrumentation Tool☆113Updated 10 years ago
- simple rules engine☆92Updated 5 years ago
- Useful Java utilities☆150Updated last year
- Don't try this in production☆110Updated 8 years ago
- High performance native memory access for Java.☆124Updated last month
- High performance persistent LSM key-value store library for the JVM.☆164Updated 3 years ago
- Mem Ops for Java is a memory manager / allocator for use in systems requiring steady state memory consumption (as little garbage collecti…☆43Updated 5 years ago
- Implementation of a concurrent map with weak keys and a detached thread local storage.☆120Updated 7 months ago
- High performance Java implementation of a Cuckoo filter - Apache Licensed☆174Updated 2 years ago
- ☆82Updated last week
- Memory efficient java.util.Map implementation modelled after http://code.google.com/apis/v8/design.html☆62Updated last year
- Generates synthetic bridge methods with different return types to help backward compatibility☆26Updated this week
- Java implementation of the jump consistent hash☆31Updated 3 years ago
- A simple and high-performance Java B-tree: drop-in replacement for java.util.TreeMap☆28Updated 5 years ago
- Direct memory storage for java☆15Updated 13 years ago
- Benchmark of open source, embedded, memory-mapped, key-value stores available from Java (JMH)☆142Updated 2 years ago
- Java port of a concurrent trie hash map implementation from the Scala collections library☆152Updated 4 years ago
- In-process in-memory multi-level LRU cache☆21Updated 3 years ago
- Hidden Gems of JVM/JDK☆18Updated 8 years ago
- B+-tree in java that stores to disk using memory mapped files, supports range queries and duplicate keys☆47Updated 2 weeks ago
- Building blocks for asynchronous Java processing inspired by Twisted's API.☆106Updated 7 years ago
- HashMap performance tests from java-performance.info☆98Updated 4 years ago
- Java Language support☆285Updated last year
- A fast key-value store written in Java that outperforms levelDB, kyoto cabinet and rocksDB☆53Updated 2 years ago