{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:15Z","timestamp":1760202495628},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1984,2,1]],"date-time":"1984-02-01T00:00:00Z","timestamp":444441600000},"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":10759,"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":[[1984,2]]},"DOI":"10.1016\/0022-0000(84)90076-x","type":"journal-article","created":{"date-parts":[[2003,12,3]],"date-time":"2003-12-03T06:59:35Z","timestamp":1070434775000},"page":"60-79","source":"Crossref","is-referenced-by-count":13,"title":["The tree projection theorem and relational query processing"],"prefix":"10.1016","volume":"28","author":[{"given":"Nathan","family":"Goodman","sequence":"first","affiliation":[]},{"given":"Oded","family":"Shmueli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0022-0000(84)90076-X_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":"2","key":"10.1016\/0022-0000(84)90076-X_BIB2","doi-asserted-by":"crossref","DOI":"10.1137\/0208017","article-title":"Equivalence of relational expressions","volume":"8","author":"Aho","year":"1979","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/0022-0000(84)90076-X_BIB3","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(84)90076-X_BIB4","series-title":"Thirteenth Annual ACM Symposium on Theory of Computation","first-page":"355","article-title":"Properties of acyclic database schemas","author":"Beeri","year":"1981"},{"issue":"3","key":"10.1016\/0022-0000(84)90076-X_BIB5","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1145\/2402.322389","article-title":"On the desirability of acyclic database schemas","volume":"30","author":"Beeri","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"issue":"4","key":"10.1016\/0022-0000(84)90076-X_BIB6","doi-asserted-by":"crossref","DOI":"10.1137\/0210059","article-title":"The power of natural semijoins","volume":"10","author":"Bernstein","year":"1981","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/0022-0000(84)90076-X_BIB7","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/2402.322390","article-title":"Degrees of Acyclicity for Hypergraphs and Relational Database Systems","volume":"30","author":"Fagin","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"issue":"3","key":"10.1016\/0022-0000(84)90076-X_BIB8","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(84)90076-X_BIB9","series-title":"Computers and Intractability: A Guide to the Theory of NPCompleteness","author":"Gary","year":"1979"},{"key":"10.1016\/0022-0000(84)90076-X_BIB10","article-title":"On the Universal Relation","author":"Graham","year":"1979"},{"issue":"3","key":"10.1016\/0022-0000(84)90076-X_BIB11","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/319758.319775","article-title":"Tree Queries: A Simple Class of Relational Queries","volume":"7","author":"Goodman","year":"1982","journal-title":"ACM Trans. Database Systems"},{"issue":"4","key":"10.1016\/0022-0000(84)90076-X_BIB12","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1145\/2157.322405","article-title":"Syntactic Characterizations of Database Schemas","volume":"30","author":"Goodman","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(84)90076-X_BIB13","series-title":"Proceedings of the ACM SIGACT-SIGMOD Conference on Principles of Database Systems","first-page":"40","article-title":"The tree property is fundamental for query processing","author":"Goodman","year":"1982"},{"key":"10.1016\/0022-0000(84)90076-X_BIB14","series-title":"Proceedings of the ACM SIGACT-SIGMOD Conference on Principles of Database Systems","first-page":"49","article-title":"Transforming cyclic schemas into trees","author":"Goodman","year":"1982"},{"key":"10.1016\/0022-0000(84)90076-X_BIB15","doi-asserted-by":"crossref","unstructured":"N. Goodman, O. Shmueli, \u201cNP-Complete Problems Simplified on Tree Schemas,\u201d Acta Informatica, in press.","DOI":"10.1007\/BF00289414"},{"issue":"3","key":"10.1016\/0022-0000(84)90076-X_BIB16","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0022-0000(83)90046-6","article-title":"Acyclic join dependencies and database projections","volume":"27","author":"Hull","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(84)90076-X_BIB17","series-title":"Proceedings of the AFIPS 1975 NCC","first-page":"417","article-title":"INGRES-A relational data base management system","author":"Held","year":"1975"},{"issue":"4","key":"10.1016\/0022-0000(84)90076-X_BIB18","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"},{"issue":"1","key":"10.1016\/0022-0000(84)90076-X_BIB19","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\/0022-0000(84)90076-X_BIB20","series-title":"Proceedings of the ACM SIGACT-SIGMOD Conference on Principles of Database Systems","first-page":"34","article-title":"Connections in acyclic hypergraphs","author":"Maier","year":"1982"},{"key":"10.1016\/0022-0000(84)90076-X_BIB21","article-title":"The Fundamental Role of Tree Schemas in Relational Query Processing","author":"Shmueli","year":"1981"},{"key":"10.1016\/0022-0000(84)90076-X_BIB22","series-title":"Proceedings of the VLDB","first-page":"82","article-title":"Algorithms for acyclic database schemes","author":"Yannakakis","year":"1981"},{"key":"10.1016\/0022-0000(84)90076-X_BIB23","series-title":"Proceedings of the COMPSAC 79","article-title":"An algorithms 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:002200008490076X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200008490076X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T10:53:49Z","timestamp":1550314429000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200008490076X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,2]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1984,2]]}},"alternative-id":["002200008490076X"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(84)90076-x","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1984,2]]}}}