razen-alharbi / AdPartLinks
Accelerating SPARQL Queries by Exploiting Hash-based Locality and Adaptive Partitioning
☆10Updated 9 years ago
Alternatives and similar repositories for AdPart
Users that are interested in AdPart are comparing it to the libraries listed below
Sorting:
- A Distributed RDF Data Management System for Processing SPARQL Queries Over Distributed RDF Graphs☆14Updated 2 years ago
- High-performance (C++) implementation of the leapfrog-triejoin algorithm by Todd Veldhuizen (http://arxiv.org/abs/1210.0481)☆21Updated 9 years ago
- Docker Images, installation scripts, and testing & benchmarking suite for Graph Databases☆37Updated 3 years ago
- Driver for the LDBC SNB Interactive workload☆20Updated 5 months ago
- Generic driver for LDBC Graphalytics implementation☆83Updated 6 months ago
- Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"☆24Updated 9 years ago
- Labelled Subgraph Query Benchmark – A lightweight benchmark suite focusing on subgraph matching queries. Note: This is a microbenchmark f…☆33Updated last month
- ☆43Updated 2 years ago
- ☆19Updated 3 years ago
- A collection of workload implementations for the LDBC SNB benchmark driver☆20Updated 4 years ago
- Your worst case is our best case.☆137Updated 8 years ago
- Graphs analytics on collections of views!☆35Updated last year
- Edge-centric Graph Processing System using Streaming Partitions☆82Updated 7 years ago
- Code used in the paper "On dynamic succinct graph representations".☆11Updated 3 years ago
- Extension of the rdf3x engine and the translatesparql tool.☆45Updated 11 years ago
- Out-of-core graph processing on a single machine.☆129Updated 7 years ago
- A C++ library for the analysis of structural dynamic graphs☆27Updated 3 years ago
- ☆26Updated 3 years ago
- Reference implementations for the LDBC Social Network Benchmark's Business Intelligence (BI) workload☆43Updated 2 months ago
- WebGraph framework with extensions☆23Updated 10 years ago
- Frog is Asynchronous Graph Processing on GPU with Hybrid Coloring Model. The fundamental idea is based on Pareto principle (or 80-20 rule…☆36Updated 4 years ago
- A graph-based distributed in-memory store that leverages efficient graph exploration to provide highly concurrent and low-latency queries…☆189Updated 2 years ago
- Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19☆32Updated 2 months ago
- This repository contains information about graph processing.☆32Updated 10 months ago
- ☆15Updated 7 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆88Updated 6 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
- Linked SPARQL Queries (LSQ): Framework for RDFizing triple store (web) logs and performing SPARQL query extraction, analysis and benchmar…☆26Updated 8 months ago
- CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.☆52Updated 9 years ago
- C++ driver to evaluate updates in dynamic structural graphs☆16Updated 3 years ago