{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:51:51Z","timestamp":1710352311547},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1986,10,1]],"date-time":"1986-10-01T00:00:00Z","timestamp":528508800000},"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":9786,"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":[[1986,10]]},"DOI":"10.1016\/0022-0000(86)90018-8","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"179-202","source":"Crossref","is-referenced-by-count":33,"title":["Chordality properties on graphs and minimal conceptual connections in semantic data models"],"prefix":"10.1016","volume":"33","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\/0022-0000(86)90018-8_BIB1","first-page":"27","article-title":"Minimal coverings of acyclic database schemata","volume":"Vol. 2","author":"Ausiello","year":"1984"},{"issue":"No. 3","key":"10.1016\/0022-0000(86)90018-8_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. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(86)90018-8_BIB3","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0022-0000(86)90018-8_BIB4","series-title":"The Theory of Databases","first-page":"43","article-title":"Recognition algorithms and design methodology for acyclic database schemes","volume":"Vol. 3","author":"D'Atri","year":"1986"},{"key":"10.1016\/0022-0000(86)90018-8_BIB5","series-title":"Proceedings Annual Meeting SIGMOD 83","first-page":"173","article-title":"Answering queries in relational databases","volume":"13","author":"D'Atri","year":"1983"},{"issue":"No. 3","key":"10.1016\/0022-0000(86)90018-8_BIB6","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. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(86)90018-8_BIB7","series-title":"Proceedings CAAP' 83","first-page":"65","article-title":"Acyclic database schemes (of various degree): a painless introduction","volume":"Vol. 159","author":"Fagin","year":"1983"},{"key":"10.1016\/0022-0000(86)90018-8_BIB8","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0022-0000(86)90018-8_BIB9","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0022-0000(86)90018-8_BIB10","series-title":"Proceedings, Annual Meeting SIGMOD 83","first-page":"68","article-title":"Windows on the world","volume":"13","author":"Maier","year":"1983"},{"issue":"Nos. 1\/2","key":"10.1016\/0022-0000(86)90018-8_BIB11","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0304-3975(84)90030-6","article-title":"Connections in acyclic hypergraphs","volume":"32","author":"Maier","year":"1984","journal-title":"Theoret. Comput. Sci."},{"issue":"No. 3","key":"10.1016\/0022-0000(86)90018-8_BIB12","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(86)90018-8_BIB13","series-title":"Principles of Database Systems","author":"Ullman","year":"1982"},{"key":"10.1016\/0022-0000(86)90018-8_BIB14","series-title":"Proceeding, IFIP Conference","first-page":"243","article-title":"Universal relation interfaces for database systems","author":"Ullman","year":"1983"},{"issue":"No. 3","key":"10.1016\/0022-0000(86)90018-8_BIB15","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1145\/1270.1275","article-title":"Resolving the query inference problem using Steiner trees","volume":"9","author":"Wald","year":"1984","journal-title":"ACM Trans. Database Systems"},{"issue":"No. 1","key":"10.1016\/0022-0000(86)90018-8_BIB16","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230150109","article-title":"Steiner trees, connected domination and strongly chordal graphs","volume":"15","author":"White","year":"1985","journal-title":"Networks"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000086900188?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000086900188?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:53:00Z","timestamp":1550307180000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000086900188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,10]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,10]]}},"alternative-id":["0022000086900188"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(86)90018-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1986,10]]}}}