Efficient probabilistic supergraph search

Wenjie Zhang, Xuemin Lin, Ying Zhang, Ke Zhu, Gaoping Zhu

Abstract: In this paper, we investigate the problem of supergraph containment search over uncertain data graphs gu where each edge in a gu has an occurrence probability, namely probabilistic supergraph search, which has a wide spectrum of applications.