{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T07:07:20Z","timestamp":1723014440591},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,8,1]],"date-time":"2015-08-01T00:00:00Z","timestamp":1438387200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s10878-015-9927-1","type":"journal-article","created":{"date-parts":[[2015,7,31]],"date-time":"2015-07-31T07:15:00Z","timestamp":1438326900000},"page":"1107-1132","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Enabling high-dimensional range queries using kNN indexing techniques: approaches and empirical results"],"prefix":"10.1007","volume":"32","author":[{"given":"Tim","family":"Wylie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Schuh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafal A.","family":"Angryk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,1]]},"reference":[{"key":"9927_CR1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F Aurenhammer","year":"1991","unstructured":"Aurenhammer F (1991) Voronoi diagrams\u2014a survey of a fundamental geometric data structure. ACM Comput Surv 23:345\u2013405. doi: 10.1145\/116873.116880","journal-title":"ACM Comput Surv"},{"key":"9927_CR2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R Bayer","year":"1972","unstructured":"Bayer R, McCreight EM (1972) Organization and maintenance of large ordered indices. Acta Inform 1:173\u2013189","journal-title":"Acta Inform"},{"key":"9927_CR3","doi-asserted-by":"crossref","DOI":"10.1515\/9781400874668","volume-title":"Adaptive control processes: a guided tour","author":"R Bellman","year":"1961","unstructured":"Bellman R, Bellman RE (1961) Adaptive control processes: a guided tour, vol 4. Princeton University Press, Princeton"},{"key":"9927_CR4","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1145\/276305.276318","volume":"27","author":"S Berchtold","year":"1998","unstructured":"Berchtold S, B\u00f6hm C, Kriegal HP (1998) The pyramid-technique: towards breaking the curse of dimensionality. SIGMOD Rec 27:142\u2013153","journal-title":"SIGMOD Rec"},{"key":"9927_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational geometry: algorithms and applications","author":"M Berg de","year":"2008","unstructured":"de Berg M, Cheong O, van Kreveld M, Overmars M (2008) Computational geometry: algorithms and applications, 3rd edn. Springer, Heidelberg","edition":"3"},{"issue":"2","key":"9927_CR6","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1145\/77600.77614","volume":"37","author":"B Chazelle","year":"1990","unstructured":"Chazelle B (1990) Lower bounds for orthogonal range searching: I. The reporting case. J ACM 37(2):200\u2013212. doi: 10.1145\/77600.77614","journal-title":"J ACM"},{"issue":"2","key":"9927_CR7","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10878-006-7132-y","volume":"11","author":"Z Chen","year":"2006","unstructured":"Chen Z, Fu B, Tang Y, Zhu B (2006) A ptas for a disc covering problem using width-bounded separators. J Comb Optim 11(2):203\u2013217. doi: 10.1007\/s10878-006-7132-y","journal-title":"J Comb Optim"},{"key":"9927_CR8","unstructured":"Doulkeridis C, Vlachou A, Kotidis Y, Vazirgiannis M (2007) Peer-to-peer similarity search in metric spaces. In: Proceedings of the 33rd international conference on very large data bases, VLDB\u201907, pp 986\u2013997"},{"key":"9927_CR9","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD international conference on management of data, pp 47\u201357","DOI":"10.1145\/602259.602266"},{"key":"9927_CR10","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s00454-005-1210-2","volume":"36","author":"TC Hales","year":"2006","unstructured":"Hales TC (2006) Historical overview of the kepler conjecture. Discret Comput Geom 36:5\u201320","journal-title":"Discret Comput Geom"},{"key":"9927_CR11","unstructured":"Hales TC (2014) The flyspeck project. https:\/\/code.google.com\/p\/flyspeck\/ . Accessed 10 Oct 2014"},{"key":"9927_CR12","unstructured":"Hales TC, McLaughlin S (2008) A proof of the dodecahedral conjecture. CoRR abs\/9811079, 9811079v3"},{"issue":"8","key":"9927_CR13","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1109\/TMC.2006.118","volume":"5","author":"S Ilarri","year":"2006","unstructured":"Ilarri S, Mena E, Illarramendi A (2006) Location-dependent queries in mobile contexts: distributed processing using mobile agents. IEEE Trans Mob Comput 5(8):1029\u20131043","journal-title":"IEEE Trans Mob Comput"},{"key":"9927_CR14","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"HV Jagadish","year":"2005","unstructured":"Jagadish HV, Ooi BC, Tan KL, Yu C, Zhang R (2005) iDistance: an adaptive B+-tree based indexing method for nearest neighbor search. ACM Trans Database Syst 30:364\u2013397","journal-title":"ACM Trans Database Syst"},{"issue":"2","key":"9927_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/tit.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd SP (1982) Least squares quantization in PCM. IEEE Trans Inf Theory 28(2):129\u2013137. doi: 10.1109\/tit.1982.1056489","journal-title":"IEEE Trans Inf Theory"},{"key":"9927_CR16","doi-asserted-by":"crossref","unstructured":"Lowe D (1999) Object recognition from local scale-invariant features. In: Proceedings of the 7th IEEE international conference on computer vision, vol 2, pp 1150\u20131157","DOI":"10.1109\/ICCV.1999.790410"},{"issue":"1","key":"9927_CR17","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10878-013-9701-1","volume":"29","author":"Y Lu","year":"2015","unstructured":"Lu Y, Chen D, Cha J (2015) Packing cubes into a cube is NP-complete in the strong sense. J Comb Optim 29(1):197\u2013215. doi: 10.1007\/s10878-013-9701-1","journal-title":"J Comb Optim"},{"key":"9927_CR18","unstructured":"MacQueen JB (1967) Some methods for classification and analysis of multivariate observations. In: Cam LML, Neyman J (eds) Proceedings of the 5th Berkeley symposium on Mathematical Statistics and Probability, UC Press, vol 1, pp 281\u2013297"},{"key":"9927_CR19","doi-asserted-by":"crossref","unstructured":"Ooi BC, Tan KL, Yu C, Bressan S (2000) Indexing the edges: a simple and yet efficient approach to high-dimensional indexing. In: Proceedings of the 19th ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems, ACM, New York, PODS\u201900, pp 166\u2013174","DOI":"10.1145\/335168.335219"},{"key":"9927_CR20","doi-asserted-by":"crossref","unstructured":"Qu L, Chen Y, Yang X (2008) iDistance based interactive visual surveillance retrieval algorithm. In: Intelligent Computation Technology and Automation (ICICTA), IEEE, vol 1, pp 71\u201375","DOI":"10.1109\/ICICTA.2008.13"},{"key":"9927_CR21","volume-title":"Foundations of multidimensional and metric data structures (The Morgan Kaufmann series in computer graphics and geometric modeling)","author":"H Samet","year":"2006","unstructured":"Samet H (2006) Foundations of multidimensional and metric data structures (The Morgan Kaufmann series in computer graphics and geometric modeling). Morgan Kaufmann Publishers Inc., San Francisco"},{"key":"9927_CR22","doi-asserted-by":"crossref","unstructured":"Schuh MA, Wylie T, Angryk RA (2013a) Improving the performance of high-dimensional knn retrieval through localized dataspace segmentation and hybrid indexing. In: Advances in databases and information systems (ADBIS\u201913). Lecture notes in computer science, vol 8133. Springer, Berlin, pp 344\u2013357","DOI":"10.1007\/978-3-642-40683-6_26"},{"key":"9927_CR23","doi-asserted-by":"crossref","unstructured":"Schuh MA, Wylie T, Banda JM, Angryk RA (2013b) A comprehensive study of idistance partitioning strategies for knn queries and high-dimensional data indexing. In: The 29th British national conference on databases (BNCOD\u201913). Lecture notes in computer science, vol 7968. Springer, Berlin, pp 238\u2013252","DOI":"10.1007\/978-3-642-39467-6_22"},{"key":"9927_CR24","unstructured":"Schuh MA, Wylie T, Angryk RA (2014a) Mitigating the curse of dimensionality for exact knn retrieval. In: Proceedings of the 27th international Florida artifical intelligence research society conference, FLAIRS\u201914, pp 363\u2013368"},{"key":"9927_CR25","doi-asserted-by":"crossref","unstructured":"Schuh MA, Wylie T, Liu C, Angryk RA (2014b) Approximating high-dimensional range queries with knn indexing techniques. In: The 20th international computing and combinatorics conference (COCOON\u201914). Lecture notes in computer science, vol 8591, pp 369\u2013380","DOI":"10.1007\/978-3-319-08783-2_32"},{"key":"9927_CR26","doi-asserted-by":"crossref","unstructured":"Shen HT (2005) Towards effective indexing for very large video sequence database. In: Proceedings of the ACM SIGMOD international conference on management of data, SIGMOD\u201905, pp 730\u2013741","DOI":"10.1145\/1066157.1066240"},{"issue":"4","key":"9927_CR27","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"JK Uhlmann","year":"1991","unstructured":"Uhlmann JK (1991) Satisfying general proximity\/similarity queries with metric trees. Inf Process Lett 40(4):175\u2013179","journal-title":"Inf Process Lett"},{"key":"9927_CR28","unstructured":"Yu C, Ooi BC, Tan KL, Jagadish HV (2001) Indexing the distance: an efficient method to KNN processing. In: Proceedings of the 27th international conference on very large data bases, Morgan Kaufmann Publishers Inc., San Francisco, VLDB\u201901, pp 421\u2013430"},{"key":"9927_CR29","unstructured":"Zhang J, Zhou X, Wang W, Shi B, Pei J (2006) Using high dimensional indexes to support relevance feedback based interactive images retrieval. In: Proceedings of the 32nd international conference on very large data bases, VLDB\u201906, pp 1211\u20131214"},{"key":"9927_CR30","doi-asserted-by":"crossref","unstructured":"Zhang R, Ooi B, Tan KL (2004) Making the pyramid technique robust to query types and workloads. In: Proceedings of the 20th international conference on data engineering, pp 313\u2013324","DOI":"10.1109\/ICDE.2004.1320007"},{"key":"9927_CR31","doi-asserted-by":"crossref","unstructured":"Zhu B (2007) On the 1-density of unit ball covering. CoRR abs\/0711.2092, 0711.2092v4","DOI":"10.1055\/s-2007-968654"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9927-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9927-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9927-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9927-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T23:08:05Z","timestamp":1567033685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9927-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,1]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["9927"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9927-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,1]]}}}