{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:35:39Z","timestamp":1760146539496},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,10,1]],"date-time":"1990-10-01T00:00:00Z","timestamp":654739200000},"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":8325,"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,10]]},"DOI":"10.1016\/0022-0000(90)90036-k","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"181-229","source":"Crossref","is-referenced-by-count":65,"title":["Procedural languages for database queries and updates"],"prefix":"10.1016","volume":"41","author":[{"given":"Serge","family":"Abiteboul","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Vianu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(90)90036-K_BIB1","series-title":"Proceedings, ACM SIGACT\/SIGMOD Sympos. on Principles of Database Systems","first-page":"193","article-title":"Transactions and integrity constraints","author":"Abiteboul","year":"1985"},{"key":"10.1016\/0022-0000(90)90036-K_BIB2","series-title":"Proceedings, Third Intern. Conf. on Data and Knowledge Bases","first-page":"324","article-title":"The connection of static constraints with determinism and boundedness of dynamic specifications","author":"Abiteboul","year":"1988"},{"key":"10.1016\/0022-0000(90)90036-K_BIB3","series-title":"Proceedings, ACM SIGACT-SIGMOD-SIGACT Sympos. on Principles of Database Systems","first-page":"240","article-title":"Procedural and declarative database update languages","author":"Abiteboul","year":"1988"},{"key":"10.1016\/0022-0000(90)90036-K_BIB4","article-title":"Datalog extensions for database queries and updates","author":"Abiteboul","year":"1988","journal-title":"INRIA Technical Report 900"},{"key":"10.1016\/0022-0000(90)90036-K_BIB5","series-title":"Proceedings, 4th Sympos. on Logic in Computer Science","first-page":"71","article-title":"Fixpoint extensions of first-order logic and Datalog-like languages","author":"Abiteboul","year":"1989"},{"key":"10.1016\/0022-0000(90)90036-K_BIB6","series-title":"Proceedings 6th ACM Sympos. on Principles of Programm. Languages","first-page":"110","article-title":"Universality of data retrieval languages","author":"Aho","year":"1979"},{"key":"10.1016\/0022-0000(90)90036-K_BIB7","series-title":"Proceedings, 7th Sympos. on Mathematical Foundations of Computing","first-page":"112","article-title":"On the completeness of query languages","author":"Bancilhon","year":"1978"},{"issue":"No. 2","key":"10.1016\/0022-0000(90)90036-K_BIB8","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-0000(80)90032-X","article-title":"Computable queries for relational databases","volume":"21","author":"Chandra","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(90)90036-K_BIB9","series-title":"Proceedings, ACM Sympos. on Principles of Programming Languages","first-page":"50","article-title":"Programming primitives for database languages","author":"Chandra","year":"1981"},{"key":"10.1016\/0022-0000(90)90036-K_BIB10","unstructured":"A. K. CHANDRA, personal communication."},{"key":"10.1016\/0022-0000(90)90036-K_BIB11","series-title":"Second Int'l Conf. on Database Theory","first-page":"87","article-title":"On the composition and decomposition of Datalog program mappings","author":"Dong","year":"1988"},{"key":"10.1016\/0022-0000(90)90036-K_BIB12","series-title":"Trends in Theoretical Computer Science","first-page":"1","article-title":"Logic and the challenge of computer science","author":"Gurevich","year":"1988"},{"key":"10.1016\/0022-0000(90)90036-K_BIB13","series-title":"IEEE Sympos. on Foundations of Computer Science","first-page":"346","article-title":"Fixed-point extensions of first-order logic","author":"Gurevich","year":"1985"},{"key":"10.1016\/0022-0000(90)90036-K_BIB14","series-title":"Formal Languages and Their Relation to Automata","author":"Hopcroft","year":"1969"},{"issue":"No. 3","key":"10.1016\/0022-0000(90)90036-K_BIB15","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1145\/828.832","article-title":"The format model: A theory of data organization","volume":"31","author":"Hull","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(90)90036-K_BIB16","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","article-title":"Relational queries computable in polynomial time","volume":"68","author":"Immerman","year":"1986","journal-title":"Inform. and Control."},{"key":"10.1016\/0022-0000(90)90036-K_BIB17","series-title":"The Theory of Relational Databases","author":"Maier","year":"1983"},{"issue":"No. 2","key":"10.1016\/0022-0000(90)90036-K_BIB18","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/0020-0190(78)90055-8","article-title":"On the expressive power of the relational algebra","volume":"7","author":"Paredaens","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(90)90036-K_BIB19","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationship between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0022-0000(90)90036-K_BIB20","volume":"Vol. 1","author":"Ullman","year":"1988"},{"key":"10.1016\/0022-0000(90)90036-K_BIB21","series-title":"14th ACM Sympos. on Theory of Computing","first-page":"137","article-title":"Relational queries computable in polynomial time","author":"Vardi","year":"1982"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090036K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090036K?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:55:56Z","timestamp":1550307356000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009090036K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,10]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,10]]}},"alternative-id":["002200009090036K"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(90)90036-k","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1990,10]]}}}