Alternatives and similar repositories for GTree

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

• pfl-cs / LISA
  ☆40Updated 4 years ago
• Liuguanli / RSMI
  A Recursive Spatial Model Index
  ☆38Updated last year
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 6 years ago
• yangjufo / Learned-Indexes
  Implementation of BTree part for paper 'The Case for Learned Index Structures'
  ☆148Updated 6 years ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆158Updated last year
• KnightKingWalk / KnightKing
  A general-purpose, distributed graph random walk engine.
  ☆109Updated last year
• TsinghuaDatabaseGroup / VTree
  an indexing structure for knn search for moving objects on road networks
  ☆21Updated 8 years ago
• zkysfls / 20fall-
  ☆101Updated 5 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 2 years ago
• TsinghuaDatabaseGroup / DITA
  Distributed In-Memory Trajectory Analytics
  ☆37Updated 7 years ago
• ansrlab / edgepart
  Graph edge partitioning algorithms
  ☆46Updated 5 years ago
• realstolz / powerlyra
  Differentiated Computation and Partitioning on Skewed (Natural or Bipartite) Graphs
  ☆66Updated 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
• 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?"
  ☆19Updated 4 years ago
• kon0925 / coconut
  A scalable bottom-up approach for building data series indexes
  ☆15Updated 3 years ago
• TsinghuaDatabaseGroup / Dima
  simialrity join or search on spark core directly
  ☆27Updated 4 years ago
• tangloner / rtree
  rtree test, DBGroup
  ☆7Updated 6 years ago
• wangsibovictor / fora
  FORA: Simple and Effective Approximate Single-Source Personalized Pagerank
  ☆31Updated 4 years ago
• iwiwi / pruned-landmark-labeling
  Fast and exact shortest-path distance querying index
  ☆90Updated 11 years ago
• andreaskipf / learnedcardinalities
  Code and workloads from the Learned Cardinalities paper (https://arxiv.org/abs/1809.00677)
  ☆124Updated 6 years ago
• BigDataAnalyticsGroup / GENE
  Code used for VLDB paper "The next 50 Years in Database Indexing or: The Case for Automatically Generated Index Structures"
  ☆11Updated 3 years ago
• Yuzhen11 / Effective_Modern_Cpp
  ☆13Updated 8 years ago
• parimarjan / db-embedding-tools
  blah
  ☆35Updated 6 years ago
• jinw18 / Readings_MLDB
  Paper list about adopting machine learning techniques into data management tasks.
  ☆37Updated 4 years ago
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆18Updated 3 years ago
• RyanMarcus / TreeConvolution
  PyTorch implementation of binary tree convolution
  ☆50Updated 5 years ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆58Updated 11 months ago
• HuangQiang / QALSH
  Query-Aware LSH for Approximate NNS (PVLDB 2015 and VLDBJ 2017)
  ☆29Updated 4 years ago
• sfu-db / AreCELearnedYet
  ☆71Updated 2 years ago
• cwida / pvldbstyle
  PVLDB LaTeX style, based on acmart
  ☆13Updated 4 years ago