tenindra / RN-kNN-Exp
This project consists of implementations of several kNN algorithms for road networks (aka finding nearest points of interest) and the experimental framework to compare them from a research paper published in PVLDB 2016. You can use it to add new methods and/or queries or reproduce our experimental results.
☆9Updated 10 months ago
Alternatives and similar repositories for RN-kNN-Exp:
Users that are interested in RN-kNN-Exp are comparing it to the libraries listed below
- Fast and exact shortest-path distance querying index☆90Updated 10 years ago
- Differentiated Computation and Partitioning on Skewed (Natural or Bipartite) Graphs☆65Updated 2 years ago
- Master's thesis project involving label-constrained reachability (LCR)Updated 3 years ago
- Implementation of the graph partitioning algorithm described in paper "Graph Partitioning with Natural Cuts" in the 2011 IEEE Internation…☆25Updated 8 years ago
- Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"☆24Updated 9 years ago
- C++ Implementation of Customizable Route Planning (CRP) by Delling et al.☆112Updated 8 years ago
- A Recursive Spatial Model Index☆38Updated 11 months ago
- ☆17Updated 3 years ago
- Distributed In-Memory Trajectory Analytics☆37Updated 7 years ago
- ☆39Updated 3 years ago
- Experimental Setup for Performance Analysis of Streaming Algorithms☆31Updated 3 years ago
- ☆17Updated 3 months ago
- Historical shortest-path distance querying index by pruned landmark labeling☆10Updated 10 years ago
- A simple implementation of the packed memory array☆18Updated 11 years ago
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆58Updated 4 years ago
- Sequential implementation of the Rewired Memory Array.☆18Updated 5 years ago
- An approXimate DB that supports online aggregation queries☆60Updated 10 months ago
- Trillion-edge Scale Graph Edge Partitioning☆27Updated 5 years ago
- Source code of "ThunderRW: An In-Memory Graph Random Walk Engine" published in VLDB'2021 - By Shixuan Sun, Yuhang Chen, Shengliang Lu, Bi…☆26Updated 3 years ago
- An active graph database.☆16Updated 7 years ago
- A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"☆81Updated 7 years ago
- KaTCH -- Karlsruhe Time-Dependent Contraction Hierarchies☆76Updated 3 years ago
- Linked Stream Benchmark☆13Updated 2 years ago
- ☆11Updated last year
- Packed Memory Array☆17Updated 10 years ago
- A SSD-based graph processing engine for billion-node graphs☆11Updated 10 years ago
- Source code of "PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration", published in SIGMOD'2021 - By Shixuan Sun, Yuhang Chen…☆14Updated 3 years ago
- A C++ library for summarizing data streams☆24Updated 5 years ago
- Code for the TCS paper "On the performance of learned data structures" and the ICML paper "Why are learned indexes so effective?"☆19Updated 3 years ago
- ☆19Updated 2 years ago