{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:55:13Z","timestamp":1759683313301,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022784"},{"type":"electronic","value":"9783642022791"}],"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-02279-1_30","type":"book-chapter","created":{"date-parts":[[2009,5,20]],"date-time":"2009-05-20T02:51:59Z","timestamp":1242787919000},"page":"417-434","source":"Crossref","is-referenced-by-count":3,"title":["Easing the Dimensionality Curse by Stretching Metric Spaces"],"prefix":"10.1007","author":[{"given":"Ives R. V.","family":"Pola","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Agma J. M.","family":"Traina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr.","given":"Caetano","family":"Traina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"12","key":"30_CR1","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1109\/34.895972","volume":"22","author":"A.W.M. Smeulders","year":"2000","unstructured":"Smeulders, A.W.M., Worring, M., Santini, S., Gupta, A., Jain, R.: Content-based image retrieval at the end of the early years. IEEE-PAMI\u00a022(12), 1349\u20131380 (2000)","journal-title":"IEEE-PAMI"},{"key":"30_CR2","unstructured":"G\u00fcntzer, U., Balke, W.T., Kiessling, W.: Optimizing multi-feature queries for image databases. In: VLDB, Cairo - Egypt, pp. 419\u2013428 (2000)"},{"key":"30_CR3","first-page":"295","volume-title":"ISM 2005: Proceedings of the Seventh IEEE International Symposium on Multimedia","author":"J.C. Felipe","year":"2005","unstructured":"Felipe, J.C., Traina, A.J.M., Caetano Traina, J.: Global warp metric distance: Boosting content-based image retrieval through histograms. In: ISM 2005: Proceedings of the Seventh IEEE International Symposium on Multimedia, Washington, DC, USA, pp. 295\u2013302. IEEE Computer Society, Los Alamitos (2005)"},{"key":"30_CR4","doi-asserted-by":"crossref","first-page":"1225","DOI":"10.1145\/1363686.1363969","volume-title":"23rd Annual ACM Symposium on Applied Computing (SAC 2008)","author":"H.P. Bugatti","year":"2008","unstructured":"Bugatti, H.P., Traina, A.J.M., Traina, C.J.: Assessing the best integration between distance-function and image-feature to answer similarity queries. In: 23rd Annual ACM Symposium on Applied Computing (SAC 2008), Fortaleza, Cear\u00e1 - Brazil, pp. 1225\u20131230. ACM Press, New York (2008)"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-49257-7_15","volume-title":"Database Theory - ICDT\u201999","author":"K. Beyer","year":"1998","unstructured":"Beyer, K., Godstein, J., Ramakrishnan, R., Shaft, U.: When is \u201dnearest neighbor\u201d meaningful? In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 217\u2013235. Springer, Heidelberg (1998)"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-44503-X_27","volume-title":"Database Theory - ICDT 2001","author":"C.C. Aggarwal","year":"2001","unstructured":"Aggarwal, C.C., Hinneburg, A., Keim, D.A.: On the surprising behavior of distance metrics in high dimensional spaces. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol.\u00a01973, pp. 420\u2013434. Springer, Heidelberg (2001)"},{"issue":"1","key":"30_CR7","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1109\/69.908983","volume":"13","author":"F. Korn","year":"2001","unstructured":"Korn, F., Pagel, B.U., Faloutsos, C.: On the \u2019dimensionality curse\u2019 and the \u2019self-similarity blessing\u2019. IEEE Transactions on Knowledge and Data Engineering (TKDE)\u00a013(1), 96\u2013111 (2001)","journal-title":"IEEE Transactions on Knowledge and Data Engineering (TKDE)"},{"issue":"2","key":"30_CR8","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V. Gaede","year":"1998","unstructured":"Gaede, V., G\u00fcnther, O.: Multidimensional access methods. ACM Computing Surveys\u00a030(2), 170\u2013231 (1998)","journal-title":"ACM Computing Surveys"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Berchtold, S., B\u00f6hm, C., Kriegel, H.P.: The pyramid-tree: Breaking the curse of dimensionality. In: ACM SIGMOD International Conference on Management of Data, Seattle, WA, pp. 142\u2013153 (1998)","DOI":"10.1145\/276305.276318"},{"key":"30_CR10","unstructured":"Yianilos, P.N.: Locally lifting the curse of dimensionality for nearest neighbor search. In: Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 361\u2013370 (2000)"},{"issue":"1","key":"30_CR11","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/3477.979959","volume":"32","author":"N. Papamarkos","year":"2002","unstructured":"Papamarkos, N., Atsalakis, A.E., Strouthopoulos, C.P.: Adaptive color reduction. IEEE Transactions on Systems, Man and Cybernetics\u00a032(1), 44\u201356 (2002)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"30_CR12","first-page":"178","volume-title":"SSIAI 2002","author":"M. Park","year":"2002","unstructured":"Park, M., Jin, J.S., Wilson, L.S.: Fast content-based image retrieval using quasi-gabor filter and reduction of image feature dimension. In: SSIAI 2002, Santa Fe, New Mexico, pp. 178\u2013182. IEEE Computer Society, Los Alamitos (2002)"},{"issue":"9","key":"30_CR13","first-page":"1208","volume":"17","author":"J. Ye","year":"2005","unstructured":"Ye, J., Li, Q., Xiong, H., Park, H., Janardan, R., Kumar, V.: Idr\/qr: An incremental dimension reduction algorithm via qr decomposition. TKDE\u00a017(9), 1208\u20131222 (2005)","journal-title":"TKDE"},{"issue":"3","key":"30_CR14","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E. Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R.A., Marroqu\u00edn, J.L.: Searching in metric spaces. ACM Computing Surveys\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Computing Surveys"},{"issue":"4","key":"30_CR15","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/958942.958948","volume":"21","author":"G.R. Hjaltason","year":"2003","unstructured":"Hjaltason, G.R., Samet, H.: Index-driven similarity search in metric spaces. ACM-TODS\u00a021(4), 517\u2013580 (2003)","journal-title":"ACM-TODS"},{"key":"30_CR16","first-page":"426","volume-title":"VLDB","author":"P. Ciaccia","year":"1997","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: Jarke, M. (ed.) VLDB, Athens, Greece, pp. 426\u2013435. Morgan Kaufmann, San Francisco (1997)"},{"issue":"2","key":"30_CR17","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1109\/69.991715","volume":"14","author":"C. Traina Jr.","year":"2002","unstructured":"Traina Jr., C., Traina, A.J.M., Faloutsos, C., Seeger, B.: Fast indexing and visualization of metric datasets using slim-trees. IEEE Transactions on Knowledge and Data Engineering (TKDE)\u00a014(2), 244\u2013260 (2002)","journal-title":"IEEE Transactions on Knowledge and Data Engineering (TKDE)"},{"key":"30_CR18","first-page":"623","volume-title":"ICDE","author":"R.F. Santos Filho","year":"2001","unstructured":"Santos Filho, R.F., Traina, A.J.M., Traina Jr., C., Faloutsos, C.: Similarity search without tears: The omni family of all-purpose access methods. In: ICDE, Heidelberg, Germany, pp. 623\u2013630. IEEE Computer Society Press, Los Alamitos (2001)"},{"issue":"1","key":"30_CR19","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(1), 364\u2013397 (2005)","journal-title":"TODS"},{"key":"30_CR20","unstructured":"Nadvorny, C.F., Heuser, C.A.: Twisting the metric space to achieve better metric trees. In: SBBD, pp. 178\u2013190 (2004)"},{"key":"30_CR21","first-page":"493","volume-title":"ICDE","author":"N. Katayama","year":"2001","unstructured":"Katayama, N., Satoh, S.: Distinctiveness-sensitive nearest neighbor search for efficient similarity retrieval of multimedia information. In: ICDE, Washington, DC, USA, pp. 493\u2013502. IEEE Computer Society Press, Los Alamitos (2001)"}],"container-title":["Lecture Notes in Computer Science","Scientific and Statistical Database Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02279-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T14:01:25Z","timestamp":1580306485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02279-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022784","9783642022791"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02279-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}