{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T00:24:01Z","timestamp":1649118241054},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,4,1]],"date-time":"1989-04-01T00:00:00Z","timestamp":607392000000},"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":8873,"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":[[1989,4]]},"DOI":"10.1016\/0022-0000(89)90008-1","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"380-404","source":"Crossref","is-referenced-by-count":0,"title":["A characterization of finite fd-acyclicity"],"prefix":"10.1016","volume":"38","author":[{"given":"Yehoshua","family":"Sagiv","sequence":"first","affiliation":[]},{"given":"Oded","family":"Shmueli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"No. 3","key":"10.1016\/0022-0000(89)90008-1_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":"Aho","year":"1979","journal-title":"ACM Trans. Database Systems"},{"issue":"No. 2","key":"10.1016\/0022-0000(89)90008-1_BIB2","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/0208017","article-title":"Equivalences among relational expressions","volume":"8","author":"Aho","year":"1979","journal-title":"SIAM J. Comput."},{"issue":"No. 1","key":"10.1016\/0022-0000(89)90008-1_BIB3","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 Trans. Database Systems"},{"key":"10.1016\/0022-0000(89)90008-1_BIB4","series-title":"Proceedings, Thirteenth Annual ACM Symp. on Theory of Computing","first-page":"355","article-title":"Properties of acyclic database schemas","author":"Beeri","year":"1981"},{"issue":"No. 3","key":"10.1016\/0022-0000(89)90008-1_BIB5","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1145\/2402.322389","article-title":"On the desirability of acyclic database schemes","volume":"30","author":"Beeri","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(89)90008-1_BIB6","series-title":"Proceedings, Conf. on Very Large Data Bases","article-title":"Comprehensive approach to the design of relational database schemes","author":"Beeri","year":"1984"},{"issue":"No. 1","key":"10.1016\/0022-0000(89)90008-1_BIB7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/322234.322238","article-title":"Using semi-joins to solve relational queries","volume":"28","author":"Bernstein","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(89)90008-1_BIB8","series-title":"Proceedings ACM-SIGMOD Internat. Conf. on Management of Data","first-page":"143","article-title":"Synthesizing independent database schemas","author":"Biskup","year":"1979"},{"issue":"No. 1","key":"10.1016\/0022-0000(89)90008-1_BIB9","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0022-0000(84)90075-8","article-title":"Inclusion dependencies and their interaction with functional dependencies","volume":"28","author":"Casanova","year":"1984","journal-title":"J. Comput. System Sci."},{"issue":"No. 3","key":"10.1016\/0022-0000(89)90008-1_BIB10","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1145\/319732.319735","article-title":"A simplified universal relation assumption and its properties","volume":"7","author":"Fagin","year":"1982","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0022-0000(89)90008-1_BIB11","series-title":"Technical Report","article-title":"On the Universal Relation","author":"Graham","year":"1979"},{"issue":"No. 4","key":"10.1016\/0022-0000(89)90008-1_BIB12","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/319758.319775","article-title":"Tree queries: A simple class of relational quaries","volume":"7","author":"Goodman","year":"1982","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0022-0000(89)90008-1_BIB13","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1145\/2157.322405","article-title":"Syntactic characterization of tree database schemes","volume":"30","author":"Goodman","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 3","key":"10.1016\/0022-0000(89)90008-1_BIB14","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. 2","key":"10.1016\/0022-0000(89)90008-1_BIB15","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0022-0000(83)90046-6","article-title":"Acyclic join dependencies and data base projections","volume":"27","author":"Hull","year":"1983","journal-title":"J. Comput. System Sci."},{"issue":"No. 2","key":"10.1016\/0022-0000(89)90008-1_BIB16","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/329.354","article-title":"An extension of conflict-free multivalued dependency sets","volume":"9","author":"Katsvno","year":"1984","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0022-0000(89)90008-1_BIB17","series-title":"Proceedings ACM SIGMOD Conference","first-page":"79","article-title":"Functional dependencies on cyclic database schemes","author":"Laver","year":"1983"},{"key":"10.1016\/0022-0000(89)90008-1_BIB18","article-title":"Semantic and Syntactic Properties of Universal Relation Scheme Data Bases","author":"Laver","year":"1984"},{"issue":"No. 4","key":"10.1016\/0022-0000(89)90008-1_BIB19","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 Trans. Database Systems"},{"key":"10.1016\/0022-0000(89)90008-1_BIB20","series-title":"Advances In Computing Research: The Theory of Databases","first-page":"107","article-title":"Properties of database schemata with functional dependencies","author":"Sacc\u00e0","year":"1986"},{"key":"10.1016\/0022-0000(89)90008-1_BIB21","series-title":"State of the Art Report on Relational Databases","article-title":"Data dependency manipulation in database schemata","author":"Sacc\u00e0","year":"1986"},{"key":"10.1016\/0022-0000(89)90008-1_BIB22","series-title":"Proceedings, ACM-SIGMOD Intl. Conf. on Management of Data","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(89)90008-1_BIB23","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 Trans. Database Systems"},{"issue":"No. 3","key":"10.1016\/0022-0000(89)90008-1_BIB24","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","article-title":"Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs","volume":"13","author":"Tarjan","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(89)90008-1_BIB25","series-title":"Principles of Database Systems","author":"Ullman","year":"1983"},{"key":"10.1016\/0022-0000(89)90008-1_BIB26","series-title":"Proceedings, 7th Internat. Conf. on Very Large Data Bases","first-page":"82","article-title":"Algorithms for acyclic database schemes","author":"Yannakakis","year":"1981"},{"key":"10.1016\/0022-0000(89)90008-1_BIB27","series-title":"Proceedings, COMPSAC 79","article-title":"An algorithm for tree-query membership of a distributed query","author":"Yu","year":"1979"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900081?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900081?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:54:47Z","timestamp":1550307287000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000089900081"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,4]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,4]]}},"alternative-id":["0022000089900081"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(89)90008-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1989,4]]}}}