Abstract
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.
This work was supported by the National Natural Science Foundation of China (No. 61170064, No. 61133002), the National High Technology Research and Development Program of China (No. 2013AA013204) and the ICT Key Laboratory of Intelligent Information Processing, CAS.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dean, J., Ghemawat, S.: Mapreduce: Simplified data processing on large clusters. Communications of the ACM 51(1), 107–113 (2008)
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)
Hintsanen, P., Toivonen, H.: Finding reliable subgraphs from large probabilistic graphs. Data Mining and Knowledge Discovery 17(1), 3–23 (2008)
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)
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)
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)
Yan, X., Yu, P., Han, J.: Graph indexing: A frequent structure-based approach. In: SIGMOD, pp. 335–346. ACM (2004)
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)
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)
Zou, Z., Gao, H., Li, J.: Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics. In: SIGKDD, pp. 633–642. ACM (2010)
Zou, Z., Li, J., Gao, H., Zhang, S.: Finding top-k maximal cliques in an uncertain graph. In: ICDE, pp. 649–652. IEEE (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ruan, W., Wang, C., Han, L., Peng, Z., Bai, Y. (2013). Uncertain Subgraph Query Processing over Uncertain Graphs. In: Ishikawa, Y., Li, J., Wang, W., Zhang, R., Zhang, W. (eds) Web Technologies and Applications. APWeb 2013. Lecture Notes in Computer Science, vol 7808. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37401-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-37401-2_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37400-5
Online ISBN: 978-3-642-37401-2
eBook Packages: Computer ScienceComputer Science (R0)