Alternatives and similar repositories for GTree

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

• Liuguanli / RSMI
  A Recursive Spatial Model Index
  ☆39Updated last year
• pfl-cs / LISA
  ☆42Updated 4 years ago
• yangjufo / Learned-Indexes
  Implementation of BTree part for paper 'The Case for Learned Index Structures'
  ☆149Updated 7 years ago
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆18Updated 7 years ago
• TsinghuaDatabaseGroup / VTree
  an indexing structure for knn search for moving objects on road networks
  ☆23Updated 8 years ago
• iwiwi / pruned-landmark-labeling
  Fast and exact shortest-path distance querying index
  ☆91Updated 11 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
• jinw18 / Readings_MLDB
  Paper list about adopting machine learning techniques into data management tasks.
  ☆37Updated 5 years ago
• KnightKingWalk / KnightKing
  A general-purpose, distributed graph random walk engine.
  ☆109Updated 2 years ago
• ansrlab / edgepart
  Graph edge partitioning algorithms
  ☆48Updated 6 years ago
• gvinciguerra / Learned-indexes-effectiveness
  Code for the TCS paper "On the performance of learned data structures" and the ICML paper "Why are learned indexes so effective?"
  ☆21Updated 4 years ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆164Updated 2 years ago
• TsinghuaDatabaseGroup / DITA
  Distributed In-Memory Trajectory Analytics
  ☆38Updated 7 years ago
• parimarjan / db-embedding-tools
  blah
  ☆35Updated 6 years ago
• realstolz / powerlyra
  Differentiated Computation and Partitioning on Skewed (Natural or Bipartite) Graphs
  ☆67Updated 3 years 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…
  ☆16Updated 4 years ago
• RapidsAtHKUST / RapidMatch
  Source code and datasets of "RapidMatch: A Holistic Approach to Subgraph Query Processing", accepted by VLDB'21 - By Shixuan Sun, Xibo Su…
  ☆33Updated 3 years ago
• thu-pacman / GridGraph
  Out-of-core graph processing on a single machine.
  ☆130Updated 7 years ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆60Updated last year
• fabiopetroni / VGP
  A software package for one-pass Vertex-cut balanced Graph Partitioning.
  ☆32Updated 10 years ago
• Yuzhen11 / Effective_Modern_Cpp
  ☆13Updated 8 years ago
• BigDataAnalyticsGroup / GENE
  Code used for VLDB paper "The next 50 Years in Database Indexing or: The Case for Automatically Generated Index Structures"
  ☆12Updated 3 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆25Updated 4 years ago
• KaHIP / KaHIP
  KaHIP -- Karlsruhe HIGH Quality Partitioning.
  ☆469Updated last month
• ehab-abdelhamid / GraMi
  GraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of ma…
  ☆118Updated last year
• andreaskipf / learnedcardinalities
  Code and workloads from the Learned Cardinalities paper (https://arxiv.org/abs/1809.00677)
  ☆126Updated 6 years ago
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆19Updated 3 years ago
• neurocard / neurocard
  State-of-the-art neural cardinality estimators for join queries
  ☆80Updated 5 years ago
• naru-project / naru
  Neural Relation Understanding: neural cardinality estimators for tabular data
  ☆105Updated 4 years ago
• kon0925 / coconut
  A scalable bottom-up approach for building data series indexes
  ☆15Updated 4 years ago