Alternatives and similar repositories for RN-kNN-Exp

Users that are interested in RN-kNN-Exp are comparing it to the libraries listed below

• iwiwi / pruned-landmark-labeling
  Fast and exact shortest-path distance querying index
  ☆90Updated 11 years ago
• DeLaChance / LCR
  Master's thesis project involving label-constrained reachability (LCR)
  ☆1Updated 4 years ago
• TsinghuaDatabaseGroup / GTree
  shortest path query and kNN search on road network
  ☆40Updated 7 years ago
• GVeitBatz / KaTCH
  KaTCH -- Karlsruhe Time-Dependent Contraction Hierarchies
  ☆77Updated 3 years ago
• realstolz / powerlyra
  Differentiated Computation and Partitioning on Skewed (Natural or Bipartite) Graphs
  ☆66Updated 3 years ago
• cetusteam / contraction-hierarchies
  ☆23Updated 5 years ago
• mtodat / ms-bfs
  Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"
  ☆24Updated 9 years ago
• TsinghuaDatabaseGroup / DITA
  Distributed In-Memory Trajectory Analytics
  ☆37Updated 7 years ago
• Liuguanli / RSMI
  A Recursive Spatial Model Index
  ☆38Updated last year
• michaelwegner / CRP
  C++ Implementation of Customizable Route Planning (CRP) by Delling et al.
  ☆117Updated 9 years ago
• dsg-uwaterloo / s-graffito
  ☆11Updated 8 months ago
• Xtra-Computing / PathEnum
  Source code of "PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration", published in SIGMOD'2021 - By Shixuan Sun, Yuhang Chen…
  ☆14Updated 4 years ago
• the-data-lab / GraphOne
  "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19
  ☆58Updated 4 years ago
• pfl-cs / LISA
  ☆39Updated 4 years ago
• aldrichsun / Graph-Partitioning-with-Natural-Cuts
  Implementation of the graph partitioning algorithm described in paper "Graph Partitioning with Natural Cuts" in the 2011 IEEE Internation…
  ☆28Updated 8 years ago
• TsinghuaDatabaseGroup / VTree
  an indexing structure for knn search for moving objects on road networks
  ☆21Updated 8 years ago
• peterboncz / bloomfilter-repro
  ☆29Updated 5 years ago
• RenchuSong / PRESS
  PRESS is a novel framework of trajectory compression in road networks.
  ☆27Updated 2 years ago
• anilpacaci / streaming-graph-partitioning
  Experimental Setup for Performance Analysis of Streaming Algorithms
  ☆31Updated 3 years ago
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆81Updated 7 years ago
• kawatea / pruned-highway-labeling
  Fast shortest-path distance querying on road networks
  ☆21Updated 9 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆26Updated 4 years ago
• pabmont / pma
  Packed Memory Array
  ☆17Updated 11 years ago
• amorten / openlis
  Python package that implements Learned Index Structures and provides database-like interface
  ☆18Updated 7 years ago
• InitialDLab / XDB
  An approXimate DB that supports online aggregation queries
  ☆60Updated last year
• cwida / rma
  Sequential implementation of the Rewired Memory Array.
  ☆19Updated 6 years ago
• Erins-Ransom / Proteus
  This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.
  ☆13Updated 2 years ago
• Xtra-Computing / ForkGraph
  ☆17Updated 3 years ago
• iwiwi / historical-pruned-landmark-labeling
  Historical shortest-path distance querying index by pruned landmark labeling
  ☆10Updated 11 years ago
• navjindervirdee / Advanced-Shortest-Paths-Algorithms
  Java Code for Contraction Hierarchies Algorithm, A-Star Algorithm and Bidirectional Dijkstra Algorithm. Tested and Verified Code.
  ☆77Updated 7 years ago