{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:43:25Z","timestamp":1725745405649},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401725"},{"type":"electronic","value":"9783642401732"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40173-2_13","type":"book-chapter","created":{"date-parts":[[2013,8,17]],"date-time":"2013-08-17T01:38:34Z","timestamp":1376703514000},"page":"124-140","source":"Crossref","is-referenced-by-count":1,"title":["Comparison Queries for Uncertain Graphs"],"prefix":"10.1007","author":[{"given":"Denis","family":"Dimitrov","sequence":"first","affiliation":[]},{"given":"Lisa","family":"Singh","sequence":"additional","affiliation":[]},{"given":"Janet","family":"Mann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Arangodb graph database, \n                    \n                      http:\/\/www.arangodb.org\/"},{"key":"13_CR2","unstructured":"Dex graph database, \n                    \n                      http:\/\/www.sparsity-technologies.com\/dex"},{"key":"13_CR3","unstructured":"Gremlin language for graph traversal and manipulation, \n                    \n                      https:\/\/github.com\/tinkerpop\/gremlin\/wiki"},{"key":"13_CR4","unstructured":"Neo4j graph database, \n                    \n                      http:\/\/neo4j.org\/"},{"key":"13_CR5","unstructured":"Oracle spatial and graph option, \n                    \n                      http:\/\/www.oracle.com\/technetwork\/database-options\/spatialandgraph\/overview\/index.html"},{"key":"13_CR6","unstructured":"Orientdb document-graph dbms, \n                    \n                      http:\/\/www.orientechnologies.com\/"},{"key":"13_CR7","unstructured":"Titan graph database, \n                    \n                      http:\/\/thinkaurelius.github.com\/titan\/"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/s007990050001","volume":"1","author":"S. Abiteboul","year":"1997","unstructured":"Abiteboul, S., Quass, D., McHugh, J., Widom, J., Wiener, J.: The Lorel query language for semistructured data. International Journal on Digital Libraries\u00a01, 68\u201388 (1997)","journal-title":"International Journal on Digital Libraries"},{"key":"13_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1322432.1322433","volume":"40","author":"R. Angles","year":"2008","unstructured":"Angles, R., Gutierrez, C.: Survey of graph database models. ACM Computer Surveys\u00a040, 1:1\u20131:39 (2008)","journal-title":"ACM Computer Surveys"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Cesario, N., Pang, A., Singh, L.: Visualizing node attribute uncertainty in graphs. In: SPIE VDA (2011)","DOI":"10.1117\/12.872677"},{"key":"13_CR11","unstructured":"Fortin, S.: The graph isomorphism problem. Technical report (1996)"},{"key":"13_CR12","unstructured":"G\u00fcting, R.H.: GraphDB: Modeling and querying graphs in databases. In: VLDB (1994)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"He, H., Singh, A.K.: Graphs-at-a-time: query language and access methods for graph databases. In: ACM SIGMOD (2008)","DOI":"10.1145\/1376616.1376660"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Jin, R., Liu, L., Aggarwal, C.C.: Discovering highly reliable subgraphs in uncertain graphs. In: ACM SIGKDD (2011)","DOI":"10.1145\/2020408.2020569"},{"issue":"9","key":"13_CR15","doi-asserted-by":"crossref","first-page":"551","DOI":"10.14778\/2002938.2002941","volume":"4","author":"R. Jin","year":"2011","unstructured":"Jin, R., Liu, L., Ding, B., Wang, H.: Distance-constraint reachability computation in uncertain graphs. Proc. VLDB Endow.\u00a04(9), 551\u2013562 (2011)","journal-title":"Proc. VLDB Endow."},{"key":"13_CR16","unstructured":"Koch, C.: MayBMS: A system for managing large uncertain and probabilistic databases. In: Managing and Mining Uncertain Data. Springer (2009)"},{"key":"13_CR17","unstructured":"Mann, J., Team, S.B.R.: Shark bay dolphin project (2011), \n                    \n                      http:\/\/www.monkeymiadolphins.org"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Papapetrou, O., Ioannou, E., Skoutas, D.: Efficient discovery of frequent subgraph patterns in uncertain graph databases. In: EDBT\/ICDT (2011)","DOI":"10.1145\/1951365.1951408"},{"key":"13_CR19","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. Proc. VLDB Endow.\u00a03, 997\u20131008 (2010)","journal-title":"Proc. VLDB Endow."},{"key":"13_CR20","unstructured":"PrudHommeaux, E., Seaborne, A.: Sparql query language for rdf. W3C Recommendation\u00a015 (2008)"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1026543900054","volume":"40","author":"Y. Rubner","year":"2000","unstructured":"Rubner, Y., Tomasi, C., Guibas, L.J.: The earth mover\u2019s distance as a metric for image retrieval. Int. J. Comput. Vision\u00a040, 99\u2013121 (2000)","journal-title":"Int. J. Comput. Vision"},{"issue":"3","key":"13_CR22","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1609\/aimag.v29i3.2157","volume":"29","author":"P. Sen","year":"2008","unstructured":"Sen, P., Namata, G.M., Bilgic, M., Getoor, L., Gallagher, B., Eliassi-Rad, T.: Collective classification in network data. AI Magazine\u00a029(3), 93\u2013106 (2008)","journal-title":"AI Magazine"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Sharara, H., Sopan, A., Namata, G., Getoor, L., Singh, L.: G-PARE: A visual analytic tool for comparative analysis of uncertain graphs. In: IEEE VAST (2011)","DOI":"10.1109\/VAST.2011.6102442"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Shasha, D., Wang, J.T.L., Giugno, R.: Algorithmics and applications of tree and graph searching. In: ACM PODS (2002)","DOI":"10.1145\/543619.543620"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Singh, L., Beard, M., Getoor, L., Blake, M.B.: Visual mining of multi-modal social networks at different abstraction levels. In: Information Visualization (2007)","DOI":"10.1109\/IV.2007.126"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Singh, S., Mayfield, C., Mittal, S., Prabhakar, S., Hambrusch, S., Shah, R.: Orion 2.0: native support for uncertain data. In: ACM SIGMOD (2008)","DOI":"10.1145\/1376616.1376744"},{"key":"13_CR27","unstructured":"Widom, J.: Trio: A system for data, uncertainty, and lineage. In: Managing and Mining Uncertain Data. Springer (2009)"},{"key":"13_CR28","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_CR29","doi-asserted-by":"crossref","unstructured":"Zhou, H., Shaverdian, A.A., Jagadish, H.V., Michailidis, G.: Querying graphs with uncertain predicates. In: ACM Workshop on Mining and Learning with Graphs (2010)","DOI":"10.1145\/1830252.1830273"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Zhu, Y., Qin, L., Yu, J.X., Cheng, H.: Finding top-k similar graphs in graph databases. In: EDBT (2012)","DOI":"10.1145\/2247596.2247650"},{"key":"13_CR31","doi-asserted-by":"crossref","unstructured":"Zou, Z., Gao, H., Li, J.: Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics. In: ACM KDD (2010)","DOI":"10.1145\/1835804.1835885"},{"key":"13_CR32","doi-asserted-by":"crossref","unstructured":"Zou, Z., Li, J., Gao, H., Zhang, S.: Finding top-k maximal cliques in an uncertain graph. In: IEEE ICDE (2010)","DOI":"10.1109\/ICDE.2010.5447891"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40173-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T14:02:03Z","timestamp":1558015323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40173-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401725","9783642401732"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40173-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}