Alternatives and similar repositories for bed-tree:

Users that are interested in bed-tree are comparing it to the libraries listed below

• TsinghuaDatabaseGroup / Similarity-Search-and-Join
  similarity join and search algorithms for edit distance and jaccard
  ☆18Updated 7 years ago
• xhochy / libfuzzymatch
  C++11 library for fast fuzzy searching
  ☆14Updated 9 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated 2 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆42Updated 8 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• project-flink / flink-graph
  ***Warning*** Old Apache Flink Graph API: This repository is not in use anymore.
  ☆15Updated 9 years ago
• efficient / fast-succinct-trie
  ☆25Updated 8 years ago
• dbis-ilm / pipefabric
  Stream processing engine
  ☆12Updated 3 years ago
• simongog / RoSA
  Reduced on-disk Suffix Array
  ☆21Updated 11 years ago
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆40Updated 10 years ago
• brentp / fastbit-python
  pythonic access to fastbit
  ☆26Updated 6 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 4 years ago
• xxsds / multi_index
  A C++ template library for compact Hamming distance indexes
  ☆10Updated 7 years ago
• IntelLabs / pmgd
  Persistent Memory Graph Database
  ☆44Updated 2 years ago
• hermanstehouwer / Enhanced-Suffix-Arrays
  A flexible implementation of enhanced suffix arrays in template based C++. Supports single and multi-position wildcard. Fast queries than…
  ☆20Updated 4 years ago
• M-Flash / m-flash-cpp
  ☆15Updated 7 years ago
• splatlab / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆15Updated 6 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 8 years ago
• camsas / Musketeer
  The Musketeer workflow manager.
  ☆41Updated 6 years ago
• tdebatty / java-graphs
  Algorithms that build k-nearest neighbors graph (k-nn graph): Brute-force, NN-Descent,...
  ☆34Updated 6 years ago
• ucbrise / LatticeFlow
  ☆27Updated 8 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 9 years ago
• vmware-archive / quickstep
  Quickstep Project
  ☆27Updated 6 years ago
• cmu-db / mongodb-d4
  Automatic MongoDB database designer
  ☆55Updated 10 years ago
• gh-rdf3x / gh-rdf3x
  Extension of the rdf3x engine and the translatesparql tool.
  ☆46Updated 11 years ago
• robmccoll / graphdb-testing
  Benchmarking various graph databases, engines, datastructures, and data stores.
  ☆35Updated 11 years ago
• robmccoll / stinger
  The STINGER in-memory graph store and dynamic graph analysis platform. Millions to billions of vertices and edges at thousands to millio…
  ☆11Updated 9 years ago
• lemire / sparsebitmap
  A simple sparse bitmap implementation in java
  ☆21Updated 9 years ago