{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:40Z","timestamp":1725663280688},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540102915"},{"type":"electronic","value":"9783540384359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10291-4_15","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:09:12Z","timestamp":1330189752000},"page":"212-233","source":"Crossref","is-referenced-by-count":1,"title":["Graph algorithms for the synthesis and manipulation of data base schemes"],"prefix":"10.1007","author":[{"given":"G.","family":"Ausiello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"D'Atri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Sacca'","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"15_CR1","unstructured":"W.W. ARMSTRONG, \"Dependency Structures on Database Relationships\"; Proc. IFIP 74, North Holland (1974)."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"C. BATINI, A. D'ATRI, \"Rewriting Systems as a tool for Relational Database Design\", Graph Grammars and their application to Comp. Sc. and Biology, Lecture Notes in Comp. Sc., Springer Verlag, vol. 73, (1979)","DOI":"10.1007\/BFb0025717"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"C. BEERI, P.A. BERNSTEIN, \"Computational Problems Related to the Design of Normal Form Relational Schemes\", ACM Trans. on Database Sys., vol. 4, n.1, (1979).","DOI":"10.1145\/320064.320066"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"J. BISKUP, U.DAYAL, P.A. BERNSTEIN, \"Synthesizing Independent Database Schemas\", Proc. ACM SIGMOD, (1979).","DOI":"10.1145\/582095.582118"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"E.F. CODD, \"A Relational Model of Data for Large Shared Data Banks\", C. ACM, vol. 13, n.6, (1970).","DOI":"10.1145\/362384.362685"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"H.T. HSU, \"An Algorithm for Finding a Minimal Equivalent Graph of a Diagraph\", J. ACM, vol.22, n.1, (1975).","DOI":"10.1145\/321864.321866"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"D.M. MOYLES, G.L. THOMPSON, \"An Algorithm for Finding a Minimum Equivalent Graph of a Diagraph\", J. ACM, vol. 16, n.3, (1969).","DOI":"10.1145\/321526.321534"}],"container-title":["Lecture Notes in Computer Science","Graphtheoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10291-4_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:02:55Z","timestamp":1605643375000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10291-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540102915","9783540384359"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-10291-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}