{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T19:36:58Z","timestamp":1703187418671},"reference-count":4,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,4,1]],"date-time":"1989-04-01T00:00:00Z","timestamp":607392000000},"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":8873,"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":[[1989,4]]},"DOI":"10.1016\/0022-0000(89)90006-8","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"341-359","source":"Crossref","is-referenced-by-count":6,"title":["On the convergence of query evaluation"],"prefix":"10.1016","volume":"38","author":[{"given":"Foto","family":"Afrati","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos H.","family":"Papadimitriou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Papageorgiou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Athena","family":"Roussou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yehoshua","family":"Sagiv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey D.","family":"Ullman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(89)90006-8_BIB1","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0022-0000(89)90006-8_BIB2","series-title":"Automatic Generation of Control for Logic Programs","author":"Naish","year":"1983"},{"key":"10.1016\/0022-0000(89)90006-8_BIB3","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationships between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System Sci."},{"issue":"No. 3","key":"10.1016\/0022-0000(89)90006-8_BIB4","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/3979.3980","article-title":"Implementation of logical query languages for databases","volume":"10","author":"Ullman","year":"1985","journal-title":"ACM Trans. Database Systems"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900068?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900068?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:54:49Z","timestamp":1550325289000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000089900068"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,4]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,4]]}},"alternative-id":["0022000089900068"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(89)90006-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1989,4]]}}}