{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:25Z","timestamp":1725663325009},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540171874"},{"type":"electronic","value":"9783540473466"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-17187-8_32","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:09:59Z","timestamp":1330196999000},"page":"105-122","source":"Crossref","is-referenced-by-count":2,"title":["On the desirability of \u03b3-acyclic BCNF database schemes"],"prefix":"10.1007","author":[{"given":"Edward P. F.","family":"Chan","sequence":"first","affiliation":[]},{"given":"H\u00e9ctor J.","family":"Hern\u00e1ndez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1145\/320083.320091","volume":"4","author":"A.V. Aho","year":"1979","unstructured":"Aho, A.V., Beeri, C., Ullman, J.D. \u201cThe Theory of Joins in Relational Databases.\u201d ACM TODS 4, 3, September 1979, pp. 297\u2013314.","journal-title":"ACM TODS"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Atzeni, P., Chan E.P.F. \u201cEfficient Query Answering in the Representative Instance Approach.\u201d Proc. ACM PODS 1985, pp. 181\u2013188.","DOI":"10.1145\/325405.325429"},{"key":"6_CR3","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge, C. Graphs and Hypergraphs. North-Holland, Amsterdam, The Netherlands, 1973."},{"issue":"1","key":"6_CR4","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/320064.320066","volume":"4","author":"C. Beeri","year":"1979","unstructured":"Beeri, C., Bernstein, P.A. \u201cComputational Problems Related to the Design of Normal Form Relational Schemas.\u201d ACM TODS 4, 1, March 1979, pp. 30\u201359.","journal-title":"ACM TODS"},{"key":"6_CR5","unstructured":"Bernstein, P.A., Blaustein, B.T., Clarke, E.M. \u201cFast Maintenance of Semantic Integrity Assertions using Redundant Aggregate Data.\u201d Proc. VLDB 1980, pp. 126\u2013136."},{"key":"6_CR6","unstructured":"Beeri, C., Bernstein, P.A., and Goodman, N. \u201cA Sophisticate's Introduction to Database Normalization Theory.\u201d Proc. VLDB 1978, pp. 113\u2013124."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Biskup, J., Dayal, U., and Bernstein, P.A. \u201cSynthesizing Independent Database Schemas.\u201d Proc. ACM-SIGMOD 1979, Boston, Ma., pp. 143\u2013151.","DOI":"10.1145\/582095.582118"},{"key":"6_CR8","unstructured":"Bernstein, P.A., Goodman, N. \u201cWhat Does Boyce-Codd Normal Form Do?\u201d Proc. VLDB 1980, pp. 245\u2013259."},{"issue":"4","key":"6_CR9","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1145\/1634.1636","volume":"31","author":"C. Beeri","year":"1984","unstructured":"Beeri, C., Vardi, M.Y. \u201cA Proof Procedure for Data Dependencies.\u201d JACM 31, 4, October 1984, pp. 718\u2013741.","journal-title":"JACM"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Chan, E.P.F. \u201cOptimal Computation of Total Projections with Unions of Simple Chase Join Expressions.\u201d Proc. ACM-SIGMOD 1984, Boston, Ma., pp. 149\u2013163.","DOI":"10.1145\/602259.602280"},{"key":"6_CR11","unstructured":"Chan, E.P.F. \u201cAn Incremental Approach to Testing Satisfaction of Functional Dependencies.\u201d Unpublished manuscript, University of Toronto, 1981."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Chan, E.P.F., Atzeni, P. \u201cOn the Properties and Characterization of Connection-trap-free Schemes.\u201d Proc. PODS 1986, pp. 140\u2013147.","DOI":"10.1145\/6012.15411"},{"key":"6_CR13","unstructured":"Chan, E.P.F., Herna\u0144dez, H.J. \u201cOn the Desirability of \u03b3-acyclic BCNF Database Schemes.\u201d Submitted to Theoretical Computer Science."},{"key":"6_CR14","unstructured":"Chan, E.P.F., Mendelzon, A.O. \u201cAnswering Queries on the Embedded-complete Database Schemes.\u201d Unpublished manuscript, 1984."},{"issue":"6","key":"6_CR15","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/362384.362685","volume":"13","author":"E.F. Codd","year":"1970","unstructured":"Codd, E.F. \u201cA Relational Model for Large Shared Data Banks.\u201d CACM 13, 6 (June 1970), pp. 377\u2013387.","journal-title":"CACM"},{"key":"6_CR16","volume-title":"An Introduction to Database Systems","author":"C.J. Date","year":"1981","unstructured":"Date, C.J. An Introduction to Database Systems. 3rd. edition, Reading, Ma., Addison-Wesley, 1981.","edition":"3rd. edition"},{"key":"6_CR17","unstructured":"D'Atri, A., Moscarini, M. \u201cAcyclic Hypergraphs: Their Recognition and Top-down vs. Bottom-up Generation.\u201d IASI-CNR, R.29, Rome, Italy, 1982."},{"issue":"3","key":"6_CR18","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/2402.322390","volume":"30","author":"R. Fagin","year":"1983","unstructured":"Fagin, R. \u201cHypergraphs and Relational Database Schemes.\u201d JACM 30, 3, July 1983, pp. 514\u2013550.","journal-title":"JACM"},{"key":"6_CR19","unstructured":"Graham, M.H., Mendelzon, A.O. \u201cOn Total Projections Computable by Relational Algebra.\u201d Unpublished manuscript, Department of Computer Science, University of Toronto, August 1982."},{"issue":"1","key":"6_CR20","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1145\/4904.4798","volume":"33","author":"M.H. Graham","year":"1986","unstructured":"Graham, M.H., Mendelzon, A.O., and Vardi, M.Y. \u201cNotions of Dependency Satisfaction.\u201d JACM 33, 1, January 1986, pp. 105\u2013129.","journal-title":"JACM"},{"key":"6_CR21","first-page":"121","volume":"28","author":"M.H. Graham","year":"1984","unstructured":"Graham, M.H., Yannakakis, M. \"Independent Database Schemas.\" JCSS 28, pp. 121\u2013141 (1984).","journal-title":"JCSS"},{"key":"6_CR22","unstructured":"Honeyman, P. \"Extension Joins.\" Proc. VLDB 1980, pp. 239\u2013244."},{"issue":"3","key":"6_CR23","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/322326.322330","volume":"29","author":"P. Honeyman","year":"1982","unstructured":"Honeyman, P. \"Testing Satisfaction of Functional Dependencies.\" JACM 29, 3, July 1982, pp. 668\u2013677.","journal-title":"JACM"},{"issue":"2","key":"6_CR24","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1137\/0214026","volume":"14","author":"M. Ito","year":"1985","unstructured":"Ito, M., Iwasaki, M., Kasami, T. \"Some Results on the Representative Instance in Relational Databases.\" SIAM J. of Computing 14, 2 (1985), pp. 334\u2013354.","journal-title":"SIAM J. of Computing"},{"key":"6_CR25","unstructured":"LeDoux, C.H., Parker, D.S. \"Reflections on Boyce-Codd Normal Form.\" Proc. VLDB 1982, pp. 131\u2013141."},{"issue":"2","key":"6_CR26","first-page":"270","volume":"17","author":"C.L. Lucchesi","year":"1978","unstructured":"Lucchesi, C.L., Osborn, S.L. \"Candidate Keys for Relations.\" JCSS 17, 2, October 1978, pp. 270\u2013279.","journal-title":"JCSS"},{"issue":"2","key":"6_CR27","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/329.318579","volume":"9","author":"A.O. Mendelzon","year":"1984","unstructured":"Mendelzon, A.O. \"Database States and their Tableaux.\" ACM TODS 9, 2, June 1984, pp. 264\u2013282.","journal-title":"ACM TODS"},{"key":"6_CR28","unstructured":"Maier, D. The Theory of Relational Databases. Computer Science Press, 1983."},{"issue":"4","key":"6_CR29","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1145\/320107.320115","volume":"4","author":"D. Maier","year":"1979","unstructured":"Maier, D., Mendelzon, A.O., and Sagiv, Y. \"Testing Implications of Data Dependencies.\" ACM TODS 4, 4, December 1979, pp. 455\u2013469.","journal-title":"ACM TODS"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Maier, D., Rozenshtein, D., Warren, D.S. \"Windows On the World.\" Proc. ACM-SIGMOD 1983, pp. 68\u201378.","DOI":"10.1145\/582192.582207"},{"issue":"2","key":"6_CR31","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1145\/329.318580","volume":"9","author":"D. Maier","year":"1984","unstructured":"Maier, D., Ullman, J.D., and Vardi, M.Y. \"On the Foundations of the Universal Relation Model.\" ACM TODS 9, 2, June 1984, pp. 283\u2013308.","journal-title":"ACM TODS"},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"Nicholas, J-M, Gallaire, H. \"Data Bases: Theory vs Interpretation.\" Logic and Data Bases, Plenum Press, pp. 33\u201354.","DOI":"10.1007\/978-1-4684-3384-5_2"},{"issue":"1","key":"6_CR33","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(79)90082-6","volume":"8","author":"S.L. Osborn","year":"1979","unstructured":"Osborn, S.L. \"Testing for Existence of a Covering Boyce-Codd Normal Form.\" IPL 8, 1, January 1979, pp. 11\u201314.","journal-title":"IPL"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Sagiv, Y. \"Can We Use the Universal Instance Assumption Without Using Nulls?\" Proc. ACM-SIGMOD 1981, pp. 108\u2013120.","DOI":"10.1145\/582318.582336"},{"issue":"2","key":"6_CR35","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1145\/319983.319988","volume":"8","author":"Y. Sagiv","year":"1983","unstructured":"Sagiv, Y. \"A Characterization of Globally Consistent Databases and their Correct Access Paths.\" ACM TODS 8, 2, June 1983, pp. 266\u2013286.","journal-title":"ACM TODS"},{"key":"6_CR36","unstructured":"Sagiv, Y. \"Evaluation of Queries in Independent Database Schemes.\" Unpublished manuscript, 1984."},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"Stonebraker, M.R. \"Implementation of Integrity Constraints and Views by Query Modification.\" Proc. ACM-SIGMOD 1975, pp. 65\u201378.","DOI":"10.1145\/500080.500091"},{"key":"6_CR38","unstructured":"Ullman, J.D. Principles of Database Systems. 2nd. edition, Computer Science Press, 1982."},{"key":"6_CR39","unstructured":"Vassiliou, Y. \"A Formal Treatment of Imperfect Information in Data Management.\" CSRG TR-123, University of Toronto, Nov. 1980."},{"key":"6_CR40","unstructured":"Yannakakis, M. \"Algorithms for Acyclic Database Schemes.\" Proc. VLDB 1981, pp. 82\u201394."}],"container-title":["Lecture Notes in Computer Science","ICDT '86"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-17187-8_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:12:31Z","timestamp":1605643951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-17187-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540171874","9783540473466"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/3-540-17187-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}