{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:33:01Z","timestamp":1725791581195},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319058092"},{"type":"electronic","value":"9783319058108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-05810-8_13","type":"book-chapter","created":{"date-parts":[[2014,4,16]],"date-time":"2014-04-16T03:31:25Z","timestamp":1397619085000},"page":"188-202","source":"Crossref","is-referenced-by-count":10,"title":["Label and Distance-Constraint Reachability Queries in Uncertain Graphs"],"prefix":"10.1007","author":[{"given":"Minghan","family":"Chen","sequence":"first","affiliation":[]},{"given":"Yu","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Yubin","family":"Bao","sequence":"additional","affiliation":[]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Jin, R., Xiang, Y., Ruan, N., Fuhry, D.: 3-hop: a high-compression indexing scheme for reachability query. In: SIGMOD Conference, pp. 813\u2013826 (2009)","DOI":"10.1145\/1559845.1559930"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Jin, R., Hong, H., Wang, H., Ruan, N., Xiang, Y.: Computing label-constraint reachability in graph databases. In: SIGMOD Conference, pp. 123\u2013134 (2010)","DOI":"10.1145\/1807167.1807183"},{"key":"13_CR3","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 (2010)","DOI":"10.1109\/ICDE.2010.5447891"},{"key":"13_CR4","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. LNCS, vol.\u00a05981, pp. 155\u2013170. Springer, Heidelberg (2010)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Zou, Z., Gao, H., Li, J.: Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics. In: KDD, pp. 633\u2013642 (2010)","DOI":"10.1145\/1835804.1835885"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C.: Managing and Mining Uncertain Data. Advances in Database Systems, vol.\u00a035. Kluwer (2009)","DOI":"10.1007\/978-0-387-09690-2"},{"key":"13_CR7","first-page":"997","volume":"3","author":"M. Potamias","year":"2010","unstructured":"Potamias, M., Bonchi, F., Gionis, A., Kollios, G.: k-nearest neighbors in uncertain graphs. PVLDB\u00a03, 997\u20131008 (2010)","journal-title":"PVLDB"},{"key":"13_CR8","first-page":"551","volume":"4","author":"R. Jin","year":"2011","unstructured":"Jin, R., Liu, L., Ding, B., Wang, H.: Distance-constraint reachability computation in uncertain graphs. PVLDB\u00a04, 551\u2013562 (2011)","journal-title":"PVLDB"},{"key":"13_CR9","first-page":"276","volume":"3","author":"H. Yildirim","year":"2010","unstructured":"Yildirim, H., Chaoji, V., Zaki, M.J.: Grail: Scalable reachability index for large graphs. PVLDB\u00a03, 276\u2013284 (2010)","journal-title":"PVLDB"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"van Schaik, S.J., de Moor, O.: A memory efficient reachability data structure through bit vector compression. In: SIGMOD Conference, pp. 913\u2013924 (2011)","DOI":"10.1145\/1989323.1989419"},{"key":"13_CR11","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s11704-012-1312-y","volume":"6","author":"W. Fan","year":"2012","unstructured":"Fan, W., Li, J., Ma, S., Tang, N., Wu, Y.: Adding regular expressions to graph reachability and pattern queries. Frontiers of Computer Science\u00a06, 313\u2013338 (2012)","journal-title":"Frontiers of Computer Science"},{"key":"13_CR12","unstructured":"Gubichev, A., Neumann, T.: Path query processing on very large rdf graphs. In: WebDB (2011)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Xu, K., Zou, L., Yu, J.X., Chen, L., Xiao, Y., Zhao, D.: Answering label-constraint reachability in large graphs. In: CIKM, pp. 1595\u20131600 (2011)","DOI":"10.1145\/2063576.2063807"},{"key":"13_CR14","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"key":"13_CR15","first-page":"235","volume":"15","author":"F. Yates","year":"1953","unstructured":"Yates, F., Grundy, P.: Selection without replacement from within strata with probability proportional to size. Journal of the Royal Statitical Society\u00a015, 235\u2013261 (1953)","journal-title":"Journal of the Royal Statitical Society"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Suchanek, F.M., Kasneci, G., Weikum, G.: Yago: a core of semantic knowledge. In: WWW, pp. 697\u2013706 (2007)","DOI":"10.1145\/1242572.1242667"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-05810-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,17]],"date-time":"2020-08-17T21:59:59Z","timestamp":1597701599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-05810-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319058092","9783319058108"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05810-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}