{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:20:02Z","timestamp":1760707202236},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,8,1]],"date-time":"1990-08-01T00:00:00Z","timestamp":649468800000},"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":8386,"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":[[1990,8]]},"DOI":"10.1016\/0022-0000(90)90031-f","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"2-24","source":"Crossref","is-referenced-by-count":19,"title":["Decomposing a relation into a tree of binary relations"],"prefix":"10.1016","volume":"41","author":[{"given":"Rina","family":"Dechter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(90)90031-F_BIB1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01934985","article-title":"Efficient algorithms for combinatorial problems on graphs with bounded decomposability\u2014A survey","volume":"25","author":"Arnborg","year":"1985","journal-title":"BIT"},{"issue":"No. 3","key":"10.1016\/0022-0000(90)90031-F_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(90)90031-F_BIB3","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1109\/TIT.1968.1054142","article-title":"Approximating discrete probability distributions with dependence trees","author":"Chow","year":"1968","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"No. 1","key":"10.1016\/0022-0000(90)90031-F_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","article-title":"Network-based heuristics for constraint-satisfaction problems","volume":"34","author":"Dechter","year":"1987","journal-title":"Artif. Intell. J."},{"key":"10.1016\/0022-0000(90)90031-F_BIB5","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"issue":"No.3","key":"10.1016\/0022-0000(90)90031-F_BIB6","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/320557.320571","article-title":"Multivalued dependencies and a new form for relational databases","volume":"2","author":"Fagin","year":"1977","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0022-0000(90)90031-F_BIB7","first-page":"48","article-title":"On the shortest spanning subtrec of a graph and the traveling salesman problem","volume":"7","author":"Kruskal","year":"1956"},{"key":"10.1016\/0022-0000(90)90031-F_BIB8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1214\/aoms\/1177729694","article-title":"Information and sufficiency","volume":"22","author":"Kullback","year":"1951","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/0022-0000(90)90031-F_BIB9","series-title":"Combinatorial Optimization, Networks and Matroids","author":"Lawler","year":"1976"},{"issue":"No. 1","key":"10.1016\/0022-0000(90)90031-F_BIB10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","article-title":"Consistency in networks of relations","volume":"8","author":"Mackworth","year":"1977","journal-title":"Artif. Intell."},{"key":"10.1016\/0022-0000(90)90031-F_BIB11","series-title":"The Theory of Relational Databases","author":"Maier","year":"1983"},{"key":"10.1016\/0022-0000(90)90031-F_BIB12","series-title":"Proceedings, International Workshop on Statistical & Scientific Database Management","article-title":"Decomposing complex contingency tables to reduce storage requirements","author":"Malvestuto","year":"1986"},{"key":"10.1016\/0022-0000(90)90031-F_BIB13","series-title":"Modelling large bases of categorical data with acyclic Schemes","author":"Malvestuto","year":"1986"},{"issue":"No. 3","key":"10.1016\/0022-0000(90)90031-F_BIB14","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0306-4379(86)90029-3","article-title":"Statistical treatment of the information content of a database","volume":"11","author":"Malvestuto","year":"1986","journal-title":"Inform. Systems"},{"key":"10.1016\/0022-0000(90)90031-F_BIB15","series-title":"Proceedings, Sixth Conference on the Principles of Database Systems","first-page":"87","article-title":"Answering queries in categorical databases","author":"Malvestuto","year":"1987"},{"key":"10.1016\/0022-0000(90)90031-F_BIB16","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","article-title":"Networks of constraints: Fundamental properties and applications to picture processing","volume":"7","author":"Montanari","year":"1974","journal-title":"Inform. Sci."},{"key":"10.1016\/0022-0000(90)90031-F_BIB17","series-title":"Proceedings, AI-86, Canadian Conference","article-title":"On the logic of representing dependencies by graphs","author":"Pearl","year":"1986"},{"key":"10.1016\/0022-0000(90)90031-F_BIB18","series-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"Pearl","year":"1988"},{"key":"10.1016\/0022-0000(90)90031-F_BIB19","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/TIT.1980.1056144","article-title":"Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy","volume":"IT-26","author":"Shore","year":"1980","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090031F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090031F?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:55:52Z","timestamp":1550325352000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009090031F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,8]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,8]]}},"alternative-id":["002200009090031F"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(90)90031-f","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1990,8]]}}}