Uncertain Subgraph Query Processing over Uncertain Graphs

  • Wenjing Ruan
  • Chaokun Wang
  • Lu Han
  • Zhuo Peng
  • Yiyuan Bai
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7808)


In some real-world applications, data cannot be measured accurately. Uncertain graphs emerge when this kind of data is modeled by graph data structures. When the graph database is uncertain, our query is highly possibly uncertain too. All of the prior works do not consider the uncertainty of the query. In this paper, we propose a new algorithm called Mutual-Match to solve the problem of uncertain subgraph query under the situation where both the graph dataset and the query are uncertain. Considering that the subgraph isomorphism verification is an NP-hard problem, and it will be more complex on uncertain graph data, the Mutual-Match algorithm uses MapReduce processes to find out all the subgraph matches and can adapt to dynamic graphs well. Experimental results on both real-world and synthetic datasets show the correctness and effectiveness of our proposed methods.


Uncertain subgraph query uncertain graphs mutual-match dynamic graphs mapreduce 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Dean, J., Ghemawat, S.: Mapreduce: Simplified data processing on large clusters. Communications of the ACM 51(1), 107–113 (2008)CrossRefGoogle Scholar
  2. 2.
    Han, W., Lee, J., Pham, M., Yu, J.: iGraph: A framework for comparisons of disk-based graph indexing techniques. Proceedings of the VLDB Endowment 3(1-2), 449–459 (2010)Google Scholar
  3. 3.
    Hintsanen, P., Toivonen, H.: Finding reliable subgraphs from large probabilistic graphs. Data Mining and Knowledge Discovery 17(1), 3–23 (2008)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Potamias, M., Bonchi, F., Gionis, A., Kollios, G.: K-nearest neighbors in uncertain graphs. Proceedings of the VLDB Endowment 3(1-2), 997–1008 (2010)Google Scholar
  5. 5.
    Saito, R., Suzuki, H., Hayashizaki, Y.: Interaction generality, a measurement to assess the reliability of a protein–protein interaction. Nucleic Acids Research 30(5), 1163 (2002)CrossRefGoogle Scholar
  6. 6.
    Viger, F., Latapy, M.: Efficient and simple generation of random simple connected graphs with prescribed degree sequence. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 440–449. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  7. 7.
    Yan, X., Yu, P., Han, J.: Graph indexing: A frequent structure-based approach. In: SIGMOD, pp. 335–346. ACM (2004)Google Scholar
  8. 8.
    Yan, X., Yu, P., Han, J.: Graph indexing based on discriminative frequent structure analysis. ACM Transactions on Database Systems (TODS) 30(4), 960–993 (2005)CrossRefGoogle Scholar
  9. 9.
    Yuan, Y., Chen, L., Wang, G.: Efficiently answering probability threshold-based shortest path queries over uncertain graphs. In: Kitagawa, H., Ishikawa, Y., Li, Q., Watanabe, C. (eds.) DASFAA 2010, Part I. LNCS, vol. 5981, pp. 155–170. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  10. 10.
    Zou, Z., Gao, H., Li, J.: Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics. In: SIGKDD, pp. 633–642. ACM (2010)Google Scholar
  11. 11.
    Zou, Z., Li, J., Gao, H., Zhang, S.: Finding top-k maximal cliques in an uncertain graph. In: ICDE, pp. 649–652. IEEE (2010)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Wenjing Ruan
    • 1
  • Chaokun Wang
    • 1
    • 2
    • 4
  • Lu Han
    • 1
  • Zhuo Peng
    • 1
  • Yiyuan Bai
    • 1
    • 3
  1. 1.School of SoftwareTsinghua UniversityBeijingChina
  2. 2.Tsinghua National Laboratory for Information Science and TechnologyTsinghua UniversityChina
  3. 3.Department of Computer Science and TechnologyTsinghua UniversityChina
  4. 4.Key Laboratory of Intelligent Information Processing, Institute of Computing TechnologyChinese Academy of SciencesChina

Personalised recommendations