lodborg / interval-treeLinks
Implementation of a dynamic interval tree, supporting efficient lookup for all intervals intersecting a query.
☆30Updated 6 years ago
Alternatives and similar repositories for interval-tree
Users that are interested in interval-tree are comparing it to the libraries listed below
Sorting:
- Spatial index library with R*Tree, STR-Tree, Quadtree, CritBit, KD-Tree, CoverTree and PH-Tree☆113Updated 11 months ago
- Hyper-Dimensional R-Tree Index in Java☆71Updated 6 years ago
- Library which contains several time-dependent data and index structures (e.g., IntervalTree, BucketTimeSeries), as well as algorithms.☆128Updated 4 months ago
- A generic compact Trie implementation in Java. Built for high-performance applications.☆45Updated 4 years ago
- TuplDB is a high-performance, concurrent, transactional, scalable, low-level embedded database.☆121Updated 3 weeks ago
- Master repository for the JHeaps project☆48Updated 4 years ago
- Java port of a concurrent trie hash map implementation from the Scala collections library☆29Updated 5 months ago
- Banana is a Java primitive collections library with its own memory management☆72Updated 3 years ago
- Java implementation of the Sparkey key value store☆120Updated last year
- A hashmap implementation for Java that stores map entries off-heap☆70Updated 5 years ago
- Java port of a concurrent trie hash map implementation from the Scala collections library☆152Updated 4 years ago
- Sux4J is an effort to bring succinct data structures to Java.☆163Updated 3 weeks ago
- Lightweight dataflow Java library. Includes various asynchronous constructs, including actors and asynchronous I/O requests.☆96Updated 2 years ago
- PH-Tree☆129Updated 2 months ago
- A java.util.HashMap compatible map that won't stall puts or gets when resizing☆151Updated 2 years ago
- Write parsers for arbitrary text inputs, entirely in Java, with no preprocessing phase☆65Updated 9 years ago
- Provides off-heap storage for in-memory datagrid build in Turkey☆51Updated 9 years ago
- Testing in-memory spatial indexes☆26Updated last year
- Java implementation of Count-Min sketch for finding frequency of events in a stream of data within specified error bounds☆11Updated 10 years ago
- Networking and buffer APIs and implementations for use in Copycat and Atomix☆52Updated 8 years ago
- AirConcurrentMap is a fast, memory efficient Java ConcurrentNavigableMap implementation☆32Updated 7 years ago
- Java library to create and search random access files (including in S3) using the space-filling hilbert index (sparse)☆48Updated 2 weeks ago
- ☆17Updated 5 years ago
- simple rules engine☆92Updated 5 years ago
- Benchmark of open source, embedded, memory-mapped, key-value stores available from Java (JMH)☆142Updated 2 years ago
- A fast and space efficient Radix tree in Java☆126Updated 5 years ago
- Data versioning library for Java☆61Updated 7 years ago
- Neat algorithm implementations in Java.☆119Updated 4 years ago
- ☆22Updated 11 years ago
- Memory efficient java.util.Map implementation modelled after http://code.google.com/apis/v8/design.html☆62Updated last year