{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T01:42:16Z","timestamp":1707788536227},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,5,31]],"date-time":"2018-05-31T00:00:00Z","timestamp":1527724800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Datenbank Spektrum"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s13222-018-0286-9","type":"journal-article","created":{"date-parts":[[2018,5,31]],"date-time":"2018-05-31T04:22:41Z","timestamp":1527740561000},"page":"89-98","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Using Queries as Schema-Templates for Graph Databases"],"prefix":"10.1007","volume":"18","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":[[2018,5,31]]},"reference":[{"issue":"4","key":"286_CR1","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s00778-015-0389-y","volume":"24","author":"Z Abedjan","year":"2015","unstructured":"Abedjan Z, Golab L, Naumann F (2015) Profiling relational data: a survey. Vldb\u00a0J 24(4):557\u2013581","journal-title":"Vldb J"},{"key":"286_CR2","volume-title":"Data on the web: from relations to semistructured data and XML","author":"S Abiteboul","year":"1999","unstructured":"Abiteboul S, Buneman P, Suciu D (1999) Data on the web: from relations to semistructured data and XML. Morgan Kaufmann, Burlington"},{"key":"286_CR3","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/11431053_24","volume-title":"ESWC 2005, LNCS","author":"R Angles","year":"2005","unstructured":"Angles R, Gutierrez C (2005) Querying RDF data from a graph database perspective. In: G\u00f3mez-P\u00e9rez A, Euzenat J (eds) ESWC 2005, LNCS. Springer, Berlin, Heidelberg, pp\u00a0346\u2013360 \n                    https:\/\/doi.org\/10.1007\/11431053_24"},{"issue":"5","key":"286_CR4","doi-asserted-by":"publisher","first-page":"68:1","DOI":"10.1145\/3104031","volume":"50","author":"R Angles","year":"2017","unstructured":"Angles R, Arenas M, Barcel\u00f3 P, Hogan A, Reutter J, Vrgo\u010d D (2017) Foundations of modern query languages for graph databases. Acm Comput Surv 50(5):68:1\u201368:40. \n                    https:\/\/doi.org\/10.1145\/3104031","journal-title":"Acm Comput Surv"},{"issue":"3","key":"286_CR5","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"SD Brookes","year":"1984","unstructured":"Brookes SD, Hoare CAR, Roscoe AW (1984) A theory of communicating sequential processes. JACM 31(3):560\u2013599. \n                    https:\/\/doi.org\/10.1145\/828.833","journal-title":"JACM"},{"key":"286_CR6","series-title":"ASONAM 2010","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/ASONAM.2010.52","volume-title":"Detecting social positions using simulation","author":"J Brynielsson","year":"2010","unstructured":"Brynielsson J, H\u00f6gberg J, Kaati L, M\u00e5rtenson C, Svenson P (2010) Detecting social positions using simulation. ASONAM 2010, pp\u00a048\u201355 \n                    https:\/\/doi.org\/10.1109\/ASONAM.2010.52"},{"issue":"1","key":"286_CR7","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/320434.320440","volume":"1","author":"PPS Chen","year":"1976","unstructured":"Chen PPS (1976) The entity-relationship model \u2013 toward a unified view of data. ACM Trans Database Syst 1(1):9\u201336. \n                    https:\/\/doi.org\/10.1145\/320434.320440","journal-title":"ACM Trans. Database Syst."},{"key":"286_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/800157.805047","volume-title":"The complexity of theorem-proving procedures","author":"SA Cook","year":"1971","unstructured":"Cook SA (1971) The complexity of theorem-proving procedures. Proceedings of the Third Annual ACM Symposium on Theory of Computing, STOC \u201971. ACM, New York, pp\u00a0151\u2013158 \n                    https:\/\/doi.org\/10.1145\/800157.805047"},{"key":"286_CR9","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/2623330.2623623","volume-title":"Knowledge vault: a web-scale approach to probabilistic knowledge fusion","author":"X Dong","year":"2014","unstructured":"Dong X, Gabrilovich E, Heitz G, Horn W, Lao N, Murphy K, Strohmann T, Sun S, Zhang W (2014) Knowledge vault: a web-scale approach to probabilistic knowledge fusion. Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201914. ACM, New York, pp\u00a0601\u2013610 \n                    https:\/\/doi.org\/10.1145\/2623330.2623623"},{"key":"286_CR10","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/2274576.2274578","volume-title":"Graph pattern matching revised for social network analysis","author":"W Fan","year":"2012","unstructured":"Fan W (2012) Graph pattern matching revised for social network analysis. ICDT 2012. ACM, New York, pp\u00a08\u201321 \n                    https:\/\/doi.org\/10.1145\/2274576.2274578"},{"issue":"1","key":"286_CR11","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 (2010) Graph pattern matching: from intractable to polynomial time. PVDLB Endow 3(1):264\u2013275. \n                    https:\/\/doi.org\/10.14778\/1920841.1920878","journal-title":"PVDLB Endow."},{"key":"286_CR12","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1145\/3018661.3018739","volume-title":"Predicting completeness in knowledge bases","author":"L Gal\u00e1rraga","year":"2017","unstructured":"Gal\u00e1rraga L, Razniewski S, Amarilli A, Suchanek FM (2017) Predicting completeness in knowledge bases. Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, WSDM \u201917. ACM, New York, pp\u00a0375\u2013383 \n                    https:\/\/doi.org\/10.1145\/3018661.3018739"},{"key":"286_CR13","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/BFb0039066","volume-title":"CONCUR 1990","author":"RJ Glabbeek van","year":"1990","unstructured":"van Glabbeek RJ (1990) The linear time - branching time spectrum. In: Baeten JCM, Klop JW (eds) CONCUR 1990. Springer, Berlin, Heidelberg, pp\u00a0278\u2013297 \n                    https:\/\/doi.org\/10.1007\/BFb0039066"},{"key":"286_CR14","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/3-540-51486-4_71","volume-title":"Mathematical foundations of computer science 1989","author":"R Glabbeek van","year":"1989","unstructured":"van Glabbeek R, Goltz U (1989) Equivalence notions for concurrent systems and refinement of actions. In: Kreczmar A, Mirkowska G (eds) Mathematical foundations of computer science 1989. Springer, Berlin, Heidelberg, pp\u00a0237\u2013248"},{"key":"286_CR15","first-page":"241","volume-title":"Sparql beyond subgraph matching","author":"B Glimm","year":"2010","unstructured":"Glimm B, Kr\u00f6tzsch M (2010) Sparql beyond subgraph matching. The Semantic Web \u2013 ISWC 2010. Springer, Berlin, Heidelberg, pp\u00a0241\u2013256"},{"issue":"1","key":"286_CR16","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","volume":"48","author":"P Hell","year":"1990","unstructured":"Hell P, Ne\u0161et\u0159il J (1990) On the complexity of h\u2011coloring. J Comb Theory Ser B 48(1):92\u2013110. \n                    https:\/\/doi.org\/10.1016\/0095-8956(90)90132-J","journal-title":"J. Comb. Theory Ser. B."},{"key":"286_CR17","doi-asserted-by":"publisher","unstructured":"Henzinger M, Henzinger T, Kopke P (1995) Computing simulations on finite and infinite graphs. In: FOCS 1995. IEEE Computer Society, pp\u00a0453\u2013462 \n                    https:\/\/doi.org\/10.1109\/SFCS.1995.492576","DOI":"10.1109\/SFCS.1995.492576"},{"key":"286_CR18","series-title":"Database systems for advanced applications","first-page":"493","volume-title":"A chip off the old block - extracting typical attributes for entities based on family resemblance","author":"S Homoceanu","year":"2015","unstructured":"Homoceanu S, Balke WT (2015) A chip off the old block - extracting typical attributes for entities based on family resemblance. Database systems for advanced applications. Springer, Cham, pp\u00a0493\u2013509"},{"key":"286_CR19","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-642-41335-3_12","volume-title":"Proswip: property-based data access for semantic web interactive programming","author":"S Homoceanu","year":"2013","unstructured":"Homoceanu S, Wille P, Balke WT (2013) Proswip: property-based data access for semantic web interactive programming. Proceedings of the 12th International Semantic Web Conference - Part I, ISWC \u201913. Springer, New York, pp\u00a0184\u2013199 \n                    https:\/\/doi.org\/10.1007\/978-3-642-41335-3_12"},{"issue":"2","key":"286_CR20","doi-asserted-by":"publisher","first-page":"133","DOI":"10.14778\/2535568.2448946","volume":"6","author":"J Lee","year":"2012","unstructured":"Lee J, Han WS, Kasperovics R, Lee JH (2012) An in-depth comparison of subgraph isomorphism algorithms in graph databases. PVLDB Endow 6(2):133\u2013144. \n                    https:\/\/doi.org\/10.14778\/2535568.2448946","journal-title":"PVLDB Endow."},{"issue":"4","key":"286_CR21","doi-asserted-by":"publisher","first-page":"310","DOI":"10.14778\/2095686.2095690","volume":"5","author":"S Ma","year":"2011","unstructured":"Ma S, Cao Y, Fan W, Huai J, Wo T (2011) Capturing topology in graph pattern matching. PVLDB Endow 5(4):310\u2013321. \n                    https:\/\/doi.org\/10.14778\/2095686.2095690","journal-title":"PVLDB Endow."},{"issue":"1","key":"286_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2528937","volume":"39","author":"S Ma","year":"2014","unstructured":"Ma S, Cao Y, Fan W, Huai J, Wo T (2014) Strong simulation: capturing topology in graph pattern matching. Acm Trans Database Syst 39(1):1\u20134. \n                    https:\/\/doi.org\/10.1145\/2528937","journal-title":"Acm Trans Database Syst"},{"key":"286_CR23","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-319-69904-2_11","volume-title":"Querying graph databases: what do graph patterns mean?","author":"S Mennicke","year":"2017","unstructured":"Mennicke S, Kalo JC, Balke WT (2017) Querying graph databases: what do graph patterns mean? Springer, Cham, pp\u00a0134\u2013148 \n                    https:\/\/doi.org\/10.1007\/978-3-319-69904-2_11"},{"key":"286_CR24","first-page":"481","volume-title":"An algebraic definition of simulation between programs","author":"R Milner","year":"1971","unstructured":"Milner R (1971) An algebraic definition of simulation between programs. Proceedings of the 2Nd International Joint Conference on Artificial Intelligence, IJCAI\u201971. Morgan Kaufmann Publishers, San Francisco, pp\u00a0481\u2013489"},{"issue":"6","key":"286_CR25","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 (2016) Exemplar queries: a new way of searching. VLDB J 25(6):741\u2013765. \n                    https:\/\/doi.org\/10.1007\/s00778-016-0429-2","journal-title":"VLDB J."},{"issue":"5","key":"286_CR26","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1109\/TKDE.2008.205","volume":"21","author":"LD Nardo","year":"2009","unstructured":"Nardo LD, Ranzato F, Tapparo F (2009) The subgraph similarity problem. IEEE Trans Knowl Data Eng 21(5):748\u2013749. \n                    https:\/\/doi.org\/10.1109\/TKDE.2008.205","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"286_CR27","doi-asserted-by":"publisher","first-page":"16:1","DOI":"10.1145\/1567274.1567278","volume":"34","author":"J P\u00e9rez","year":"2009","unstructured":"P\u00e9rez J, Arenas M, Gutierrez C (2009) Semantics and complexity of sparql. Acm Trans Database Syst 34(3):16:1\u201316:45. \n                    https:\/\/doi.org\/10.1145\/1567274.1567278","journal-title":"Acm Trans Database Syst"},{"key":"286_CR28","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-32885-5_26","volume-title":"Business process management","author":"A Polyvyanyy","year":"2012","unstructured":"Polyvyanyy A, Weidlich M, Weske M (2012) Isotactics as a foundation for alignment and abstraction of behavioral models. In: Barros A, Gal A, Kindler E (eds) Business process management. Springer, Berlin, Heidelberg, pp\u00a0335\u2013351"},{"key":"286_CR29","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/800070.802186","volume-title":"The complexity of relational query languages (extended abstract)","author":"MY Vardi","year":"1982","unstructured":"Vardi MY (1982) The complexity of relational query languages (extended abstract). Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, STOC \u201982. ACM, New York, pp\u00a0137\u2013146 \n                    https:\/\/doi.org\/10.1145\/800070.802186"}],"container-title":["Datenbank-Spektrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13222-018-0286-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13222-018-0286-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13222-018-0286-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T21:40:42Z","timestamp":1559252442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13222-018-0286-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,31]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["286"],"URL":"https:\/\/doi.org\/10.1007\/s13222-018-0286-9","relation":{},"ISSN":["1618-2162","1610-1995"],"issn-type":[{"value":"1618-2162","type":"print"},{"value":"1610-1995","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,31]]},"assertion":[{"value":"1 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}