{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:22:59Z","timestamp":1725736979241},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642394669"},{"type":"electronic","value":"9783642394676"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39467-6_22","type":"book-chapter","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T01:33:16Z","timestamp":1372123996000},"page":"238-252","source":"Crossref","is-referenced-by-count":7,"title":["A Comprehensive Study of iDistance Partitioning Strategies for kNN Queries and High-Dimensional Data Indexing"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Schuh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Wylie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan M.","family":"Banda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafal A.","family":"Angryk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_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":"22_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":"22_CR3","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/93605.98741","volume":"19","author":"N. Beckmann","year":"1990","unstructured":"Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. SIGMOD Rec.\u00a019, 322\u2013331 (1990)","journal-title":"SIGMOD Rec."},{"key":"22_CR4","unstructured":"Bellman, R.: Dynamic Programming. Princeton University Press (1957)"},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1145\/276305.276318","volume":"27","author":"S. Berchtold","year":"1998","unstructured":"Berchtold, S., Bhm, C., Kriegal, H.P.: The pyramid-technique: towards breaking the curse of dimensionality. ACM SIGMOD Record\u00a027(2), 142\u2013153 (1998)","journal-title":"ACM SIGMOD Record"},{"key":"22_CR6","unstructured":"Doulkeridis, C., Vlachou, A., Kotidis, Y., Vazirgiannis, M.: Peer-to-peer similarity search in metric spaces. In: VLDB 2007 (2007)"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/971697.602266","volume":"14","author":"A. Guttman","year":"1984","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. SIGMOD Rec.\u00a014, 47\u201357 (1984)","journal-title":"SIGMOD Rec."},{"key":"22_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":"22_CR9","first-page":"604","volume-title":"Proc. of the 30th Annual ACM Symposium on Theory of Computing, STOC 1998","author":"P. Indyk","year":"1998","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proc. of the 30th Annual ACM Symposium on Theory of Computing, STOC 1998, pp. 604\u2013613. ACM, New York (1998)"},{"issue":"2","key":"22_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":"22_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":"22_CR12","unstructured":"MacQueen, J.B.: Some methods for classification and analysis of multivariate observations. In: Cam, L.M.L., Neyman, J. (eds.) Proc. of the fifth Berkeley Symposium on Mathematical Statistics and Probability, vol.\u00a01, pp. 281\u2013297. University of California Press (1967)"},{"key":"22_CR13","first-page":"166","volume-title":"Proc. of the 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2000","author":"B.C. Ooi","year":"2000","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 Symposium on Principles of Database Systems, PODS 2000, pp. 166\u2013174. ACM, New York (2000)"},{"key":"22_CR14","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), vol.\u00a01, pp. 71\u201375 (October 2008)","DOI":"10.1109\/ICICTA.2008.13"},{"key":"22_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":"22_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":"22_CR17","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1145\/2247596.2247654","volume-title":"Proc. of the 15th Inter. Conf. on Extending Database Technology, EDBT 2012","author":"V. Singh","year":"2012","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, New York (2012)"},{"key":"22_CR18","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/1559845.1559905","volume-title":"Proc. of the 2009 ACM SIGMOD Inter. Conf. on Mgmt. of Data, SIGMOD 2009","author":"Y. Tao","year":"2009","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, New York (2009)"},{"key":"22_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":"22_CR20","first-page":"421","volume-title":"Proc. of the 27th Inter. Conf. on Very Large Data Bases, VLDB 2001","author":"C. Yu","year":"2001","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. Morgan Kaufmann Publishers Inc., San Francisco (2001)"},{"key":"22_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":"22_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)"},{"issue":"2","key":"22_CR23","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/235968.233324","volume":"25","author":"T. Zhang","year":"1996","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: Birch: an efficient data clustering method for very large databases. SIGMOD Rec.\u00a025(2), 103\u2013114 (1996)","journal-title":"SIGMOD Rec."}],"container-title":["Lecture Notes in Computer Science","Big Data"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39467-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,26]],"date-time":"2022-02-26T05:52:36Z","timestamp":1645854756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39467-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642394669","9783642394676"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39467-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}