{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T17:50:14Z","timestamp":1648662614743},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,11,1]],"date-time":"1988-11-01T00:00:00Z","timestamp":594345600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data & Knowledge Engineering"],"published-print":{"date-parts":[[1988,11]]},"DOI":"10.1016\/0169-023x(88)90015-8","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T12:15:20Z","timestamp":1047644120000},"page":"181-196","source":"Crossref","is-referenced-by-count":2,"title":["Relational theory of queries"],"prefix":"10.1016","volume":"3","author":[{"given":"Juraj","family":"Steiner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0169-023X(88)90015-8_BIB1","series-title":"Proc. 6th ACM Symposium on Principles of Programming Languages","first-page":"110","article-title":"Universality of data retrieval languages","author":"Aho","year":"1979"},{"key":"10.1016\/0169-023X(88)90015-8_BIB2","series-title":"Proc. 7th MFCS","first-page":"112","article-title":"On the completeness of query languages for relational data bases","volume":"64","author":"Bancilhon","year":"1978"},{"key":"10.1016\/0169-023X(88)90015-8_BIB3","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. and System Sci."},{"key":"10.1016\/0169-023X(88)90015-8_BIB4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","article-title":"Structure and complexity of relational queries","volume":"25","author":"Chandra","year":"1982","journal-title":"J. Comp. and System Sci."},{"key":"10.1016\/0169-023X(88)90015-8_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(85)90002-0","article-title":"Horn clause queries and generalizations","volume":"1","author":"Chandra","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0169-023X(88)90015-8_BIB6","first-page":"65","article-title":"Relational completeness of data base sublanguages","volume":"6","author":"Codd","year":"1971"},{"key":"10.1016\/0169-023X(88)90015-8_BIB7","doi-asserted-by":"crossref","DOI":"10.1145\/358886.358892","article-title":"On folk theorems","author":"Harel","year":"1980","journal-title":"Commun. ACM"},{"key":"10.1016\/0169-023X(88)90015-8_BIB8","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1145\/24697.24698","article-title":"Logic and Databases: A critique","volume":"22","author":"Harel","year":"1987","journal-title":"SIGPLAN NOTICES"},{"issue":"4","key":"10.1016\/0169-023X(88)90015-8_BIB9","first-page":"986","article-title":"Equivalence of relational algebra and relational calculus query languages having aggregate functions","volume":"29","author":"Klug","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0169-023X(88)90015-8_BIB10","series-title":"The Theory of Relational Databases","author":"Maier","year":"1983"},{"key":"10.1016\/0169-023X(88)90015-8_BIB11","series-title":"Proc. 8th ICALP","first-page":"86","article-title":"Characterizing data base dependencies","volume":"115","author":"Makowsky","year":"1981"},{"key":"10.1016\/0169-023X(88)90015-8_BIB12","series-title":"Proc. 3rd Int. Logic Programming Conference","first-page":"544","article-title":"A new approach for introducing Prolog to naive users","volume":"225","author":"Maler","year":"1986"},{"key":"10.1016\/0169-023X(88)90015-8_BIB13","series-title":"Logic and Data Bases","first-page":"39","article-title":"High level data base query languages","author":"Pirotte","year":"1978"},{"key":"10.1016\/0169-023X(88)90015-8_BIB14","series-title":"Proc. SOFSEM'86","first-page":"79","article-title":"From the relational model towards efficient database systems","author":"Steiner","year":"1986"},{"key":"10.1016\/0169-023X(88)90015-8_BIB15","series-title":"Theoretical aspects of new generation computing systems","first-page":"77","article-title":"First-order queries and first-order query languages","author":"Steiner","year":"1987"},{"key":"10.1016\/0169-023X(88)90015-8_BIB16","series-title":"Principles of Database Systems","author":"Ullman","year":"1982"},{"issue":"4","key":"10.1016\/0169-023X(88)90015-8_BIB17","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1147\/sj.164.0324","article-title":"Query-by-example: a data base language","volume":"16","author":"Zloof","year":"1977","journal-title":"IBM Systems J."}],"container-title":["Data & Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169023X88900158?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169023X88900158?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T11:25:56Z","timestamp":1553599556000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0169023X88900158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,11]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,11]]}},"alternative-id":["0169023X88900158"],"URL":"https:\/\/doi.org\/10.1016\/0169-023x(88)90015-8","relation":{},"ISSN":["0169-023X"],"issn-type":[{"value":"0169-023X","type":"print"}],"subject":[],"published":{"date-parts":[[1988,11]]}}}