{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,9]],"date-time":"2023-10-09T18:38:37Z","timestamp":1696876717600},"reference-count":50,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7837,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1992,2]]},"DOI":"10.1016\/0022-0000(92)90001-y","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"1-22","source":"Crossref","is-referenced-by-count":3,"title":["Connection-trap-free database schemes"],"prefix":"10.1016","volume":"44","author":[{"given":"Edward P.F.","family":"Chan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Atzeni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No. 3","key":"10.1016\/0022-0000(92)90001-Y_BIB1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1145\/320083.320091","article-title":"The theory of joins in relational databases","volume":"4","author":"Axo","year":"1979","journal-title":"ACM TODS"},{"issue":"No. 2","key":"10.1016\/0022-0000(92)90001-Y_BIB2","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/0208017","article-title":"Equivalence of relational expressions","volume":"8","author":"Aho","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(92)90001-Y_BIB3","series-title":"Proc. VLDB","first-page":"352","article-title":"The information preserving properties of relational database transformations","author":"Arora","year":"1978"},{"key":"10.1016\/0022-0000(92)90001-Y_BIB4","first-page":"181","article-title":"Efficient query answering in the representative instance approach","author":"Atzeni","year":"1985"},{"key":"10.1016\/0022-0000(92)90001-Y_BIB5","first-page":"1","article-title":"Assumptions in relational database theory","author":"Atzeni","year":"1982"},{"key":"10.1016\/0022-0000(92)90001-Y_BIB6","first-page":"27","article-title":"Minimal coverings of acyclic database schemata","volume":"Vol. 2","author":"Ausiello","year":"1984"},{"issue":"No. 2","key":"10.1016\/0022-0000(92)90001-Y_BIB7","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1137\/0210025","article-title":"Equivalence of relational database schemes","volume":"10","author":"Beeri","year":"1981","journal-title":"SIAM J. Comput."},{"issue":"No. 4","key":"10.1016\/0022-0000(92)90001-Y_BIB8","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. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(92)90001-Y_BIB9","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0022-0000(92)90001-Y_BIB10","first-page":"245","article-title":"What does Boyce-Codd normal form do?","author":"Bernstein","year":"1980"},{"key":"10.1016\/0022-0000(92)90001-Y_BIB11","article-title":"On Finding Unique Minimal Connections for \u03b3-acyclic schemes","author":"Chan","year":"1986"},{"issue":"No. 2","key":"10.1016\/0022-0000(92)90001-Y_BIB12","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1145\/23005.23007","article-title":"Answering queries on embedded-complete database schemes","volume":"34","author":"Chan","year":"1987","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 2","key":"10.1016\/0022-0000(92)90001-Y_BIB13","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0306-4379(87)90040-8","article-title":"On testing soundness of relational expressions","volume":"12","author":"Chan","year":"1987","journal-title":"Inform. Systems"},{"key":"10.1016\/0022-0000(92)90001-Y_BIB14","author":"Chen","year":"1982"},{"issue":"No. 6","key":"10.1016\/0022-0000(92)90001-Y_BIB15","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":"Cord","year":"1970","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(92)90001-Y_BIB16","article-title":"Acyclic Hypergraphs: Their Recognition and Top-down vs. Bottom-up Generation","author":"D'Atri","year":"1982","journal-title":"IASI-CNR"},{"key":"10.1016\/0022-0000(92)90001-Y_BIB17","first-page":"1","article-title":"On the recognition and design of acyclic databases","author":"D'Atri","year":"1984"},{"key":"10.1016\/0022-0000(92)90001-Y_BIB18","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1145\/322344.322347","article-title":"Horn clauses and database dependencies","volume":"29","author":"Fagin","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 3","key":"10.1016\/0022-0000(92)90001-Y_BIB19","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/2402.322390","article-title":"Degrees of acyclicity for hypergraphs and relational database schemes","volume":"30","author":"Fagin","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 1","key":"10.1016\/0022-0000(92)90001-Y_BIB20","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. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(92)90001-Y_BIB21","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."},{"issue":"No. 3","key":"10.1016\/0022-0000(92)90001-Y_BIB22","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. Assoc. Comput. Mach."},{"issue":"No. 1","key":"10.1016\/0022-0000(92)90001-Y_BIB23","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0020-0190(80)90114-3","article-title":"Testing the universal instance assumption","volume":"10","author":"Honeyman","year":"1980","journal-title":"Inform. Process Lett."},{"issue":"No. 2","key":"10.1016\/0022-0000(92)90001-Y_BIB24","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."},{"issue":"No. 4","key":"10.1016\/0022-0000(92)90001-Y_BIB25","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1145\/319628.319630","article-title":"Consequences of assuming a universal relation","volume":"6","author":"Kent","year":"1981","journal-title":"ACM TODS"},{"issue":"No. 4","key":"10.1016\/0022-0000(92)90001-Y_BIB26","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1145\/319996.320019","article-title":"The universal relation revisited","volume":"8","author":"Kent","year":"1988","journal-title":"ACM TODS"},{"issue":"No. 3","key":"10.1016\/0022-0000(92)90001-Y_BIB27","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1145\/1270.1209","article-title":"System U\u2014A database system based on the universal relation assumption","volume":"9","author":"Korth","year":"1984","journal-title":"ACM TODS"},{"issue":"No. 2","key":"10.1016\/0022-0000(92)90001-Y_BIB28","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1145\/320141.320155","article-title":"Construction of relations in relational databases","volume":"5","author":"Lozinskii","year":"1980","journal-title":"ACM TODS"},{"key":"10.1016\/0022-0000(92)90001-Y_BIB29","series-title":"The Theory of Relational Databases","author":"Maier","year":"1983"},{"issue":"No. 4","key":"10.1016\/0022-0000(92)90001-Y_BIB30","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\/0022-0000(92)90001-Y_BIB31","first-page":"51","article-title":"Toward logical data independence: A relational query language without relations","author":"Maier","year":"1982"},{"key":"10.1016\/0022-0000(92)90001-Y_BIB32_1","first-page":"213","article-title":"Window functions","volume":"Vol. 3","author":"Maier","year":"1986"},{"key":"10.1016\/0022-0000(92)90001-Y_BIB32_2","first-page":"68","article-title":"Window functions","volume":"Vol. 3","author":"Maier","year":"1986"},{"issue":"No. 1","key":"10.1016\/0022-0000(92)90001-Y_BIB33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/319830.319831","article-title":"Maximal objects and the semantics of universal relation databases","volume":"8","author":"Maier","year":"1983","journal-title":"ACM TODS"},{"issue":"No. 2","key":"10.1016\/0022-0000(92)90001-Y_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\/0022-0000(92)90001-Y_BIB35","first-page":"1","article-title":"Specifying connections for a universal relation scheme database","author":"Maier","year":"1982"},{"issue":"No. 2","key":"10.1016\/0022-0000(92)90001-Y_BIB36","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"},{"key":"10.1016\/0022-0000(92)90001-Y_BIB37","series-title":"Logic and Data Bases","first-page":"33","article-title":"Data bases: Theory vs interpretation","author":"Nicolas","year":"1979"},{"key":"10.1016\/0022-0000(92)90001-Y_BIB38","first-page":"52","article-title":"Toward a universal relation interface","author":"Osborn","year":"1979"},{"key":"10.1016\/0022-0000(92)90001-Y_BIB39","first-page":"108","article-title":"Can we use the universal instance assumption without using nulls?","author":"Sagiv","year":"1981"},{"issue":"No. 2","key":"10.1016\/0022-0000(92)90001-Y_BIB40","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1145\/319983.319988","article-title":"A characterization of globally consistent database and their correct access paths","volume":"8","author":"Sagiv","year":"1983","journal-title":"ACM TODS"},{"key":"10.1016\/0022-0000(92)90001-Y_BIB41","series-title":"Evaluation of queries in independent database schemes","author":"Sagiv","year":"1984"},{"key":"10.1016\/0022-0000(92)90001-Y_BIB42","first-page":"10","article-title":"An algorithm for servicing multirelational queries","author":"Schenk","year":"1977"},{"key":"10.1016\/0022-0000(92)90001-Y_BIB43","series-title":"Data Models","author":"Tsichritzis","year":"1982"},{"key":"10.1016\/0022-0000(92)90001-Y_BIB44","series-title":"Principles of Database Systems","author":"Ullman","year":"1982"},{"key":"10.1016\/0022-0000(92)90001-Y_BIB45","first-page":"10","article-title":"The U. R. strikes back","author":"Ullman","year":"1982"},{"issue":"No. 4","key":"10.1016\/0022-0000(92)90001-Y_BIB46","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1145\/319996.320017","article-title":"On Kent's `Consequences of Assuming a Universal Relation","volume":"8","author":"Ullman","year":"1983","journal-title":"ACM TODS"},{"key":"10.1016\/0022-0000(92)90001-Y_BIB47","article-title":"A Formal Treatment of Imperfect Information in Data Management","author":"Vassiliou","year":"1980"},{"key":"10.1016\/0022-0000(92)90001-Y_BIB48","first-page":"82","article-title":"Algorithms for acyclic database schemes","author":"Yannakakis","year":"1981"},{"key":"10.1016\/0022-0000(92)90001-Y_BIB49","unstructured":"M. Yannakakis, private communication, cited in [F2]."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290001Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290001Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:56:56Z","timestamp":1550325416000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009290001Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,2]]}},"alternative-id":["002200009290001Y"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(92)90001-y","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1992,2]]}}}