{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T14:23:13Z","timestamp":1762266193417,"version":"build-2065373602"},"reference-count":44,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1986,12,1]],"date-time":"1986-12-01T00:00:00Z","timestamp":533779200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1986,12,1]],"date-time":"1986-12-01T00:00:00Z","timestamp":533779200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9725,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000190","name":"University of Alberta","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000190","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003141","name":"Consejo Nacional de Ciencia y Tecnolog\u00eda","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003141","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003141","name":"Consejo Nacional de Ciencia y Tecnolog\u00eda","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003141","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1986,12]]},"DOI":"10.1016\/0304-3975(86)90012-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"67-104","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"title":["On the desirability of \u03b3-acyclic BCNF database schemes"],"prefix":"10.1016","volume":"62","author":[{"given":"Edward P.F.","family":"Chan","sequence":"first","affiliation":[]},{"given":"H\u00e9ctor J.","family":"Hern\u00e1ndez","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(86)90012-5_BIB1","series-title":"Proc. IFIP 1974","first-page":"580","article-title":"Dependency structures of data base relationships","author":"Armstrong","year":"1974"},{"issue":"3","key":"10.1016\/0304-3975(86)90012-5_BIB2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1145\/320083.320091","article-title":"The theory of joins in relational databases","volume":"4","author":"Aho","year":"1979","journal-title":"ACM TODS"},{"key":"10.1016\/0304-3975(86)90012-5_BIB3","first-page":"27","article-title":"Minimal coverings for acyclic database schemata","volume":"Vol. 2","author":"Ausiello","year":"1984"},{"key":"10.1016\/0304-3975(86)90012-5_BIB4","first-page":"181","article-title":"Efficient query answering in the representative instance approach","author":"Atzeni","year":"1985","journal-title":"Proc. ACM PODS"},{"year":"1973","series-title":"Graphs and Hypergraphs","author":"Berge","key":"10.1016\/0304-3975(86)90012-5_BIB5"},{"issue":"1","key":"10.1016\/0304-3975(86)90012-5_BIB6","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/320064.320066","article-title":"Computational problems related to the design of normal form relational schemas","volume":"4","author":"Beeri","year":"1979","journal-title":"ACM TODS"},{"key":"10.1016\/0304-3975(86)90012-5_BIB7","first-page":"126","article-title":"Fast maintenance of semantic integrity assertions using redundant aggregate data","author":"Bernstein","year":"1980","journal-title":"Proc. VLDB"},{"key":"10.1016\/0304-3975(86)90012-5_BIB8","first-page":"113","article-title":"A sophisticate introduction to database normalization theory","author":"Beeri","year":"1978","journal-title":"Proc. VLDB"},{"key":"10.1016\/0304-3975(86)90012-5_BIB9","first-page":"148","article-title":"One flavor assumption and \u03b3-acyclicity for universal relation views","author":"Biskup","year":"1986","journal-title":"Proc. PODS"},{"key":"10.1016\/0304-3975(86)90012-5_BIB10","first-page":"143","article-title":"Synthesizing independent database schemas","author":"Biskup","year":"1979","journal-title":"Proc. ACM-SIGMOD"},{"key":"10.1016\/0304-3975(86)90012-5_BIB11","first-page":"245","article-title":"What Does Boyce-Codd Normal Form Do?","author":"Bernstein","year":"1980","journal-title":"Proc. VLDB"},{"issue":"4","key":"10.1016\/0304-3975(86)90012-5_BIB12","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1145\/1634.1636","article-title":"A proof procedure for data dependencies","volume":"31","author":"Beeri","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(86)90012-5_BIB13","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1145\/971697.602280","article-title":"Optimal computation of total projections with unions of simple chase join expressions","author":"Chan","year":"1984","journal-title":"Proc. ACM-SIGMOD"},{"year":"1981","series-title":"An incremental approach to testing satisfaction of functional dependencies","author":"Chan","key":"10.1016\/0304-3975(86)90012-5_BIB14"},{"key":"10.1016\/0304-3975(86)90012-5_BIB15","series-title":"Tech. Rept. TR-86-1","article-title":"On finding unique minimal connections for \u03b3-acyclic schemes","author":"Chan","year":"1986"},{"key":"10.1016\/0304-3975(86)90012-5_BIB16","first-page":"140","article-title":"On the properties and characterization of connection-trap-free schemes","author":"Chan","year":"1986","journal-title":"Proc. PODS"},{"issue":"2","key":"10.1016\/0304-3975(86)90012-5_BIB17","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1145\/23005.23007","article-title":"Answering queiries on the embedded-complete database schemes","volume":"34","author":"Chan","year":"1987","journal-title":"J. ACM"},{"issue":"6","key":"10.1016\/0304-3975(86)90012-5_BIB18","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/362384.362685","article-title":"A relational model for large shared data banks","volume":"13","author":"Codd","year":"1970","journal-title":"Comm. ACM"},{"year":"1981","series-title":"An Introduction to Database Systems","author":"Date","key":"10.1016\/0304-3975(86)90012-5_BIB19"},{"key":"10.1016\/0304-3975(86)90012-5_BIB20","article-title":"Acyclic hypergraphs: their recognition and top-down vs. bottom-up generation","author":"D'Atri","year":"1982","journal-title":"Tech. Rept. IASI-CNR"},{"issue":"3","key":"10.1016\/0304-3975(86)90012-5_BIB21","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/2402.322390","article-title":"Hypergraphs and relational database schemes","volume":"30","author":"Fagin","year":"1983","journal-title":"J. ACM"},{"journal-title":"The power of canonical queries","year":"1983","author":"Graham","key":"10.1016\/0304-3975(86)90012-5_BIB22"},{"issue":"1","key":"10.1016\/0304-3975(86)90012-5_BIB23","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1145\/4904.4798","article-title":"Notions of dependency satisfaction","volume":"33","author":"Graham","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(86)90012-5_BIB24","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0022-0000(84)90079-5","article-title":"Independent database schemas","volume":"28","author":"Graham","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(86)90012-5_BIB25","first-page":"239","article-title":"Extension joins","author":"Honeyman","year":"1980","journal-title":"Proc. VLDB"},{"issue":"3","key":"10.1016\/0304-3975(86)90012-5_BIB26","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/322326.322330","article-title":"Testing satisfaction of functional dependencies","volume":"29","author":"Honeyman","year":"1982","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/0304-3975(86)90012-5_BIB27","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1137\/0214026","article-title":"Some results on the representative instance in relational databases","volume":"14","author":"Ito","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(86)90012-5_BIB28","first-page":"131","article-title":"Reflections on Boyce-Codd Normal Form","author":"LeDoux","year":"1982","journal-title":"Proc. VLDB"},{"issue":"2","key":"10.1016\/0304-3975(86)90012-5_BIB29","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0022-0000(78)90009-0","article-title":"Candidate keys for relations","volume":"17","author":"Lucchesi","year":"1978","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"10.1016\/0304-3975(86)90012-5_BIB30","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/329.318579","article-title":"Database states and their tableaux","volume":"9","author":"Mendelzon","year":"1984","journal-title":"ACM TODS"},{"year":"1983","series-title":"The Theory of Relational Databases","author":"Maier","key":"10.1016\/0304-3975(86)90012-5_BIB31"},{"issue":"4","key":"10.1016\/0304-3975(86)90012-5_BIB32","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1145\/320107.320115","article-title":"Testing implications of data dependencies","volume":"4","author":"Maier","year":"1979","journal-title":"ACM TODS"},{"key":"10.1016\/0304-3975(86)90012-5_BIB33","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/971695.582207","article-title":"Windows on the world","author":"Maier","year":"1983","journal-title":"Proc. ACM-SIGMOD"},{"issue":"2","key":"10.1016\/0304-3975(86)90012-5_BIB34","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1145\/329.318580","article-title":"On the foundations of the universal relation model","volume":"9","author":"Maier","year":"1984","journal-title":"ACM TODS"},{"key":"10.1016\/0304-3975(86)90012-5_BIB35","series-title":"Logic and Data Bases","first-page":"33","article-title":"Data bases: theory vs interpretation","author":"Nicholas","year":"1978"},{"issue":"1","key":"10.1016\/0304-3975(86)90012-5_BIB36","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(79)90082-6","article-title":"Testing for existence of a covering Boyce-Codd Normal Form","volume":"8","author":"Osborn","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(86)90012-5_BIB37","first-page":"108","article-title":"Can we use the universal instance assumption without using nulls?","author":"Sagiv","year":"1981","journal-title":"Proc. ACM-SIGMOD"},{"issue":"2","key":"10.1016\/0304-3975(86)90012-5_BIB38","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1145\/319983.319988","article-title":"A characterization of globally consistent databases and their correct access paths","volume":"8","author":"Sagiv","year":"1983","journal-title":"ACM TODS"},{"journal-title":"Evaluation of queries in independent database schemes","year":"1984","author":"Sagiv","key":"10.1016\/0304-3975(86)90012-5_BIB39"},{"key":"10.1016\/0304-3975(86)90012-5_BIB40","first-page":"65","article-title":"Implementation of integrity constraints and views by query modification","author":"Stonebraker","year":"1975","journal-title":"Proc. ACM-SIGMOD"},{"year":"1982","series-title":"Principles of Database Systems","author":"Ullman","key":"10.1016\/0304-3975(86)90012-5_BIB41"},{"key":"10.1016\/0304-3975(86)90012-5_BIB42","series-title":"Tech. Rept. CSRG TR-123","article-title":"A formal treatment of imperfect information in data management","author":"Vassiliou","year":"1980"},{"key":"10.1016\/0304-3975(86)90012-5_BIB43","first-page":"82","article-title":"Algorithms for acyclic database schemes","author":"Yannakakis","year":"1981","journal-title":"Proc. VLDB"},{"issue":"3","key":"10.1016\/0304-3975(86)90012-5_BIB44","first-page":"514","article-title":"Private communication","volume":"30","author":"Yannkakis","year":"1983","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900125?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900125?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T14:18:26Z","timestamp":1762265906000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586900125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,12]]},"references-count":44,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1986,12]]}},"alternative-id":["0304397586900125"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90012-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1986,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the desirability of \u03b3-acyclic BCNF database schemes","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(86)90012-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1988 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}