A family of graph-theory-driven algorithms for managing complex probabilistic graph data efficiently (original) (raw)

Proceedings of the 15th Symposium on …, 2011

Abstract

Abstract Traditionally, a great deal of attention has been devoted to the problem of effectively modeling and querying probabilistic graph data. State-of-the-art proposals are not prone to deal with complex probabilistic data, as they essentially introduce simple data models (eg, based on confidence intervals) and straightforward query methodologies (eg, based on the reachability property). According to our vision, these proposals need to be extended towards achieving the definition of innovative models and algorithms capable of dealing with the ...

Paolo Serafino hasn't uploaded this paper.

Let Paolo know you want this paper to be uploaded.

Ask for this paper to be uploaded.