{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:34:47Z","timestamp":1725489287096},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642374005"},{"type":"electronic","value":"9783642374012"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37401-2_15","type":"book-chapter","created":{"date-parts":[[2013,3,22]],"date-time":"2013-03-22T04:03:25Z","timestamp":1363925005000},"page":"132-139","source":"Crossref","is-referenced-by-count":0,"title":["Uncertain Subgraph Query Processing over Uncertain Graphs"],"prefix":"10.1007","author":[{"given":"Wenjing","family":"Ruan","sequence":"first","affiliation":[]},{"given":"Chaokun","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Lu","family":"Han","sequence":"additional","affiliation":[]},{"given":"Zhuo","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Yiyuan","family":"Bai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J. Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: Simplified data processing on large clusters. Communications of the ACM\u00a051(1), 107\u2013113 (2008)","journal-title":"Communications of the ACM"},{"issue":"1-2","key":"15_CR2","doi-asserted-by":"crossref","first-page":"449","DOI":"10.14778\/1920841.1920901","volume":"3","author":"W. Han","year":"2010","unstructured":"Han, W., Lee, J., Pham, M., Yu, J.: iGraph: A framework for comparisons of disk-based graph indexing techniques. Proceedings of the VLDB Endowment\u00a03(1-2), 449\u2013459 (2010)","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10618-008-0106-1","volume":"17","author":"P. Hintsanen","year":"2008","unstructured":"Hintsanen, P., Toivonen, H.: Finding reliable subgraphs from large probabilistic graphs. Data Mining and Knowledge Discovery\u00a017(1), 3\u201323 (2008)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"1-2","key":"15_CR4","doi-asserted-by":"crossref","first-page":"997","DOI":"10.14778\/1920841.1920967","volume":"3","author":"M. Potamias","year":"2010","unstructured":"Potamias, M., Bonchi, F., Gionis, A., Kollios, G.: K-nearest neighbors in uncertain graphs. Proceedings of the VLDB Endowment\u00a03(1-2), 997\u20131008 (2010)","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"5","key":"15_CR5","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1093\/nar\/30.5.1163","volume":"30","author":"R. Saito","year":"2002","unstructured":"Saito, R., Suzuki, H., Hayashizaki, Y.: Interaction generality, a measurement to assess the reliability of a protein\u2013protein interaction. Nucleic Acids Research\u00a030(5), 1163 (2002)","journal-title":"Nucleic Acids Research"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/11533719_45","volume-title":"Computing and Combinatorics","author":"F. Viger","year":"2005","unstructured":"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.\u00a03595, pp. 440\u2013449. Springer, Heidelberg (2005)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P., Han, J.: Graph indexing: A frequent structure-based approach. In: SIGMOD, pp. 335\u2013346. ACM (2004)","DOI":"10.1145\/1007568.1007607"},{"issue":"4","key":"15_CR8","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1145\/1114244.1114248","volume":"30","author":"X. Yan","year":"2005","unstructured":"Yan, X., Yu, P., Han, J.: Graph indexing based on discriminative frequent structure analysis. ACM Transactions on Database Systems (TODS)\u00a030(4), 960\u2013993 (2005)","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-12026-8_14","volume-title":"Database Systems for Advanced Applications","author":"Y. Yuan","year":"2010","unstructured":"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.\u00a05981, pp. 155\u2013170. Springer, Heidelberg (2010)"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Zou, Z., Gao, H., Li, J.: Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics. In: SIGKDD, pp. 633\u2013642. ACM (2010)","DOI":"10.1145\/1835804.1835885"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Zou, Z., Li, J., Gao, H., Zhang, S.: Finding top-k maximal cliques in an uncertain graph. In: ICDE, pp. 649\u2013652. IEEE (2010)","DOI":"10.1109\/ICDE.2010.5447891"}],"container-title":["Lecture Notes in Computer Science","Web Technologies and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37401-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T22:49:43Z","timestamp":1557614983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37401-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642374005","9783642374012"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37401-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}