{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T23:29:41Z","timestamp":1707953381891},"reference-count":0,"publisher":"Oxford University Press (OUP)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2005,2,1]]},"DOI":"10.1093\/comjnl\/bxh060","type":"journal-article","created":{"date-parts":[[2005,4,27]],"date-time":"2005-04-27T20:07:39Z","timestamp":1114632459000},"page":"220-238","source":"Crossref","is-referenced-by-count":12,"title":["On Approximate Algorithms for Distance-Based Queries using R-trees"],"prefix":"10.1093","volume":"48","author":[{"given":"A.","family":"Corral","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/48\/2\/220\/1545283\/bxh060.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T02:48:23Z","timestamp":1503456503000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxh060"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2,1]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,2,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxh060","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,2,1]]}}}