{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:17:24Z","timestamp":1762460244027,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030789459"},{"type":"electronic","value":"9783030789466"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-78946-6_8","type":"book-chapter","created":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T06:02:53Z","timestamp":1623909773000},"page":"145-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Host-Graph-Sensitive RETE Nets for Incremental 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":[[2021,6,18]]},"reference":[{"key":"8_CR1","unstructured":"EMF: Eclipse Modeling Framework. https:\/\/www.eclipse.org\/modeling\/emf\/. Accessed 7 May 2021"},{"key":"8_CR2","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":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-16145-2_6","volume-title":"Model Driven Engineering Languages and Systems","author":"G Bergmann","year":"2010","unstructured":"Bergmann, G., et al.: Incremental evaluation of model queries over EMF models. In: Petriu, D.C., Rouquette, N., Haugen, \u00d8. (eds.) MODELS 2010. LNCS, vol. 6394, pp. 76\u201390. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16145-2_6"},{"key":"8_CR4","unstructured":"Beyhl, T.: A framework for incremental view graph maintenance. Ph.D. thesis, Hasso Plattner Institute at the University of Potsdam (2018)"},{"key":"8_CR5","doi-asserted-by":"crossref","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)","DOI":"10.1145\/2882903.2915236"},{"issue":"6","key":"8_CR6","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"8_CR7","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. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-31188-2"},{"key":"8_CR8","doi-asserted-by":"crossref","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)","DOI":"10.1145\/2723372.2742786"},{"issue":"6","key":"8_CR9","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)","journal-title":"Commun. ACM"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Forgy, C.L.: Rete: A fast algorithm for the many pattern\/many object pattern match problem. In: Readings in Artificial Intelligence and Databases, pp. 547\u2013559. Elsevier (1989)","DOI":"10.1016\/B978-0-934613-53-8.50041-8"},{"key":"8_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":"8_CR12","doi-asserted-by":"crossref","unstructured":"Han, W.S., Lee, J., Lee, J.H.: Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp. 337\u2013348 (2013)","DOI":"10.1145\/2463676.2465300"},{"issue":"2","key":"8_CR13","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1109\/69.991716","volume":"14","author":"EN Hanson","year":"2002","unstructured":"Hanson, E.N., Bodagala, S., Chadaga, U.: Trigger condition testing and view maintenance using optimized discrimination networks. IEEE Trans. Knowl. Data Eng. 14(2), 261\u2013280 (2002)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"8_CR14","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.: On the complexity of H-coloring. J. Comb. Theory. Ser. B 48(1), 92\u2013110 (1990)","journal-title":"J. Comb. Theory. Ser. B"},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1145\/1270.1498","volume":"9","author":"T Ibaraki","year":"1984","unstructured":"Ibaraki, T., Kameda, T.: On the optimal nesting order for computing n-relational joins. ACM Trans. Database Syst. (TODS) 9(3), 482\u2013502 (1984)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"204","DOI":"10.14778\/2850583.2850594","volume":"9","author":"V Leis","year":"2015","unstructured":"Leis, V., Gubichev, A., Mirchev, A., Boncz, P., Kemper, A., Neumann, T.: How good are query optimizers, really? Proc. VLDB Endow. 9(3), 204\u2013215 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. III. Planar tree-width. J. Comb. Theory. Ser. B 36(1), 49\u201364 (1984)","DOI":"10.1016\/0095-8956(84)90013-3"},{"issue":"4","key":"8_CR18","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1007\/s10270-016-0571-8","volume":"17","author":"G Sz\u00e1rnyas","year":"2017","unstructured":"Sz\u00e1rnyas, G., Izs\u00f3, B., R\u00e1th, I., Varr\u00f3, D.: The train benchmark: cross-technology performance evaluation of continuous model queries. Softw. Syst. Model. 17(4), 1365\u20131393 (2017). https:\/\/doi.org\/10.1007\/s10270-016-0571-8","journal-title":"Softw. Syst. Model."},{"issue":"2","key":"8_CR19","doi-asserted-by":"publisher","first-page":"175","DOI":"10.3311\/PPee.9769","volume":"61","author":"G Sz\u00e1rnyas","year":"2017","unstructured":"Sz\u00e1rnyas, G., Maginecz, J., Varr\u00f3, D.: Evaluation of optimization strategies for incremental graph queries. Periodica Polytechnica Electr. Eng. Comput. Sci. 61(2), 175\u2013192 (2017)","journal-title":"Periodica Polytechnica Electr. Eng. Comput. Sci."},{"issue":"3","key":"8_CR20","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":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-38883-5_13","volume-title":"Theory and Practice of Model Transformations","author":"G Varr\u00f3","year":"2013","unstructured":"Varr\u00f3, G., Deckwerth, F.: A rete network construction algorithm for incremental pattern matching. In: Duddy, K., Kappel, G. (eds.) ICMT 2013. LNCS, vol. 7909, pp. 125\u2013140. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38883-5_13"},{"key":"8_CR22","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"}],"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-78946-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T23:31:31Z","timestamp":1624318291000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78946-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030789459","9783030789466"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78946-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"18 June 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2021","order":10,"name":"conference_id","label":"Conference ID","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":"26","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":"14","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":"54% - 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":"3","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)"}},{"value":"In addition, the proceedings contain 2 tool papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}