{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:08:51Z","timestamp":1762459731005,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030236106"},{"type":"electronic","value":"9783030236113"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-23611-3_13","type":"book-chapter","created":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T01:04:09Z","timestamp":1561943049000},"page":"212-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Hybrid Search Plan Generation for Generalized Graph Pattern Matching"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Barkowsky","sequence":"first","affiliation":[]},{"given":"Holger","family":"Giese","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"13_CR1","unstructured":"EMF: Eclipse Modeling Framework. https:\/\/www.eclipse.org\/modeling\/emf\/. Accessed 7 May 2019"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Angles, R.: A comparison of current graph database models. In: 2012 IEEE 28th International Conference on Data Engineering Workshops, pp. 171\u2013177. IEEE (2012). https:\/\/doi.org\/10.1109\/ICDEW.2012.31","DOI":"10.1109\/ICDEW.2012.31"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-16145-2_9","volume-title":"Model Driven Engineering Languages and Systems","author":"T Arendt","year":"2010","unstructured":"Arendt, T., Biermann, E., Jurack, S., Krause, C., Taentzer, G.: Henshin: advanced concepts and tools for in-place EMF model transformations. In: Petriu, D.C., Rouquette, N., Haugen, \u00d8. (eds.) MODELS 2010. LNCS, vol. 6394, pp. 121\u2013135. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16145-2_9"},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Bak, C., Plump, D.: Rooted graph programs. In: Proceedings of International Workshop on Graph-Based Tools (GraBaTs 2012), vol. 54 (2012). https:\/\/doi.org\/10.14279\/tuj.eceasst.54.780","DOI":"10.14279\/tuj.eceasst.54.780"},{"key":"13_CR5","unstructured":"Barkowsky, M.: Tight integration of indices into graph query execution. Master\u2019s thesis, Hasso Plattner Institute for Digital Engineering (2018)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-319-40530-8_11","volume-title":"Graph Transformation","author":"T Beyhl","year":"2016","unstructured":"Beyhl, T., Blouin, D., Giese, H., Lambers, L.: On the operationalization of graph queries with generalized discrimination networks. In: Echahed, R., Minas, M. (eds.) ICGT 2016. LNCS, vol. 9761, pp. 170\u2013186. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40530-8_11"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Bi, F., Chang, L., Lin, X., Qin, L., Zhang, W.: Efficient subgraph matching by postponing Cartesian products. In: Proceedings of the 2016 International Conference on Management of Data, pp. 1199\u20131214. ACM (2016). https:\/\/doi.org\/10.1145\/2882903.2915236","DOI":"10.1145\/2882903.2915236"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-319-21145-9_18","volume-title":"Graph Transformation","author":"M B\u00far","year":"2015","unstructured":"B\u00far, M., Ujhelyi, Z., Horv\u00e1th, \u00c1., Varr\u00f3, D.: Local search-based pattern matching features in EMF-IncQuery. In: Parisi-Presicce, F., Westfechtel, B. (eds.) ICGT 2015. LNCS, vol. 9151, pp. 275\u2013282. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21145-9_18"},{"key":"13_CR9","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31188-2","volume-title":"Fundamentals of Algebraic Graph Transformation","author":"H Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. MTCSAES. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-31188-2"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Erling, O., et al.: The LDBC social network benchmark: interactive workload. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 619\u2013630. ACM (2015). https:\/\/doi.org\/10.1145\/2723372.2742786","DOI":"10.1145\/2723372.2742786"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/11841883_27","volume-title":"Graph Transformations","author":"R Gei\u00df","year":"2006","unstructured":"Gei\u00df, R., Batz, G.V., Grund, D., Hack, S., Szalkowski, A.: GrGen: a fast SPO-based graph rewriting tool. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 383\u2013397. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11841883_27"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Giese, H., Hildebrandt, S., Seibel, A.: Improved flexibility and scalability by interpreting story diagrams. Electron. Commun. EASST 18 (2009). https:\/\/doi.org\/10.14279\/tuj.eceasst.18.268","DOI":"10.14279\/tuj.eceasst.18.268"},{"issue":"3","key":"13_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"RM Haralick","year":"1980","unstructured":"Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artif. Intell. 14(3), 263\u2013313 (1980). https:\/\/doi.org\/10.1016\/0004-3702(80)90051-X","journal-title":"Artif. Intell."},{"key":"13_CR14","unstructured":"Hildebrandt, S.: On the performance and conformance of triple graph grammar implementations. Ph.D. thesis, Hasso Plattner Institute at the University of Potsdam, June 2014"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Horv\u00e1th, \u00c1., Varr\u00f3, G., Varr\u00f3, D.: Generic search plans for matching advanced graph patterns. Electron. Commun. EASST 6 (2007). https:\/\/doi.org\/10.14279\/tuj.eceasst.6.49","DOI":"10.14279\/tuj.eceasst.6.49"},{"issue":"3","key":"13_CR16","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/s10270-016-0530-4","volume":"15","author":"D Varr\u00f3","year":"2016","unstructured":"Varr\u00f3, D., Bergmann, G., Heged\u00fcs, \u00c1., Horv\u00e1th, \u00c1., R\u00e1th, I., Ujhelyi, Z.: Road to a reactive and incremental model transformation platform: three generations of the VIATRA framework. Softw. Syst. Model. 15(3), 609\u2013629 (2016). https:\/\/doi.org\/10.1007\/s10270-016-0530-4","journal-title":"Softw. Syst. Model."},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-30476-7_15","volume-title":"Theory and Practice of Model Transformations","author":"G Varr\u00f3","year":"2012","unstructured":"Varr\u00f3, G., Deckwerth, F., Wieber, M., Sch\u00fcrr, A.: An algorithm for generating model-sensitive search plans for EMF models. In: Hu, Z., de Lara, J. (eds.) ICMT 2012. LNCS, vol. 7307, pp. 224\u2013239. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30476-7_15"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/3-540-61228-9_105","volume-title":"Graph Grammars and Their Application to Computer Science","author":"A Z\u00fcndorf","year":"1996","unstructured":"Z\u00fcndorf, A.: Graph pattern matching in PROGRES. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol. 1073, pp. 454\u2013468. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61228-9_105"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23611-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:22:40Z","timestamp":1709810560000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-23611-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030236106","9783030236113"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23611-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"25 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Graph Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Eindhoven","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/site\/icgt2019\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}