{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:03:14Z","timestamp":1762459394077},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319405292"},{"type":"electronic","value":"9783319405308"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-40530-8_11","type":"book-chapter","created":{"date-parts":[[2016,6,23]],"date-time":"2016-06-23T02:53:01Z","timestamp":1466650381000},"page":"170-186","source":"Crossref","is-referenced-by-count":20,"title":["On the Operationalization of Graph Queries with Generalized Discrimination Networks"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Beyhl","sequence":"first","affiliation":[]},{"given":"Dominique","family":"Blouin","sequence":"additional","affiliation":[]},{"given":"Holger","family":"Giese","sequence":"additional","affiliation":[]},{"given":"Leen","family":"Lambers","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,22]]},"reference":[{"key":"11_CR1","volume-title":"Foundations of Databases: The Logical Level","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V. (eds.): Foundations of Databases: The Logical Level, 1st edn. Addison-Wesley Longman Publishing Co., Inc., Boston (1995)","edition":"1"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Angles, R.: A comparison of current graph database models. In: Proceedings of the 28th International Conference on Data Engineering, pp. 171\u2013177. IEEE (April 2012)","DOI":"10.1109\/ICDEW.2012.31"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/978-3-642-21732-6_9","volume-title":"Theory and Practice of Model Transformations","author":"B Becker","year":"2011","unstructured":"Becker, B., Lambers, L., Dyck, J., Birth, S., Giese, H.: Iterative development of consistency-preserving rule-based refactorings. In: Cabot, J., Visser, E. (eds.) ICMT 2011. LNCS, vol. 6707, pp. 123\u2013137. Springer, Heidelberg (2011)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Bergmann, G., \u00d6kr\u00f6s, A., R\u00e1th, I., Varr\u00f3, D., Varr\u00f3, G.: Incremental pattern matching in the viatra model transformation system. In: Proceedings of the 3rd International Workshop on Graph and Model Transformations, GRaMoT 2008, pp. 25\u201332. ACM (2008)","DOI":"10.1145\/1402947.1402953"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Beyhl, T., Blouin, D., Giese, H., Lambers, L.: On the Operationalization of Graph Queries with Generalized Discrimination Networks. Technical report 106, Hasso Plattner Institute at the University of Potsdam (2016)","DOI":"10.1007\/978-3-319-40530-8_11"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Beyhl, T., Giese, H.: Incremental view maintenance for deductive graph databases using generalized discrimination networks. In: Electronic Proceedings in Theoretical Computer Science, Graphs as Models 2016 (2016, to appear)","DOI":"10.4204\/EPTCS.231.5"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/BFb0017389","volume-title":"Graph Grammars and Their Application to Computer Science","author":"H Bunke","year":"1991","unstructured":"Bunke, H., Glauser, T., Tran, T.H.: An efficient implementation of graph grammars based on the RETE matching algorithm. In: Kreowski, H.-J., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1990. LNCS, vol. 532, pp. 174\u2013189. Springer, Heidelberg (1991)"},{"key":"11_CR8","unstructured":"Council, L.D.B.: LDBC Social Network Benchmark (SNB) - First Public Draft Release v0.2.2 (2015). https:\/\/github.com\/ldbc\/ldbc_snb_docs\/blob\/master\/LDBC_SNB_v0.2.2.pdf"},{"key":"11_CR9","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)"},{"issue":"1","key":"11_CR10","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0004-3702(82)90020-0","volume":"19","author":"CL Forgy","year":"1982","unstructured":"Forgy, C.L.: Rete: a fast algorithm for the many pattern\/many object pattern match problem. Artif. Intell. 19(1), 17\u201337 (1982)","journal-title":"Artif. Intell."},{"key":"11_CR11","unstructured":"Giese, H., Hildebrandt, S., Seibel, A.: Improved flexibility and scalability by interpreting story diagrams. In: Magaria, T., Padberg, J., Taentzer, G. (eds.) Proceedings of the 8th International Workshop on Graph Transformation and Visual Modeling Techniques, vol.\u00a018. Electronic Communications of the EASST (2009)"},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0960129508007202","volume":"19","author":"A Habel","year":"2009","unstructured":"Habel, A., Pennemann, K.H.: Correctness of high-level transformation systems relative to nested conditions. Math. Struct. Comput. Sci. 19, 1\u201352 (2009)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"2","key":"11_CR13","doi-asserted-by":"crossref","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. Trans. Knowl. Data Eng. 14(2), 261\u2013280 (2002)","journal-title":"Trans. Knowl. Data Eng."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"He, H., Singh, A.K.: Graphs-at-a-time: query language and access methods for graph databases. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 405\u2013418. ACM (2008)","DOI":"10.1145\/1376616.1376660"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-3-319-09108-2_3","volume-title":"Graph Transformation","author":"CM Poskitt","year":"2014","unstructured":"Poskitt, C.M., Plump, D.: Verifying monadic second-order properties of graph programs. In: Giese, H., K\u00f6nig, B. (eds.) ICGT 2014. LNCS, vol. 8571, pp. 33\u201348. Springer, Heidelberg (2014)"},{"issue":"1","key":"11_CR16","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/2206869.2206879","volume":"41","author":"PT Wood","year":"2012","unstructured":"Wood, P.T.: Query languages for graph databases. SIGMOD Rec. 41(1), 50\u201360 (2012)","journal-title":"SIGMOD Rec."}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40530-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T22:34:03Z","timestamp":1568068443000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40530-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319405292","9783319405308"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40530-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}