{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T15:34:39Z","timestamp":1762270479239},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1985]]},"DOI":"10.1016\/0304-3975(85)90012-x","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"165-177","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["On the existence of acyclic views in a database scheme"],"prefix":"10.1016","volume":"35","author":[{"given":"Giorgio","family":"Ausiello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"d'Atri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marina","family":"Moscarini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90012-X_BIB1","first-page":"27","article-title":"Minimal coverings of acyclic database schemata","volume":"Vol. 2","author":"Ausiello","year":"1984"},{"issue":"3","key":"10.1016\/0304-3975(85)90012-X_BIB2","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. ACM"},{"key":"10.1016\/0304-3975(85)90012-X_BIB3","series-title":"Proc. 2nd ACM SIGACT-SIGMOD Symp. on Principles of Database Systems","first-page":"340","article-title":"Elimination of intersection anomalies from database schemas","author":"Beeri","year":"1983"},{"key":"10.1016\/0304-3975(85)90012-X_BIB4","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0304-3975(85)90012-X_BIB5","series-title":"Proc. 3rd ACM SIGACT-SIGMOD Conf. on Principles of Database Systems","first-page":"1","article-title":"On the recognition and design of acyclic databases","author":"d'Atri","year":"1984"},{"key":"10.1016\/0304-3975(85)90012-X_BIB6","first-page":"173","article-title":"Answering queries in relational databases","volume":"13","author":"d'Atri","year":"1983"},{"key":"10.1016\/0304-3975(85)90012-X_BIB7","series-title":"Proc. 8th Colloquium on Trees in Algebra and Programming","first-page":"65","article-title":"Acyclic database schemes (of various degree): A painless introduction","volume":"159","author":"Fagin","year":"1983"},{"issue":"3","key":"10.1016\/0304-3975(85)90012-X_BIB8","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/2402.322390","article-title":"Degree of acyclicity for hypergraphs and relational database schemes","volume":"30","author":"Fagin","year":"1983","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/0304-3975(85)90012-X_BIB9","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\/0304-3975(85)90012-X_BIB10","volume":"Vol. 2","year":"1984"},{"key":"10.1016\/0304-3975(85)90012-X_BIB11","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"issue":"4","key":"10.1016\/0304-3975(85)90012-X_BIB12","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/319758.319775","article-title":"Tree queries: A simple class of queries","volume":"7","author":"Goodman","year":"1982","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0304-3975(85)90012-X_BIB13","series-title":"Proc. 1st ACM SIGACT-SIGMOD Symp. on Principles of Database Systems","first-page":"49","article-title":"Transforming cyclic schemas into trees","author":"Goodman","year":"1982"},{"key":"10.1016\/0304-3975(85)90012-X_BIB14","series-title":"Proc. 2nd ACM SIGACT-SIGMOD Symp. on Principles of Database Systems","first-page":"267","article-title":"GYO reductions, connections, tree and cyclic schemas and tree projections","author":"Goodman","year":"1983"},{"key":"10.1016\/0304-3975(85)90012-X_BIB15","first-page":"68","article-title":"Windows on the world","volume":"13","author":"Maier","year":"1983"},{"issue":"1","key":"10.1016\/0304-3975(85)90012-X_BIB16","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 Trans. Database Systems"},{"key":"10.1016\/0304-3975(85)90012-X_BIB17","series-title":"Proc. 8th Colloquium on Trees in Algebra and Programming","first-page":"65","article-title":"An application of the theory of graphs and hypergraphs to the decomposition of relational database schemas","volume":"159","author":"Paradaens","year":"1983"},{"key":"10.1016\/0304-3975(85)90012-X_BIB18","series-title":"Principles of Database Systems","author":"Ullman","year":"1982"},{"key":"10.1016\/0304-3975(85)90012-X_BIB19","series-title":"IFIP Conf.","first-page":"243","article-title":"Universal relation interfaces for database systems","author":"Ullman","year":"1983"},{"key":"10.1016\/0304-3975(85)90012-X_BIB20","series-title":"Proc. 7th Conf. on Very Large Data Bases","first-page":"82","article-title":"Algorithms for acyclic database schemes","author":"Yannakakis","year":"1981"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758590012X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758590012X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T20:52:49Z","timestamp":1553201569000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758590012X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":20,"alternative-id":["030439758590012X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90012-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}