DBScholar

Back to papers

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)

Paper ID
5315
Venue
SIGMOD
Year
2016
Pagerank
5.3916003e-05
Overall Rank
8,651 | 40.65%
DOI
10.1145/2882903.2915226

Incoming Non-self Citations Over Time

Authors

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.

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