Alternatives and similar repositories for phtree:

Users that are interested in phtree are comparing it to the libraries listed below

• tzaeschke / tinspin-indexes
  Spatial index library with R*Tree, STR-Tree, Quadtree, CritBit, KD-Tree, CoverTree and PH-Tree
  ☆114Updated 8 months ago
• tzaeschke / TinSpin
  Testing in-memory spatial indexes
  ☆26Updated 10 months ago
• richardstartin / vectorbenchmarks
  ☆29Updated 3 years ago
• ankurdave / part
  Persistent Adaptive Radix Trees in Java
  ☆81Updated 4 years ago
• thomasmueller / minperf
  A Minimal Perfect Hash Function Library
  ☆165Updated 4 years ago
• vigna / Sux4J
  Sux4J is an effort to bring succinct data structures to Java.
  ☆161Updated last year
• cojen / TuplDB
  TuplDB is a high-performance, concurrent, transactional, scalable, low-level embedded database.
  ☆121Updated last month
• d-michail / jheaps
  Master repository for the JHeaps project
  ☆47Updated 4 years ago
• apache / datasketches-memory
  High performance native memory access for Java.
  ☆125Updated last week
• davidmoten / hilbert-curve
  Java utilities for transforming distance along N-dimensional Hilbert Curve to a point and back. Also supports range splitting queries on …
  ☆116Updated 3 weeks ago
• xerial / larray
  Large off-heap arrays and mmap files for Scala and Java
  ☆402Updated 2 years ago
• richardstartin / multi-matcher
  simple rules engine
  ☆91Updated 5 years ago
• bnyeggen / lash
  Disk-backed hashmaps for Java
  ☆31Updated 8 years ago
• AugustNagro / utf8.java
  Vectorized UTF-8 Validation for Java
  ☆63Updated 10 months ago
• bdupras / guava-probably
  Probabilistic data structures for Guava.
  ☆54Updated 4 years ago
• omry / banana
  Banana is a Java primitive collections library with its own memory management
  ☆72Updated 3 years ago
• davidmoten / sparse-hilbert-index
  Java library to create and search random access files (including in S3) using the space-filling hilbert index (sparse)
  ☆48Updated 3 weeks ago
• spotify / sparkey-java
  Java implementation of the Sparkey key value store
  ☆119Updated last year
• jchambers / jvptree
  A generic vantage point tree (vp-tree) implementation in Java
  ☆43Updated 3 years ago
• davidmoten / rtree2
  Immutable in-memory R-Tree and R*-Tree for Java with Iterable API
  ☆90Updated 3 weeks ago
• lemire / bloofi
  Bloofi: A java implementation of multidimensional Bloom filters
  ☆79Updated 9 years ago
• fast-pack / JavaFastPFOR
  A simple integer compression library in Java
  ☆547Updated 10 months ago
• peter-lawrey / HugeCollections-OLD
  Huge Collections for Java using efficient off heap storage
  ☆274Updated 10 years ago
• ClickerMonkey / TrieHard
  A generic compact Trie implementation in Java. Built for high-performance applications.
  ☆44Updated 4 years ago
• alexkasko / unsafe-tools
  Tools to work with off-heap memory using sun.misc.Unsafe
  ☆136Updated 8 years ago
• conversant / rtree
  Hyper-Dimensional R-Tree Index in Java
  ☆71Updated 6 years ago
• lmdbjava / benchmarks
  Benchmark of open source, embedded, memory-mapped, key-value stores available from Java (JMH)
  ☆141Updated 2 years ago
• boundary / fasttuple
  ☆142Updated 3 years ago
• TimeAndSpaceIO / SmoothieMap
  A gulp of low latency Java
  ☆301Updated 5 years ago
• cfelde / BinaryOffheapHashMap
  A hashmap implementation for Java that stores map entries off-heap
  ☆70Updated 4 years ago