{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:19:44Z","timestamp":1775053184191,"version":"3.50.1"},"reference-count":25,"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)90012-5","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"99-128","source":"Crossref","is-referenced-by-count":373,"title":["Structure and complexity of relational queries"],"prefix":"10.1016","volume":"25","author":[{"given":"Ashok","family":"Chandra","sequence":"first","affiliation":[]},{"given":"David","family":"Harel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(82)90012-5_BIB1","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/0208017","article-title":"Equivalences among relational expressions","volume":"8","author":"Aho","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(82)90012-5_BIB2","series-title":"Proceedings, 6th ACM Symp. on Principles of Programming Languages","first-page":"110","article-title":"Universality of data retrieval languages","author":"Aho","year":"1979"},{"issue":"6","key":"10.1016\/0022-0000(82)90012-5_BIB3","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/362384.362685","article-title":"A relational model of data for large shared data banks","volume":"13","author":"Cord","year":"1970","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(82)90012-5_BIB4","series-title":"Data Base Systems","article-title":"Relational completeness of data base sublanguages","author":"Codd","year":"1972"},{"key":"10.1016\/0022-0000(82)90012-5_BIB5","series-title":"Proc. 8th ACM Symp. on POPL","first-page":"50","article-title":"Programming primitives for database languages","author":"Chandra","year":"1981"},{"key":"10.1016\/0022-0000(82)90012-5_BIB6","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-0000(80)90032-X","article-title":"Computable queries for relational data bases","volume":"21","author":"Chandra","year":"1980","journal-title":"J. Comp. System Sci."},{"key":"10.1016\/0022-0000(82)90012-5_BIB7","series-title":"Proc. 21st FOCS","first-page":"333","article-title":"Structure and complexity of relational queries","author":"Chandra","year":"1980"},{"key":"10.1016\/0022-0000(82)90012-5_BIB8","series-title":"Proc. ACM Symp. on Principles of Database Systems","article-title":"Horn clauses and the fixpoint query hierarchy","author":"Chandra","year":"1982"},{"key":"10.1016\/0022-0000(82)90012-5_BIB9","series-title":"Proceedings, 9th ACM Symp. on Theory of Computing","article-title":"Optimal Implementation of Conjunctive Queries in Relational Data Bases","author":"Chandra","year":"1977"},{"key":"10.1016\/0022-0000(82)90012-5_BIB10","doi-asserted-by":"crossref","first-page":"129","DOI":"10.4064\/fm-49-2-129-141","article-title":"An application of games to the completeness problem for formalized theores","volume":"49","author":"Ehrenfeucht","year":"1961","journal-title":"Fund. Math"},{"key":"10.1016\/0022-0000(82)90012-5_BIB11","first-page":"43","article-title":"Generalized first-order spectra and polynomial-time recognizable sets","volume":"7","author":"Fagin","year":"1974"},{"key":"10.1016\/0022-0000(82)90012-5_BIB12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/malq.19750210112","article-title":"Monadic generalized spectra","volume":"21","author":"Fagin","year":"1975","journal-title":"Z. Math. Logic Grundlag. Math."},{"issue":"no. 1","key":"10.1016\/0022-0000(82)90012-5_BIB13","article-title":"Sur les classifications des syst\u00e8mes de relations","volume":"1","author":"Fra\u00efss\u00e9","year":"1954","journal-title":"Publications Sc. d l'Universit\u00e9 D'Alger"},{"key":"10.1016\/0022-0000(82)90012-5_BIB14","unstructured":"H. Gaifman. Private Communication."},{"key":"10.1016\/0022-0000(82)90012-5_BIB15","series-title":"Logic and Data Bases","year":"1978"},{"key":"10.1016\/0022-0000(82)90012-5_BIB16","series-title":"Proc., ACM Symp. on Theory of Computing","article-title":"Relational queries computable in polynomial time","author":"Immerman","year":"1982"},{"key":"10.1016\/0022-0000(82)90012-5_BIB17","series-title":"Proc., IFIP","first-page":"556","article-title":"Predicate logic as a programming language","author":"Kowalski","year":"1974"},{"issue":"1","key":"10.1016\/0022-0000(82)90012-5_BIB18","doi-asserted-by":"crossref","first-page":"79","DOI":"10.2307\/2271729","article-title":"The diversity of quantifier prefixes","volume":"38","author":"Keisler","year":"1973","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(82)90012-5_BIB19","article-title":"Computing in Logarithmic Space","author":"Lind","year":"1974"},{"key":"10.1016\/0022-0000(82)90012-5_BIB20","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0022-0000(82)90012-5_BIB21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(82)90012-5_BIB22","series-title":"Formal Description of Programming Concepts","first-page":"421","article-title":"Computation and deductive information retrieval","author":"van Emden","year":"1978"},{"key":"10.1016\/0022-0000(82)90012-5_BIB23","series-title":"Proceedings, 14th ACM Symp. on Theory of Computing","first-page":"137","article-title":"The complexity of relational query languages","author":"Vardi","year":"1982"},{"key":"10.1016\/0022-0000(82)90012-5_BIB24","series-title":"Query by example, RC4917","author":"Zloof","year":"1974"},{"key":"10.1016\/0022-0000(82)90012-5_BIB25","series-title":"Query by example, Operations on the transitive closure","author":"Zloof","year":"1976"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900125?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900125?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:50:10Z","timestamp":1550307010000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000082900125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,8]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,8]]}},"alternative-id":["0022000082900125"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(82)90012-5","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1982,8]]}}}