Distributed Set Reachability
Summary: Distributed set-reachability over partitioned graphs: reduces redundant work and inter-node traffic, enabling parallel evaluation. Outperforms Giraph++ on graphs up to 1.4B edges; supports SPARQL 1.1 property-path queries and social-graph analysis. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sairam Gurajada (Max Planck Institute)
- 2. Martin Theobald (University of Ulm)
BibTeX Citation
@inproceedings{gurajada_sigmod16,
title = {{Distributed Set Reachability}},
author = {Gurajada, Sairam and Theobald, Martin},
series = {{SIGMOD} '16},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2882903.2915226},
url = {https://dl.acm.org/doi/10.1145/2882903.2915226},
year = {2016}
}
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,118 | Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs | 2024 | SIGMOD | 5.3201316e-05 |
| 10,748 | Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs | 2025 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,197 | Connectivity-Oriented Property Graph Partitioning for Distributed Graph Pattern Query Processing | 2024 | SIGMOD |
| 2 | 12,130 | Evaluating SPARQL Queries on Massive RDF Datasets | 2015 | VLDB |
| 3 | 1,246 | Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows | 2018 | VLDB |
| 4 | 1,803 | Towards Effective Partition Management for Large Graphs | 2012 | SIGMOD |
| 5 | 1,796 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD |
| 6 | 442 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 7 | 6,111 | Scaling Queries over Big RDF Graphs with Semantic Hash Partitioning | 2013 | VLDB |
| 8 | 4,813 | Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs | 2013 | VLDB |
| 9 | 500 | Scalable SPARQL Querying of Large RDF Graphs | 2011 | VLDB |
| 10 | 5,029 | Performance Guarantees for Distributed Reachability Queries | 2012 | VLDB |