{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:52:08Z","timestamp":1742914328718,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662464847"},{"type":"electronic","value":"9783662464854"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46485-4_5","type":"book-chapter","created":{"date-parts":[[2015,2,21]],"date-time":"2015-02-21T10:51:17Z","timestamp":1424515877000},"page":"115-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Query Operators for Comparing 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","published-online":{"date-parts":[[2015,2,22]]},"reference":[{"key":"5_CR1","unstructured":"ArangoDB graph database. http:\/\/www.arangodb.org\/"},{"key":"5_CR2","unstructured":"DEX graph database. http:\/\/www.sparsity-technologies.com\/dex"},{"key":"5_CR3","unstructured":"Gremlin language for graph traversal and manipulation. https:\/\/github.com\/tinkerpop\/gremlin\/wiki"},{"key":"5_CR4","unstructured":"Neo4j graph database. http:\/\/neo4j.org\/"},{"key":"5_CR5","unstructured":"Oracle spatial and graph option. http:\/\/www.oracle.com\/technetwork\/database-options\/spatialandgraph\/overview\/index.html"},{"key":"5_CR6","unstructured":"OrientDB document-graph DBMS. http:\/\/www.orientechnologies.com\/"},{"key":"5_CR7","unstructured":"Titan graph database. http:\/\/thinkaurelius.github.com\/titan\/"},{"key":"5_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. Int. J. Digit. Libr. 1, 68\u201388 (1997)","journal-title":"Int. J. Digit. Libr."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1145\/1322432.1322433","volume":"40","author":"R Angles","year":"2008","unstructured":"Angles, R., Gutierrez, C.: Survey of graph database models. ACM Comput. Surv. 40, 1:1\u20131:39 (2008)","journal-title":"ACM Comput. Surv."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Cesario, N., Pang, A., Singh, L.: Visualizing node attribute uncertainty in graphs. In: SPIE Proceedings on Visualization and Data Analysis (2011)","DOI":"10.1117\/12.872677"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-40173-2_13","volume-title":"Database and Expert Systems Applications","author":"D Dimitrov","year":"2013","unstructured":"Dimitrov, D., Singh, L., Mann, J.: Comparison queries for uncertain graphs. In: Decker, H., Lhotsk\u00e1, L., Link, S., Basl, J., Tjoa, A.M. (eds.) DEXA 2013, Part II. LNCS, vol. 8056, pp. 124\u2013140. Springer, Heidelberg (2013)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Dimitrov, D., Singh, L., Mann, J.: A process-centric data mining and visual analytic tool for exploring complex social networks. In: IDEA (2013)","DOI":"10.1145\/2501511.2501519"},{"key":"5_CR13","unstructured":"Fortin, S.: The graph isomorphism problem. Technical Report TR96-20, Department of Computer Science, University of Alberta (1996)"},{"key":"5_CR14","unstructured":"G\u00fcting, R.H.: GraphDB: modeling and querying graphs in databases. In: VLDB (1994)"},{"key":"5_CR15","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":"5_CR16","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":"5_CR17","doi-asserted-by":"publisher","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. 4(9), 551\u2013562 (2011)","journal-title":"Proc. VLDB Endow."},{"key":"5_CR18","volume-title":"Managing and Mining Uncertain Data","author":"C Koch","year":"2009","unstructured":"Koch, C.: MayBMS: a system for managing large uncertain and probabilistic databases. In: Aggarwal, C.C. (ed.) Managing and Mining Uncertain Data. Springer, New York (2009)"},{"issue":"12","key":"5_CR19","doi-asserted-by":"publisher","first-page":"e3868","DOI":"10.1371\/journal.pone.0003868","volume":"3","author":"J Mann","year":"2008","unstructured":"Mann, J., Sargeant, B.L., Watson-Capps, J.J., Gibson, Q.A., Heithaus, M.R., Connor, R.C., Patterson, E.: Why do dolphins carry sponges? PLoS ONE 3(12), e3868 (2008)","journal-title":"PLoS ONE"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Mann, J., Stanton, M., Patterson, E., Bienestock, E., Singh, L.: Social networks reveal cultural behaviour in tool using dolphins. Nature Commun. 3 (2012). http:\/\/www.nature.com\/ncomms\/journal\/v3\/n7\/full\/ncomms1983.html","DOI":"10.1038\/ncomms1983"},{"key":"5_CR21","unstructured":"Mann, J., Shark Bay Research Team: Shark bay dolphin project (2011). http:\/\/www.monkeymiadolphins.org"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Moustafa, W.E., Kimmig, A., Deshpande, A., Getoor, L.: Subgraph pattern matching over uncertain graphs with identity linkage uncertainty. CoRR, abs\/1305.7006 (2013)","DOI":"10.1109\/ICDE.2014.6816710"},{"key":"5_CR23","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":"5_CR24","doi-asserted-by":"publisher","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. 3, 997\u20131008 (2010)","journal-title":"Proc. VLDB Endow."},{"key":"5_CR25","unstructured":"Prud\u2019hommeaux, E., Seaborne, A.: SPARQL query language for RDF. W3C recommendation 15 (2008)"},{"key":"5_CR26","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 40, 99\u2013121 (2000)","journal-title":"Int. J. Comput. Vision"},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1007\/s00778-009-0153-2","volume":"18","author":"P Sen","year":"2009","unstructured":"Sen, P., Deshpande, A., Getoor, L.: Prdb: managing and exploiting rich correlations in probabilistic databases. VLDB J. 18, 1065\u20131090 (2009). Special issue on uncertain and probabilistic databases","journal-title":"VLDB J."},{"issue":"3","key":"5_CR28","first-page":"93","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 Mag. 29(3), 93\u2013106 (2008)","journal-title":"AI Mag."},{"key":"5_CR29","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":"5_CR30","doi-asserted-by":"crossref","unstructured":"Shasha, D., Wang, J.T.L., Giugno, R.: Algorithmics and applications of tree and graph searching. In: PODS (2002)","DOI":"10.1145\/543613.543620"},{"key":"5_CR31","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":"5_CR32","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. ACM (2008)","DOI":"10.1145\/1376616.1376744"},{"key":"5_CR33","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1111\/j.1439-0310.1997.tb00160.x","volume":"103","author":"RA Smolker","year":"1997","unstructured":"Smolker, R.A., Richards, A.F., Connor, R.C., Mann, J., Berggren, P.: Sponge-carrying by Indian Ocean bottlenose dolphins: possible tool-use by a delphinid. Ethology 103, 454\u2013465 (1997)","journal-title":"Ethology"},{"key":"5_CR34","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis: Methods and Applications","author":"S Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)"},{"key":"5_CR35","volume-title":"Managing and Mining Uncertain Data","author":"J Widom","year":"2009","unstructured":"Widom, J.: Trio: a system for data, uncertainty, and lineage. In: Aggarwal, C.C. (ed.) Managing and Mining Uncertain Data. Springer, New York (2009)"},{"key":"5_CR36","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. 5981, pp. 155\u2013170. Springer, Heidelberg (2010)"},{"issue":"9","key":"5_CR37","first-page":"800","volume":"5","author":"Y Yuan","year":"2012","unstructured":"Yuan, Y., Wang, G., Chen, L., Wang, H.: Efficient subgraph similarity search on large probabilistic graph databases. PVLDB 5(9), 800\u2013811 (2012)","journal-title":"PVLDB"},{"issue":"12","key":"5_CR38","doi-asserted-by":"publisher","first-page":"2767","DOI":"10.1109\/TKDE.2012.222","volume":"25","author":"Y Yuan","year":"2013","unstructured":"Yuan, Y., Wang, G., Chen, L., Wang, H.: Efficient keyword search on uncertain graph data. IEEE Trans. Knowl. Data Eng. 25(12), 2767\u20132779 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"5_CR39","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":"5_CR40","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":"5_CR41","doi-asserted-by":"crossref","unstructured":"Zou, Z., Gao, H., Li, J.: Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2010, pp. 633\u2013642. ACM, New York (2010)","DOI":"10.1145\/1835804.1835885"},{"key":"5_CR42","doi-asserted-by":"crossref","unstructured":"Zou, Z., Li, J., Gao, H., Zhang, S.: Finding top-k maximal cliques in an uncertain graph. In: ICDE (2010)","DOI":"10.1109\/ICDE.2010.5447891"}],"container-title":["Lecture Notes in Computer Science","Transactions on Large-Scale Data- and Knowledge-Centered Systems XVIII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46485-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T22:49:32Z","timestamp":1676933372000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-46485-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662464847","9783662464854"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46485-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"22 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}