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
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,089 | Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs | 2024 | SIGMOD | 4.39898e-05 |
| 10,467 | Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs | 2025 | SIGMOD | 4.1945683e-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