{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T19:30:45Z","timestamp":1673292645802},"reference-count":12,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0020-0190(01)00279-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:03:54Z","timestamp":1027605834000},"page":"269-276","source":"Crossref","is-referenced-by-count":4,"title":["Processing a multimedia join through the method of nearest neighbor search"],"prefix":"10.1016","volume":"82","author":[{"given":"Harald","family":"Kosch","sequence":"first","affiliation":[]},{"given":"Solomon","family":"Atnafu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00279-4_BIB001","first-page":"1","article-title":"Image retrieval: Past present and future","volume":"10","author":"Rui","year":"1999","journal-title":"J. Visual Comm. Image Representation"},{"key":"10.1016\/S0020-0190(01)00279-4_BIB002","article-title":"Query reformulation for content based multimedia retrieval in MARS","volume":"2","author":"Porkaew","year":"1999"},{"key":"10.1016\/S0020-0190(01)00279-4_BIB003","series-title":"Proc. Internat. Conference on Data Engineering (ICDE), San Diego, CA","first-page":"672","article-title":"DISIMA: An object-oriented approach to developing an image database system","author":"Oria","year":"2000"},{"key":"10.1016\/S0020-0190(01)00279-4_BIB004","series-title":"Proc. Internat. Conference on Data Engineering (ICDE), Sydney, Australia","first-page":"22","article-title":"Query processing issues in image (multimedia) databases","author":"Nepal","year":"1999"},{"key":"10.1016\/S0020-0190(01)00279-4_BIB005","series-title":"Proc. ACM SIGMOD Internat. Conf. on Management of Data, Washington, DC","first-page":"10","article-title":"Efficient processing of spatial joins using R-trees","author":"Brinkhoff","year":"1993"},{"key":"10.1016\/S0020-0190(01)00279-4_BIB006","series-title":"Proc. ACM SIGMOD Conf. on Management of Data, Seattle, WA","first-page":"237","article-title":"Incremental distance join algorithms for spatial databases","author":"Hjaltason","year":"1998"},{"key":"10.1016\/S0020-0190(01)00279-4_BIB007","series-title":"Proc. ACM SIGMOD Conf. on Management of Data, Dallas, TX","first-page":"189","article-title":"Closest pair queries in spatial databases","author":"Corral","year":"2000"},{"key":"10.1016\/S0020-0190(01)00279-4_BIB008","series-title":"Proc. Internat. Conf. on Data Engineering (ICDE), Sydney, Australia","first-page":"440","article-title":"The hybrid tree: An index structure for high dimensional feature spaces","author":"Chakrabarti","year":"1999"},{"key":"10.1016\/S0020-0190(01)00279-4_BIB009","series-title":"Proc. VLDB Conference, Bombay, India","first-page":"28","article-title":"The X-tree: An indexing structure for high-dimensional data","author":"Berchtold","year":"1996"},{"issue":"1","key":"10.1016\/S0020-0190(01)00279-4_BIB010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s007780050030","article-title":"The hB\u03c0 tree: A multi-attribute index supporting concurrency, recovery and node consolidation","volume":"6","author":"Evangelidis","year":"1997","journal-title":"VLDB J."},{"key":"10.1016\/S0020-0190(01)00279-4_BIB011","series-title":"Proc. SPIE Storage and Retrieval of Image and Video Databases, San Jose, CA","first-page":"110","article-title":"The SS+-tree: An improved index structure for similarity searches in a high-dimensional feature space","author":"Kurniawati","year":"1997"},{"key":"10.1016\/S0020-0190(01)00279-4_BIB012","series-title":"Processing a multimedia join through the method of nearest neighbor search (extended version), Technical Report TR\/ITEC\/01\/2.02","author":"Kosch","year":"2001"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002794?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002794?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:53:03Z","timestamp":1556481183000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002794"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0020019001002794"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00279-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}