The pursuit of a good possible world

Panos Parchas, Francesco Gullo, Dimitris Papadias, Franceseco Bonchi
2014 Proceedings of the 2014 ACM SIGMOD international conference on Management of data - SIGMOD '14  
Data in several applications can be represented as an uncertain graph, whose edges are labeled with a probability of existence. Exact query processing on uncertain graphs is prohibitive for most applications, as it involves evaluation over an exponential number of instantiations. Even approximate processing based on sampling is usually extremely expensive since it requires a vast number of samples to achieve reasonable quality guarantees. To overcome these problems, we propose algorithms for
more » ... ating deterministic representative instances of uncertain graphs that maintain the underlying graph properties. Specifically, our algorithms aim at preserving the expected vertex degrees because they capture well the graph topology. Conventional processing techniques can then be applied on these instances to closely approximate the result on the uncertain graph. We experimentally demonstrate, with real and synthetic uncertain graphs, that indeed the representative instances can be used to answer, efficiently and accurately, queries based on several properties such as shortest path distance, clustering coefficient and betweenness centrality.
doi:10.1145/2588555.2593668 dblp:conf/sigmod/ParchasGPB14 fatcat:34vn4yde6nfglcndiciq72opju