{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:50:29Z","timestamp":1725529829078},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642006715"},{"type":"electronic","value":"9783642006722"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00672-2_53","type":"book-chapter","created":{"date-parts":[[2009,3,21]],"date-time":"2009-03-21T17:04:48Z","timestamp":1237655088000},"page":"568-575","source":"Crossref","is-referenced-by-count":1,"title":["Optimal K-Nearest-Neighbor Query in Data Grid"],"prefix":"10.1007","author":[{"given":"Yi","family":"Zhuang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiyang","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"53_CR1","volume-title":"The Grid : Blueprint for a New Computing Infrastructure","author":"I. Foster","year":"1998","unstructured":"Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1998)"},{"key":"53_CR2","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, C., Berchtold, S., Keim, D.: Searching in High-dimensional Spaces: Index Structures for Improving the Performance of Multimedia Databases. ACM Computing Surveys\u00a033(3) (2001)","DOI":"10.1145\/502807.502809"},{"issue":"2","key":"53_CR3","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"H.V. Jagadish","year":"2005","unstructured":"Jagadish, H.V., Ooi, B.C., Tan, K.L., Yu, C., Zhang, R.: iDistance: An Adaptive B+-tree Based Indexing Method for Nearest Neighbor Search. TODS\u00a030(2), 364\u2013397 (2005)","journal-title":"TODS"},{"key":"53_CR4","doi-asserted-by":"crossref","unstructured":"Berchtold, S., Bohm, C., Braunmuller, B., Keim, D.A., et al.: Fast Parallel Similarity Search in Multimedia Databases. In: SIGMOD, pp. 1\u201312","DOI":"10.1145\/253260.253263"},{"key":"53_CR5","doi-asserted-by":"crossref","unstructured":"Zhuang, Y., Zhuang, Y.T., Li, Q., Wu, F.: Speeding Up Similarity Queries over Large Chinese Calligraphic Character Databases Using Data Grid. In: GCC, pp. 225\u2013236 (2007)","DOI":"10.1109\/GCC.2007.118"},{"key":"53_CR6","unstructured":"UCI KDD Archive (2002), http:\/\/www.kdd.ics.uci.edu"}],"container-title":["Lecture Notes in Computer Science","Advances in Data and Web Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00672-2_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T00:53:52Z","timestamp":1558227232000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00672-2_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642006715","9783642006722"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00672-2_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}