{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T19:19:01Z","timestamp":1703186341924},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,8,1]],"date-time":"1982-08-01T00:00:00Z","timestamp":397008000000},"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":11308,"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":[[1982,8]]},"DOI":"10.1016\/0022-0000(82)90008-3","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"2-41","source":"Crossref","is-referenced-by-count":50,"title":["Algebraic dependencies"],"prefix":"10.1016","volume":"25","author":[{"given":"Mihalis","family":"Yannakakis","sequence":"first","affiliation":[]},{"given":"Christos H.","family":"Papadimitriou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(82)90008-3_BIB1","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/0208017","article-title":"Equivalence among relational expressions","volume":"8","author":"Aho","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(82)90008-3_BIB2","doi-asserted-by":"crossref","unstructured":"A. V. Aho, Y. Sagiv, T. Szymanski, and J. D. Ullman, Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions, SIAM J. Comput., to appear,","DOI":"10.1137\/0210030"},{"key":"10.1016\/0022-0000(82)90008-3_BIB3","series-title":"Proceedings IFIP","first-page":"590","article-title":"Dependency structures of data base relationships","author":"Armstrong","year":"1974"},{"key":"10.1016\/0022-0000(82)90008-3_BIB4","series-title":"Proceedings, 3rd SIGMOD Conference","first-page":"47","article-title":"A complete axiomatization for functional and multivalued dependencies","author":"Beeri","year":"1977"},{"key":"10.1016\/0022-0000(82)90008-3_BIB5","first-page":"377","article-title":"A relational model for large shared data bases","volume":"12","author":"Cord","year":"1970","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(82)90008-3_BIB6","series-title":"Data Base Systems","first-page":"65","article-title":"Relational completeness of data base sublanguages","author":"Cord","year":"1972"},{"key":"10.1016\/0022-0000(82)90008-3_BIB7","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/320557.320571","article-title":"Multivalued dependencies and a new normal form for relational data bases","volume":"2","author":"Fagin","year":"1977","journal-title":"ACM Trails. Database Systems"},{"key":"10.1016\/0022-0000(82)90008-3_BIB8","series-title":"Proceedings, 12th Annual ACM Symposium Theory of Computing","first-page":"123","article-title":"Horn clauses and databases dependencies","author":"Fagin","year":"1980"},{"key":"10.1016\/0022-0000(82)90008-3_BIB17","unstructured":"J. Assoc. Comput Mach., to appear."},{"key":"10.1016\/0022-0000(82)90008-3_BIB9","series-title":"Proceedings, ACM-SIGMOD Conference","article-title":"Testing implications of data dependencies","author":"Maier","year":"1979"},{"key":"10.1016\/0022-0000(82)90008-3_BIB10","series-title":"Mutual Dependencies and Some Results on Undecomposable Relations","author":"Nicolas","year":"1978"},{"key":"10.1016\/0022-0000(82)90008-3_BIB11","series-title":"Transitive Dependencies in a Database Scheme","author":"Paradaens","year":"1979"},{"key":"10.1016\/0022-0000(82)90008-3_BIB12","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1145\/320576.320580","article-title":"Independent components of relations","volume":"2","author":"Rissanen","year":"1977","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0022-0000(82)90008-3_BIB13","series-title":"Proceedings, 12th Annual ACM Symposium Theory of Computing","first-page":"117","article-title":"A complete axiomatization for a large class of dependencies","author":"Sadri","year":"1980"},{"key":"10.1016\/0022-0000(82)90008-3_BIB14","article-title":"Subset Dependencies as an Alternative to Embedded Dependencies","author":"Sagiv","year":"1979"},{"key":"10.1016\/0022-0000(82)90008-3_BIB15","article-title":"A Complete Axiomatization of Full Join Dependencies","author":"Sciore","year":"1979"},{"key":"10.1016\/0022-0000(82)90008-3_BIB16","series-title":"Principles of Database Systems","author":"Ullman","year":"1979"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900083?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900083?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:50:13Z","timestamp":1550325013000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000082900083"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,8]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,8]]}},"alternative-id":["0022000082900083"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(82)90008-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1982,8]]}}}