davidmoten / sparse-hilbert-indexLinks
Java library to create and search random access files (including in S3) using the space-filling hilbert index (sparse)
☆48Updated last week
Alternatives and similar repositories for sparse-hilbert-index
Users that are interested in sparse-hilbert-index are comparing it to the libraries listed below
Sorting:
- Java utilities for transforming distance along N-dimensional Hilbert Curve to a point and back. Also supports range splitting queries on …☆117Updated last week
- ☆35Updated 8 years ago
- Testing in-memory spatial indexes☆26Updated 11 months ago
- Spatial indexing algorithms for java☆15Updated 3 years ago
- LocationTech SFCurve is a Scala library for the creation, transformation, and querying of space-filling curves☆82Updated 2 years ago
- Disk-backed hashmaps for Java☆31Updated 8 years ago
- Spatial index library with R*Tree, STR-Tree, Quadtree, CritBit, KD-Tree, CoverTree and PH-Tree☆113Updated 9 months ago
- Hyper-Dimensional R-Tree Index in Java☆71Updated 6 years ago
- Space-Filling Curves in Scala☆26Updated 4 years ago
- Parallel boolean circuit evaluation☆20Updated 6 years ago
- Java language library for developing geospatial applications following OGC/ISO standards.☆101Updated this week
- Spatial database bindings for Java.☆67Updated 3 years ago
- Temporal_Graph_library☆25Updated 6 years ago
- Java implementation of the Sparkey key value store☆120Updated last year
- Automatically exported from code.google.com/p/uzaygezen☆27Updated 9 months ago
- A comprehensive jmh-based benchmark on various RTree configurations for Dave Moten's rtree implementation.☆11Updated 8 years ago
- सूचि - Toolkit to build Distributed Data Systems☆53Updated 2 years ago
- Immutable in-memory R-Tree and R*-Tree for Java with Iterable API☆92Updated last week
- Source code for SIMD benchmarks and experiments in Java☆32Updated 7 years ago
- A simple and high-performance Java B-tree: drop-in replacement for java.util.TreeMap☆28Updated 5 years ago
- A fast key-value store written in Java that outperforms levelDB, kyoto cabinet and rocksDB☆53Updated 2 years ago
- A hashmap implementation for Java that stores map entries off-heap☆70Updated 5 years ago
- Statistics about data (cardinality estimation, frequent item detection, approximate counting,...)☆16Updated 2 years ago
- Persistent Adaptive Radix Trees in Java☆81Updated 4 years ago
- 64-bit integer compression algorithms in Java☆15Updated 6 years ago
- Java Native Interface (JNI) Bindings for Mapnik2☆28Updated 8 years ago
- Union, intersection, and set cardinality in loglog space☆57Updated last year
- Experiments on bit-slice indexing☆13Updated 10 years ago
- Production-ready Java implementation of the Xor Filter.☆17Updated 5 years ago
- B+-tree in java that stores to disk using memory mapped files, supports range queries and duplicate keys☆47Updated this week