A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Distributed Set Reachability

2016
*
Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16
*

In this paper, we focus on the efficient and scalable processing of set-reachability queries over a distributed, directed data graph. A set-reachability query is a generalized form of a reachability query, in which we consider two sets S and T of source and target vertices, respectively, to be given as the query. The result of a set-reachability query are all pairs of source and target vertices (s, t), with s ∈ S and t ∈ T , where s is reachable to t (denoted as S ; T ). In case the data graph

doi:10.1145/2882903.2915226
dblp:conf/sigmod/GurajadaT16
fatcat:ktc7ppqesnatbfv7677rhxgw64