{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:12:35Z","timestamp":1742922755295,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319699035"},{"type":"electronic","value":"9783319699042"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-69904-2_11","type":"book-chapter","created":{"date-parts":[[2017,10,20]],"date-time":"2017-10-20T05:18:33Z","timestamp":1508476713000},"page":"134-148","source":"Crossref","is-referenced-by-count":5,"title":["Querying Graph Databases: What Do Graph Patterns Mean?"],"prefix":"10.1007","author":[{"given":"Stephan","family":"Mennicke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan-Christoph","family":"Kalo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolf-Tilo","family":"Balke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,21]]},"reference":[{"key":"11_CR1","unstructured":"Abriola, S., Barcei\u00f3, P., Figueira, D., Figueira, S.: Bisimulations on data graphs. In: KR 2016, pp. 309\u2013318. AAAI Press (2016)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/11431053_24","volume-title":"The Semantic Web: Research and Applications","author":"R Angles","year":"2005","unstructured":"Angles, R., Gutierrez, C.: Querying RDF data from a graph database perspective. In: G\u00f3mez-P\u00e9rez, A., Euzenat, J. (eds.) ESWC 2005. LNCS, vol. 3532, pp. 346\u2013360. Springer, Heidelberg (2005). doi: 10.1007\/11431053_24"},{"issue":"3","key":"11_CR3","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"SD Brookes","year":"1984","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J. ACM 31(3), 560\u2013599 (1984)","journal-title":"J. ACM"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Brynielsson, J., H\u00f6gberg, J., Kaati, L., M\u00e5rtenson, C., Svenson, P.: Detecting social positions using simulation. In: ASONAM 2010, pp. 48\u201355 (2010)","DOI":"10.1109\/ASONAM.2010.52"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Fan, W.: Graph pattern matching revised for social network analysis. In: ICDT 2012, pp. 8\u201321. ACM, New York (2012)","DOI":"10.1145\/2274576.2274578"},{"issue":"1\u20132","key":"11_CR6","doi-asserted-by":"publisher","first-page":"264","DOI":"10.14778\/1920841.1920878","volume":"3","author":"W Fan","year":"2010","unstructured":"Fan, W., Li, J., Ma, S., Tang, N., Wu, Y., Wu, Y.: Graph pattern matching: from intractable to polynomial time. PVLDB Endow. 3(1\u20132), 264\u2013275 (2010)","journal-title":"PVLDB Endow."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Gallagher, B.: Matching structure and semantics: a survey on graph-based pattern matching. In: Papers from the AAAI FS 2006, pp. 45\u201353 (2006)","DOI":"10.2172\/895418"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/BFb0039066","volume-title":"CONCUR \u201990 Theories of Concurrency: Unification and Extension","author":"RJ Glabbeek van","year":"1990","unstructured":"van Glabbeek, R.J.: The linear time - branching time spectrum. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 278\u2013297. Springer, Heidelberg (1990). doi: 10.1007\/BFb0039066"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Henzinger, M., Henzinger, T., Kopke, P.: Computing simulations on finite and infinite graphs. In: FOCS 1995, pp. 453\u2013462. IEEE Computer Society (1995)","DOI":"10.1109\/SFCS.1995.492576"},{"issue":"4","key":"11_CR10","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1145\/1634.1886","volume":"31","author":"T Imielinski","year":"1984","unstructured":"Imielinski, T., Lipski Jr., W.: Incomplete information in relational databases. J. ACM 31(4), 761\u2013791 (1984)","journal-title":"J. ACM"},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"181","DOI":"10.14778\/2535569.2448952","volume":"6","author":"A Khan","year":"2013","unstructured":"Khan, A., Wu, Y., Aggarwal, C.C., Yan, X.: NeMa: fast graph search with label similarity. PVLDB Endow. 6(3), 181\u2013192 (2013)","journal-title":"PVLDB Endow."},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"133","DOI":"10.14778\/2535568.2448946","volume":"6","author":"J Lee","year":"2012","unstructured":"Lee, J., Han, W.S., Kasperovics, R., Lee, J.H.: An in-depth comparison of subgraph isomorphism algorithms in graph databases. PVLDB Endow. 6(2), 133\u2013144 (2012)","journal-title":"PVLDB Endow."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Libkin, L., Martens, W., Vrgo\u010d, D.: Querying graph databases with XPath. In: ICDT 2013, pp. 129\u2013140. ACM, New York (2013)","DOI":"10.1145\/2448496.2448513"},{"issue":"2","key":"11_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2850413","volume":"63","author":"Leonid Libkin","year":"2016","unstructured":"Libkin, L., Martens, W., Vrgo\u010d, D.: Querying graphs with data. J. ACM 63(2), 14:1\u201314:53 (2016)","journal-title":"Journal of the ACM"},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2528937","volume":"39","author":"Shuai Ma","year":"2014","unstructured":"Ma, S., Cao, Y., Fan, W., Huai, J., Wo, T.: Strong simulation: capturing topology in graph pattern matching. ACM Trans. Database Syst. 39(1), 4:1\u20134:46 (2014)","journal-title":"ACM Transactions on Database Systems"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Motik, B., Horrocks, I., Sattler, U.: Bridging the gap between OWL and relational databases. In: WWW 2007, pp. 807\u2013816. ACM, New York (2007)","DOI":"10.1145\/1242572.1242681"},{"issue":"6","key":"11_CR17","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/s00778-016-0429-2","volume":"25","author":"D Mottin","year":"2016","unstructured":"Mottin, D., Lissandrini, M., Velegrakis, Y., Palpanas, T.: Exemplar queries: a new way of searching. VLDB J. 25(6), 741\u2013765 (2016)","journal-title":"VLDB J."},{"issue":"4","key":"11_CR18","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1109\/TKDE.2014.2349924","volume":"27","author":"W Zheng","year":"2015","unstructured":"Zheng, W., Zou, L., Lian, X., Wang, D., Zhao, D.: Efficient graph similarity search over large graph databases. IEEE Trans. Knowl. Data Eng. 27(4), 964\u2013978 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"11","key":"11_CR19","doi-asserted-by":"publisher","first-page":"840","DOI":"10.14778\/2983200.2983201","volume":"9","author":"W Zheng","year":"2016","unstructured":"Zheng, W., Zou, L., Peng, W., Yan, X., Song, S., Zhao, D.: Semantic SPARQL similarity search over RDF knowledge graphs. PVLDB Endow. 9(11), 840\u2013851 (2016)","journal-title":"PVLDB Endow."}],"container-title":["Lecture Notes in Computer Science","Conceptual Modeling"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69904-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T19:08:41Z","timestamp":1570216121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69904-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319699035","9783319699042"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69904-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}