{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:44Z","timestamp":1740099644542,"version":"3.37.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030452599"},{"type":"electronic","value":"9783030452605"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-45260-5_13","type":"book-chapter","created":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T14:02:31Z","timestamp":1587477751000},"page":"211-227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Port Graph Rewriting Approach to Relational Database Modelling"],"prefix":"10.1007","author":[{"given":"Maribel","family":"Fern\u00e1ndez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4814-3273","authenticated-orcid":false,"given":"Bruno","family":"Pinaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5386-4652","authenticated-orcid":false,"given":"J\u00e1nos","family":"Varga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,22]]},"reference":[{"unstructured":"Abrial, J.: Data semantics. In: Klimbie, J.W., Koffeman, K.L. (eds.) Proceeding of the IFIP Working Conference Data Base Management, Carg\u00e8se, Corsica, France, 1\u20135 April 1974, pp. 1\u201360. North-Holland (1974)","key":"13_CR1"},{"unstructured":"Andrei, O.: Rewriting calculus for graphs: applications to biology and autonomous systems. Ph.D. thesis, Institut National Polytechnique de Lorraine, Nancy, France, November 2008","key":"13_CR2"},{"doi-asserted-by":"crossref","unstructured":"Andrei, O., Fern\u00e1ndez, M., Kirchner, H., Melan\u00e7on, G., Namet, O., Pinaud, B.: Porgy: strategy-driven interactive transformation of graphs. In: Echahed, R. (ed.) TERMGRAPH. EPTCS, vol. 48, pp. 54\u201368 (2011)","key":"13_CR3","DOI":"10.4204\/EPTCS.48.7"},{"unstructured":"Armstrong, W.W.: Dependency structures of data base relationships. In: Proceedings of IFIP Congress, Information processing, vol. 74, pp. 580\u2013583, North-Holland, Amsterdam (1974)","key":"13_CR4"},{"issue":"4","key":"13_CR5","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1145\/2157.322404","volume":"30","author":"G Ausiello","year":"1983","unstructured":"Ausiello, G., D\u2019Atri, A., Sacc\u00e0, D.: Graph algorithms for functional dependency manipulation. J. ACM 30(4), 752\u2013766 (1983). https:\/\/doi.org\/10.1145\/2157.322404","journal-title":"J. ACM"},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/2070736.2070750","volume":"40","author":"A Badia","year":"2011","unstructured":"Badia, A., Lemire, D.: A call to arms: revisiting database design. SIGMOD Rec. 40(3), 61\u201369 (2011). https:\/\/doi.org\/10.1145\/2070736.2070750","journal-title":"SIGMOD Rec."},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BFb0025717","volume-title":"Graph-Grammars and Their Application to Computer Science and Biology","author":"C Batini","year":"1979","unstructured":"Batini, C., D\u2019Atri, A.: Rewriting systems as a tool for relational data base design. In: Claus, V., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1978. LNCS, vol. 73, pp. 139\u2013154. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/BFb0025717"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/320064.320066","volume":"4","author":"C Beeri","year":"1979","unstructured":"Beeri, C., Bernstein, P.A.: Computational problems related to the design of normal form relational schemas. ACM Trans. Database Syst. 4(1), 30\u201359 (1979)","journal-title":"ACM Trans. Database Syst."},{"doi-asserted-by":"crossref","unstructured":"Beeri, C., Fagin, R., Howard, J.H.: A complete axiomatization for functional and multivalued dependencies in database relations. In: Smith, D.C.P. (ed.) SIGMOD Conference, pp. 47\u201361. ACM (1977)","key":"13_CR9","DOI":"10.1145\/509404.509414"},{"issue":"4","key":"13_CR10","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1145\/320493.320489","volume":"1","author":"PA Bernstein","year":"1976","unstructured":"Bernstein, P.A.: Synthesizing third normal form relations from functional dependencies. ACM Trans. Database Syst. 1(4), 277\u2013298 (1976)","journal-title":"ACM Trans. Database Syst."},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S1571-0661(05)82552-6","volume":"15","author":"P Borovansk\u00fd","year":"1998","unstructured":"Borovansk\u00fd, P., Kirchner, C., Kirchner, H., Moreau, P., Ringeissen, C.: An overview of ELAN. Electr. Notes Theor. Comput. Sci. 15, 55\u201370 (1998). https:\/\/doi.org\/10.1016\/S1571-0661(05)82552-6","journal-title":"Electr. Notes Theor. Comput. Sci."},{"volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation: Applications, Languages and Tools","year":"1999","unstructured":"Ehrig, H., Engels, G., Kreowski, H., Rozenberg, G. (eds.): Handbook of Graph Grammars and Computing by Graph Transformation: Applications, Languages and Tools, vol. 2. World Scientific, River Edge (1999)","key":"13_CR12"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-15865-0_5","volume-title":"Handbook of Conceptual Modeling","author":"DW Embley","year":"2011","unstructured":"Embley, D.W., Mok, W.Y.: Mapping conceptual models to database schemas. In: Embley, D.W., Thalheim, B. (eds.) Handbook of Conceptual Modeling, vol. XIX, pp. 123\u2013164. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-15865-0_5"},{"doi-asserted-by":"publisher","unstructured":"Fern\u00e1ndez, M., Kirchner, H., Pinaud, B.: Strategic Port Graph Rewriting: an Interactive Modelling Framework. Math. Struct. Comput. Sci. 1\u201348 (2018). https:\/\/doi.org\/10.1017\/S0960129518000270 . https:\/\/hal.inria.fr\/hal-01251871","key":"13_CR14","DOI":"10.1017\/S0960129518000270"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.jlamp.2017.12.005","volume":"96","author":"M Fern\u00e1ndez","year":"2018","unstructured":"Fern\u00e1ndez, M., Kirchner, H., Pinaud, B., Vallet, J.: Labelled graph strategic rewriting for social networks. J. Log. Algebr. Meth. Program. 96, 12\u201340 (2018). https:\/\/doi.org\/10.1016\/j.jlamp.2017.12.005","journal-title":"J. Log. Algebr. Meth. Program."},{"key":"13_CR16","volume-title":"Database Systems - The Complete Book","author":"H Garcia-Molina","year":"2014","unstructured":"Garcia-Molina, H., Ullman, J.D., Widom, J.: Database Systems - The Complete Book, 2nd edn. Pearson Education, Harlow (2014)","edition":"2"},{"doi-asserted-by":"crossref","unstructured":"Jahnke, J.H., Z\u00fcndorf, A.: Applying graph transformations to database re-engineering. In: Ehrig et al., vol. 12, pp. 267\u2013286 (1999)","key":"13_CR17","DOI":"10.1142\/9789812815149_0006"},{"doi-asserted-by":"publisher","unstructured":"Jiresch, E.: Extending the interaction nets calculus by generic rules. In: Alves, S., Mackie, I. (eds.) Proceedings 2nd International Workshop on Linearity, LINEARITY 2012, Tallinn, Estonia, 1 April 2012. EPTCS, vol. 101, pp. 12\u201324 (2012). https:\/\/doi.org\/10.4204\/EPTCS.101.2","key":"13_CR18","DOI":"10.4204\/EPTCS.101.2"},{"issue":"3","key":"13_CR19","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/1144366.1144370","volume":"12","author":"KT Kalleberg","year":"2006","unstructured":"Kalleberg, K.T.: Stratego: a programming language for program manipulation. ACM Crossroads 12(3), 4 (2006). https:\/\/doi.org\/10.1145\/1144366.1144370","journal-title":"ACM Crossroads"},{"issue":"1 and 2","key":"13_CR20","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(93)90068-5","volume":"109","author":"M L\u00f6we","year":"1993","unstructured":"L\u00f6we, M.: Algebraic approach to single-pushout graph transformation. Theor. Comput. Sci. 109(1 and 2), 181\u2013224 (1993). https:\/\/doi.org\/10.1016\/0304-3975(93)90068-5","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"13_CR21","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1145\/322217.322223","volume":"27","author":"D Maier","year":"1980","unstructured":"Maier, D.: Minimum covers in relational database model. J. ACM 27(4), 664\u2013674 (1980). https:\/\/doi.org\/10.1145\/322217.322223","journal-title":"J. ACM"},{"key":"13_CR22","volume-title":"The Theory of Relational Databases","author":"D Maier","year":"1983","unstructured":"Maier, D.: The Theory of Relational Databases. Computer Science Press, Rockville (1983)"},{"doi-asserted-by":"publisher","unstructured":"Plump, D.: The design of GP 2. In: Escobar, S. (ed.) Proceedings 10th International Workshop on Reduction Strategies in Rewriting and Programming, WRS 2011, Novi Sad, Serbia, 29 May 2011. EPTCS, vol. 82, pp. 1\u201316 (2011). https:\/\/doi.org\/10.4204\/EPTCS.82.1","key":"13_CR23","DOI":"10.4204\/EPTCS.82.1"},{"issue":"2","key":"13_CR24","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1093\/comjnl\/39.2.124","volume":"39","author":"H Saiedian","year":"1996","unstructured":"Saiedian, H., Spencer, T.: An efficient algorithm to compute the candidate keys of a relational database schema. Comput. J. 39(2), 124\u2013132 (1996). https:\/\/doi.org\/10.1093\/comjnl\/39.2.124","journal-title":"Comput. J."},{"doi-asserted-by":"crossref","unstructured":"Sch\u00fcrr, A., Winter, A.J., Z\u00fcndorf, A.: The PROGRES approach: language and environment. In: Ehrig et al., vol. 12, pp. 551\u2013603 (1999)","key":"13_CR25","DOI":"10.1142\/9789812815149_0013"},{"unstructured":"Vallet, J.: Where social networks, graph rewriting and visualisation meet: application to network generation and information diffusion. Ph.D. thesis, University of Bordeaux, France (2017). https:\/\/tel.archives-ouvertes.fr\/tel-01691037","key":"13_CR26"},{"doi-asserted-by":"publisher","unstructured":"Varga, J.: Finding the transitive closure of functional dependencies using strategic port graph rewriting. In: Fern\u00e1ndez, M., Mackie, I. (eds.) Proceedings Tenth International Workshop on Computing with Terms and Graphs, Oxford, UK, 7th July 2018. Electronic Proceedings in Theoretical Computer Science, vol. 288, pp. 50\u201362. Open Publishing Association (2019). https:\/\/doi.org\/10.4204\/EPTCS.288.5","key":"13_CR27","DOI":"10.4204\/EPTCS.288.5"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45260-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T22:48:52Z","timestamp":1666392532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45260-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030452599","9783030452605"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45260-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOPSTR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logic-Based Program Synthesis and Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"8 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cs.unibo.it\/projects\/lopstr19\/","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":"32","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":"15","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":"47% - 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":"6","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}