bryanduxbury / lightweight_trie
A very memory-efficient trie (radix tree) implementation
☆47Updated 12 years ago
Alternatives and similar repositories for lightweight_trie:
Users that are interested in lightweight_trie are comparing it to the libraries listed below
- Library for creating In-memory circular buffers that use direct ByteBuffers to minimize GC overhead☆136Updated 2 years ago
- Bloofi: A java implementation of multidimensional Bloom filters☆79Updated 9 years ago
- A hash-based high-performance data store☆161Updated last year
- Explorations relative to cloning FlumeJava☆93Updated 4 years ago
- A toy school project intended to be an approximate clone of Google's Megastore database for geographically-distributed scalable fault-to…☆35Updated 13 years ago
- Distributed Java Collections for ZooKeeper☆109Updated 8 years ago
- ☆33Updated 6 years ago
- Java implementation of a probabilistic set data structure☆143Updated 7 years ago
- iSAX Indexing persisted in HBase☆39Updated 13 years ago
- A variable length record, checksumming, append only rotating log implementation with graceful recovery☆54Updated 4 years ago
- Ordasity is Boundary's library for building stateful clustered services on the JVM.☆345Updated last year
- This project provides utilities and wrappers around ZooKeeper☆64Updated 11 years ago
- ☆142Updated 3 years ago
- Concurrent TreeMap w/ efficient support for clone() and consistent iteration☆150Updated 12 years ago
- A lightweight platform monitoring tool for Java VMs☆154Updated 8 years ago
- It counts☆61Updated 12 years ago
- Continuous Streaming SQL Queries for Flume☆95Updated 13 years ago
- ☆59Updated 9 years ago
- A REST API for Mozilla Metrics services.☆57Updated 5 years ago
- DirectMemory is a cache implementation featuring off-heap memory storage (a-la BigMemory) to enable caching of large (or large numbers of…☆151Updated 13 years ago
- Use Avro to store all your values in HBase instead of regular columns☆75Updated 7 years ago
- ☆40Updated 9 years ago
- Probabilistic data structures server. The data model is key-value, where values are: Bloomfilters, LinearCounters, HyperLogLogs, CountMin…☆25Updated 9 years ago
- Drop-in replacement for java.util.concurrent.ConcurrentSkipList[Map|Set]☆29Updated 14 years ago
- ☆29Updated last week
- Schema and type system for creating sortable byte[]☆46Updated 12 years ago
- Basic stand-alone disk-based N-way merge sort component for Java☆85Updated last month
- High performance, memory-limited adaptive histogram class.☆46Updated 6 years ago
- An OO/Functional Crit-bit tree in Java.☆27Updated 10 years ago
- Practical Algorithm to Retrieve Information Coded in Alphanumeric (PATRICIA)☆177Updated 6 years ago