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 last year
- Hyper-Dimensional R-Tree Index in Java☆71Updated 7 years ago
- Library which contains several time-dependent data and index structures (e.g., IntervalTree, BucketTimeSeries), as well as algorithms.☆128Updated 2 weeks ago
- A generic compact Trie implementation in Java. Built for high-performance applications.☆45Updated 4 years ago
- A hashmap implementation for Java that stores map entries off-heap☆70Updated 5 years ago
- Sux4J is an effort to bring succinct data structures to Java.☆167Updated last month
- Master repository for the JHeaps project☆48Updated 4 years ago
- Java library to create and search random access files (including in S3) using the space-filling hilbert index (sparse)☆48Updated last week
- Disk-backed hashmaps for Java☆31Updated 9 years ago
- Testing in-memory spatial indexes☆26Updated last year
- Java implementation of the Sparkey key value store☆120Updated last year
- Persistent Adaptive Radix Trees in Java☆82Updated 4 years ago
- Lightweight dataflow Java library. Includes various asynchronous constructs, including actors and asynchronous I/O requests.☆96Updated 2 years ago
- Java port of a concurrent trie hash map implementation from the Scala collections library☆152Updated 4 years ago
- Java port of a concurrent trie hash map implementation from the Scala collections library☆29Updated 6 months ago
- ☆22Updated 11 years ago
- HashMap performance tests from java-performance.info☆98Updated 4 years ago
- AirConcurrentMap is a fast, memory efficient Java ConcurrentNavigableMap implementation☆32Updated 7 years ago
- Networking and buffer APIs and implementations for use in Copycat and Atomix☆52Updated 8 years ago
- TuplDB is a high-performance, concurrent, transactional, scalable, low-level embedded database.☆121Updated last month
- A fast and space efficient Radix tree in Java☆126Updated 5 years ago
- Graphstream algo☆102Updated 3 years ago
- Graphulo: Accumulo library of matrix math primitives and graph algorithms☆78Updated this week
- hp low latency reliable multicast messaging☆121Updated 9 years ago
- A cache-coherent in-memory data grid☆340Updated 3 years ago
- PH-Tree☆129Updated 3 months ago
- Java Constraint Programming solver☆227Updated last year
- Java 8 implementation of a red-black interval-tree, with testing☆39Updated 4 years ago
- Rolling hash functions in Java☆79Updated 9 years ago
- JSuffixArrays (Suffix Arrays in Java)☆59Updated 8 years ago