{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T12:46:29Z","timestamp":1648730789843},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,6,15]],"date-time":"2012-06-15T00:00:00Z","timestamp":1339718400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s11227-012-0800-z","type":"journal-article","created":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T13:42:31Z","timestamp":1340026951000},"page":"1362-1384","source":"Crossref","is-referenced-by-count":1,"title":["Distributed high dimensional indexing for k-NN search"],"prefix":"10.1007","volume":"62","author":[{"given":"Hyun-Hwa","family":"Choi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mi-Young","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyu-Chul","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,6,15]]},"reference":[{"key":"800_CR1","series-title":"LNCS","first-page":"592","volume-title":"Proceedings of the international conference on extending database technology","author":"K Nikos","year":"1996","unstructured":"Nikos K, Christos F, Ibrahim K (1996) Declustering spatial databases on a multi-computer architecture. In: Proceedings of the international conference on extending database technology. LNCS, vol\u00a01057, pp\u00a0592\u2013614"},{"key":"800_CR2","first-page":"68","volume-title":"Proceedings of the international conference on scientific and statistical database management","author":"S Bernd","year":"1999","unstructured":"Bernd S, Scott TL (1999) Master-client R-trees: a new parallel R-tree architecture. In: Proceedings of the international conference on scientific and statistical database management, pp\u00a068\u201377"},{"key":"800_CR3","first-page":"28","volume-title":"Proceedings of the IEEE workshop on applications of computer vision","author":"L Ting","year":"2007","unstructured":"Ting L, Charles R, Henry AR (2007) Clustering billions of images with large scale nearest neighbor search. In: Proceedings of the IEEE workshop on applications of computer vision, pp\u00a028\u201333"},{"key":"800_CR4","series-title":"LNCS","first-page":"83","volume-title":"Proceedings of the European conference on research and advanced technology for digital libraries","author":"W Roger","year":"2000","unstructured":"Roger W, Klemens B, Hans JS (2000) Interactive-time similarity search for large image collection using parallel VA-files. In: Proceedings of the European conference on research and advanced technology for digital libraries. LNCS, vol\u00a01923, pp\u00a083\u201392"},{"key":"800_CR5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/CIT.2008.4594657","volume-title":"Proceedings of the IEEE international conference on computer and information technology","author":"C Jaewoo","year":"2008","unstructured":"Jaewoo C, Ahreum L (2008) Parallel high-dimensional index structure for content-based information retrieval. In: Proceedings of the IEEE international conference on computer and information technology, pp\u00a0101\u2013106"},{"key":"800_CR6","unstructured":"Chi Z, Arvind K, Randolph YW (2004) SkipIndex: towards a scalable peer-to-peer index service for high dimensional data. Technical report TR-703-04, Princeton University"},{"key":"800_CR7","doi-asserted-by":"crossref","unstructured":"Beomseok N, Alan S (2005) DiST: fully decentralized indexing for querying distributed multidimensional datasets. Technical report CS-TR-4720 and UMIACS-TR-2005-28, Maryland University","DOI":"10.1109\/IPDPS.2006.1639280"},{"key":"800_CR8","first-page":"34","volume-title":"Proceedings of the international conference on data engineering","author":"HV Jagadish","year":"2006","unstructured":"Jagadish HV, Beng CO, Quang HV, Rong Z, Aoying Z (2006) VBI-tree: a peer-to-peer framework for supporting multi-dimensional indexing schemes. In: Proceedings of the international conference on data engineering, p\u00a034. doi: 10.1109\/ICDE.2006.169"},{"key":"800_CR9","first-page":"353","volume-title":"Proceedings of the international conference on world wide web","author":"B Mayank","year":"2005","unstructured":"Mayank B, Tyson C, Prasanna G (2005) LSH forest: self-tuning indexes for similarity search. In: Proceedings of the international conference on world wide web, pp\u00a0353\u2013366"},{"key":"800_CR10","volume-title":"Proceedings of the international workshop on the web and databases","author":"H Parisa","year":"2008","unstructured":"Parisa H, Sebastian M, Philippe C-M, Karl A (2008) LSH at large-distributed KNN search in high dimensions. In: Proceedings of the international workshop on the web and databases"},{"key":"800_CR11","first-page":"194","volume-title":"Proceedings of the international conference on very large data bases","author":"W Roger","year":"1998","unstructured":"Roger W, Hans JS, Stephen B (1998) A\u00a0quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proceedings of the international conference on very large data bases, pp 194\u2013205"},{"key":"800_CR12","unstructured":"Roger W, Stephen B (1997) An approximation-based data structure for similarity search. Technical report 24, ESPRIT project HERMES (no\u00a09141)"},{"key":"800_CR13","volume-title":"Proceedings of the international ACM SIGMOD conference","author":"TR John","year":"1981","unstructured":"John TR (1981) The K-D-B-tree: a search structure for large multidimensional dynamic indexes. In: Proceedings of the international ACM SIGMOD conference. doi: 10.1145\/582318.582321"},{"key":"800_CR14","first-page":"296","volume-title":"Proceedings of the IEEE international conference on data engineering","author":"BL David","year":"1989","unstructured":"David BL, Betty S (1989) A\u00a0robust multi-attribute search structure. In: Proceedings of the IEEE international conference on data engineering, pp\u00a0296\u2013304"},{"key":"800_CR15","first-page":"322","volume-title":"Proceedings of the international ACM SIGMOD conference","author":"B Norbert","year":"1990","unstructured":"Norbert B, Hans PK (1990) The R\u2217-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the international ACM SIGMOD conference, pp\u00a0322\u2013331"},{"key":"800_CR16","first-page":"28","volume-title":"Proceedings of the international conference on very large data bases","author":"B Stefan","year":"1996","unstructured":"Stefan B, Daniel AK, Hans PK (1996) The X-tree: an index structure for high-dimensional data. In: Proceedings of the international conference on very large data bases, pp\u00a028\u201339"},{"key":"800_CR17","first-page":"426","volume-title":"Proceedings of the international conference on very large data bases","author":"C Paolo","year":"1997","unstructured":"Paolo C, Marco P, Pavel Z (1997) M-tree: an efficient access method for similarity search in metric spaces. In: Proceedings of the international conference on very large data bases, pp\u00a0426\u2013435"},{"key":"800_CR18","first-page":"825","volume-title":"Proceedings of the international conference on neural information processing systems","author":"L Ting","year":"2004","unstructured":"Ting L, Andrew WM, Alexander G, Ke Y (2004) An investigation of practical approximate nearest neighbor algorithms. In: Proceedings of the international conference on neural information processing systems, pp\u00a0825\u2013832"},{"key":"800_CR19","series-title":"LNCS","first-page":"36","volume-title":"Proceedings of the international conference on extending database technology","author":"B Christian","year":"2000","unstructured":"Christian B, Hans PK (2000) Dynamically optimizing high-dimensional index structures. In: Proceedings of the international conference on extending database technology. LNCS, vol\u00a01777, pp\u00a036\u201350"},{"issue":"1","key":"800_CR20","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1109\/6046.985556","volume":"4","author":"HC Guang","year":"2002","unstructured":"Guang HC, Xiaoming Z, Dragutin P, Chin WC (2002) An efficient indexing method for nearest neighbor searches in high-dimensional image databases. IEEE Trans Multimed 4(1):76\u201387","journal-title":"IEEE Trans Multimed"},{"key":"800_CR21","series-title":"LNCS","first-page":"79","volume-title":"Proceedings of the international conference on database systems for advanced applications","author":"GH Sung","year":"2000","unstructured":"Sung GH, Jae WC (2000) A\u00a0new high-dimensional index structure using a cell-based filtering technique. In: Proceedings of the international conference on database systems for advanced applications. LNCS, vol\u00a01884, pp\u00a079\u201392"},{"key":"800_CR22","first-page":"518","volume-title":"Proceedings of the international conference on very large data bases","author":"G Aristides","year":"1999","unstructured":"Aristides G, Piotr I, Rajeev M (1999) Similarity search in high dimensions via hashing. In: Proceedings of the international conference on very large data bases, pp\u00a0518\u2013529"},{"key":"800_CR23","first-page":"64","volume-title":"Proceedings of the IEEE international conference on data engineering","author":"C Edith","year":"2000","unstructured":"Edith C, Mayur D, Shinji F, Aristides G, Piotr I, Rajeev M, Jeffrey DU, Cheng Y (2000) Finding interesting associations without support pruning. In: Proceedings of the IEEE international conference on data engineering, pp\u00a064\u201378"},{"key":"800_CR24","volume-title":"Statistics: an introductory analysis","author":"Y Taro","year":"1976","unstructured":"Taro Y (1976) Statistics: an introductory analysis"},{"key":"800_CR25","first-page":"65","volume-title":"Proceedings of the Australasian database conference","author":"C Paolo","year":"1998","unstructured":"Paolo C, Marco P, Pavel Z (1998) A\u00a0cost model for similarity queries in metric spaces. In: Proceedings of the Australasian database conference, pp\u00a065\u201376"},{"key":"800_CR26","unstructured":"http:\/\/www-deis.unibo.it\/research\/Mtree"},{"key":"800_CR27","unstructured":"Airphoto dataset, http:\/\/vivaldi.ece.ucsb.edu\/Manjunath\/research.htm"},{"key":"800_CR28","unstructured":"http:\/\/kdd.ics.uci.edu\/databases\/CorelFeatures\/CorelFeatures.data.html"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-012-0800-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-012-0800-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-012-0800-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T02:37:43Z","timestamp":1561862263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-012-0800-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,15]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["800"],"URL":"https:\/\/doi.org\/10.1007\/s11227-012-0800-z","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,15]]}}}