{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:20:41Z","timestamp":1725744041682},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642406829"},{"type":"electronic","value":"9783642406836"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40683-6_26","type":"book-chapter","created":{"date-parts":[[2013,8,6]],"date-time":"2013-08-06T01:36:14Z","timestamp":1375752974000},"page":"344-357","source":"Crossref","is-referenced-by-count":6,"title":["Improving the Performance of High-Dimensional kNN Retrieval through Localized Dataspace Segmentation and Hybrid Indexing"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Schuh","sequence":"first","affiliation":[]},{"given":"Tim","family":"Wylie","sequence":"additional","affiliation":[]},{"given":"Rafal A.","family":"Angryk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"Aurenhammer, F.: Voronoi diagrams \u2013 a survey of a fundamental geometric data structure. ACM Comput. Surv.\u00a023, 345\u2013405 (1991)","journal-title":"ACM Comput. Surv."},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R., McCreight, E.M.: Organization and maintenance of large ordered indices. Acta Informatica\u00a01, 173\u2013189 (1972)","journal-title":"Acta Informatica"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: Proc. of ACM SIGMOD Inter. Conf. on Management of Data, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"key":"26_CR4","unstructured":"Bellman, R.: Dynamic Programming. Princeton University Press (1957)"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Berchtold, S., Bhm, C., Kriegal, H.P.: The pyramid-technique: towards breaking the curse of dimensionality. In: Proc. of ACM SIGMOD Inter. Conf. on Management of Data, vol.\u00a027, pp. 142\u2013153 (1998)","DOI":"10.1145\/276305.276318"},{"key":"26_CR6","unstructured":"Doulkeridis, C., Vlachou, A., Kotidis, Y., Vazirgiannis, M.: Peer-to-peer similarity search in metric spaces. In: VLDB 2007 (2007)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proc. of the ACM SIGMOD Inter. Conf. on Management of Data, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"key":"26_CR8","first-page":"1029","volume":"5","author":"S. Ilarri","year":"2006","unstructured":"Ilarri, S., Mena, E., Illarramendi, A.: Location-dependent queries in mobile contexts: Distributed processing using mobile agents. IEEE TMC\u00a05, 1029\u20131043 (2006)","journal-title":"IEEE TMC"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proc. of the 30th Annual ACM Sym. on Theory of Computing, STOC 1998, pp. 604\u2013613. ACM (1998)","DOI":"10.1145\/276698.276876"},{"issue":"2","key":"26_CR10","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\u2009+\u2009-tree based indexing method for nearest neighbor search. ACM Trans. Database Syst.\u00a030(2), 364\u2013397 (2005)","journal-title":"ACM Trans. Database Syst."},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Lowe, D.: Object recognition from local scale-invariant features. In: The Proc. of the 7th IEEE Inter. Conf. on Computer Vision, vol.\u00a02, pp. 1150\u20131157 (1999)","DOI":"10.1109\/ICCV.1999.790410"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Ooi, B.C., Tan, K.L., Yu, C., Bressan, S.: Indexing the edges: a simple and yet efficient approach to high-dimensional indexing. In: Proc. of the 19th ACM SIGMOD-SIGACT-SIGART Sym. on Principles of DB Systems, PODS 2000, pp. 166\u2013174 (2000)","DOI":"10.1145\/335168.335219"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Qu, L., Chen, Y., Yang, X.: iDistance based interactive visual surveillance retrieval algorithm. In: Intelligent Computation Technology and Automation, ICICTA 2008, vol.\u00a01, pp. 71\u201375 (October 2008)","DOI":"10.1109\/ICICTA.2008.13"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-39467-6_22","volume-title":"Big Data","author":"M.A. Schuh","year":"2013","unstructured":"Schuh, M.A., Wylie, T., Banda, J.M., Angryk, R.A.: A comprehensive study of iDistance partitioning strategies for kNN queries and high-dimensional data indexing. In: Gottlob, G., Grasso, G., Olteanu, D., Schallhart, C. (eds.) BNCOD 2013. LNCS, vol.\u00a07968, pp. 238\u2013252. Springer, Heidelberg (2013)"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Shen, H.T.: Towards effective indexing for very large video sequence database. In: SIGMOD Conference, pp. 730\u2013741 (2005)","DOI":"10.1145\/1066157.1066240"},{"key":"26_CR16","unstructured":"Shi, Q., Nickerson, B.: Decreasing Radius K-Nearest Neighbor Search Using Mapping-based Indexing Schemes. Tech. rep., University of New Brunswick (2006)"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Singh, V., Singh, A.K.: Simp: accurate and efficient near neighbor search in high dimensional spaces. In: Proc. of the 15th Inter. Conf. on Extending Database Technology, EDBT 2012, pp. 492\u2013503. ACM (2012)","DOI":"10.1145\/2247596.2247654"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Tao, Y., Yi, K., Sheng, C., Kalnis, P.: Quality and efficiency in high dimensional nearest neighbor search. In: Proc. of the 2009 ACM SIGMOD Inter. Conf. on Mgmt. of Data, SIGMOD 2009, pp. 563\u2013576. ACM (2009)","DOI":"10.1145\/1559845.1559905"},{"key":"26_CR19","unstructured":"Wylie, T., Schuh, M.A., Sheppard, J., Angryk, R.A.: Cluster analysis for optimal indexing. In: Proc. of the 26th FLAIRS Conf. (2013)"},{"key":"26_CR20","unstructured":"Yu, C., Ooi, B.C., Tan, K.L., Jagadish, H.V.: Indexing the Distance: An Efficient Method to KNN Processing. In: Proc. of the 27th Inter. Conf. on Very Large Data Bases, VLDB 2001, pp. 421\u2013430 (2001)"},{"key":"26_CR21","unstructured":"Zhang, J., Zhou, X., Wang, W., Shi, B., Pei, J.: Using high dimensional indexes to support relevance feedback based interactive images retrieval. In: Proc. of the 32nd Inter. Conf. on Very Large Data Bases, VLDB 2006, pp. 1211\u20131214 (2006)"},{"key":"26_CR22","unstructured":"Zhang, R., Ooi, B., Tan, K.L.: Making the pyramid technique robust to query types and workloads. In: Proc. 20th Inter. Conf. on Data Eng., pp. 313\u2013324 (2004)"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases and Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40683-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T08:12:15Z","timestamp":1557994335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40683-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406829","9783642406836"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40683-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}