{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:17:51Z","timestamp":1725495471865},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001300"},{"type":"electronic","value":"9783540361282"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36128-6_22","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T22:20:41Z","timestamp":1194992441000},"page":"376-390","source":"Crossref","is-referenced-by-count":0,"title":["A Relaxed Algorithm for Similarity Queries Performed with High-Dimensional Access Structures"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Henrich","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. In Proc. ACM SIGMOD Conf., pages 322\u2013331, Atlantic City, N.J., USA, 1990.","DOI":"10.1145\/93597.98741"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"S. Berchtold, C. B\u00f6hm, D. Keim, and H.-P. Kriegel. A cost model for nearest neighbor search in high-dimensional data space. In Proc. 16th ACM Symposium on Principles of Database Systems, pages 78\u201386, Tucson, Arizona, 1997.","DOI":"10.1145\/263661.263671"},{"key":"22_CR3","unstructured":"S. Berchtold, D. Keim, and H.-P. Kriegel. The X-tree: An index structure for high-dimensional data. In Proc. 22th Intl. Conf. on VLDB, pages 28\u201339, Mumbai (Bombay), India, 1996."},{"key":"22_CR4","unstructured":"H. E. Blok. Top N optimization issues in MM databases. Proceedings of the EDBT 2000 PhD Workshop, Mar. 2000. http:\/\/www.edbt2000.uni-konstanz.de\/phd-workshop\/ ."},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"C. Buckley and A. F. Lewit. Optimization of inverted vector searches. In Proc. 8th Intl. ACM SIGIR Conf. on Research and Development in Information Retrieval, pages 97\u2013110, New York, 1985.","DOI":"10.1145\/253495.253515"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"M. J. Carey and D. Kossmann. On Saying \u201dEnough Already!\u201d in SQL. In SIGMOD 1997, Proc. ACM SIGMOD Intl. Conf. on Management of Data, May 13\u201315, 1997, Tucson, Arizona, USA, pages 219\u2013230. ACM Press, 1997.","DOI":"10.1145\/253262.253302"},{"key":"22_CR7","unstructured":"D. Donjerkovic and R. Ramakrishnan. Probabilistic optimization of top n queries. In VLDB\u201999, Proc. of 25th Intl. Conf. on Very Large Data Bases, September 7\u201310, 1999, Edinburgh, Scotland, UK, pages 411\u2013422. Morgan Kaufmann, 1999."},{"key":"22_CR8","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"J. Friedman","year":"1977","unstructured":"J. Friedman, J. Bentley, and R. Finkel. An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Software, 3:209\u2013226, September 1977.","journal-title":"ACM Trans. Math. Software"},{"key":"22_CR9","unstructured":"A. Henrich. A distance-scan algorithm for spatial access structures. In Proc. 2nd ACM Workshop on Advances in Geographic Information Systems, pages 136\u2013143, Gaithersburg, Md., USA, 1994."},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"A. Henrich. The LSDh-tree: An access structure for feature vectors. In Proc. 14th Intl. Conf. on Data Engineering, Orlando, Florida, USA, pages 362\u2013369, 1998.","DOI":"10.1109\/ICDE.1998.655799"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"A. Henrich and H.-W. Six. How to split buckets in spatial data structures. In Proc. Intl. Conf. on Geographic Database Management Systems, Esprit Basic Research Series DG XIII, pages 212\u2013244, Capri, 1991.","DOI":"10.1007\/978-3-642-77605-2_12"},{"key":"22_CR12","unstructured":"A. Henrich, H.-W. Six, and P. Widmayer. The LSD-tree: spatial access to multidimensional point and non point objects. In Proc. 15th Intl. Conf. on VLDB, pages 45\u201353, Amsterdam, 1989."},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"N. Katayama and S. Satoh. The SR-tree: An index structure for high-dimensional nearest neighbor queries. In Proc. ACM SIGMOD Conf., pages 369\u2013380, Tucson, Arizona, USA, 1997.","DOI":"10.1145\/253260.253347"},{"issue":"4","key":"22_CR14","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"K.-I. Lin","year":"1994","unstructured":"K.-I. Lin, H. Jagadish, and C. Faloutsos. The TV-tree: An index structure for high-dimensional data. VLDB Journal, 3(4):517\u2013542, Oct. 1994.","journal-title":"VLDB Journal"},{"key":"22_CR15","volume-title":"Automatic Text Processing: The Transformation, Analysis and Retrieval of Information by Computer","author":"G. Salton","year":"1989","unstructured":"G. Salton. Automatic Text Processing: The Transformation, Analysis and Retrieval of Information by Computer. Addison-Wesley, Reading, Mass., USA, 1989."},{"issue":"5","key":"22_CR16","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/0306-4573(88)90021-0","volume":"24","author":"G. Salton","year":"1988","unstructured":"G. Salton and C. Buckley. Term-weighting approaches in automatic text retrieval. Information Processing & Management, 24(5):513\u2013523, 1988.","journal-title":"Information Processing & Management"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"G. Sheikholeslami, W. Chang, and A. Zhang. Semantic clustering and querying on heterogeneous features for visual data. In Proc. 6th ACM Intl. Conf. on Multimedia (Multimedia-98), pages 3\u201312, N.Y., 1998. ACM Press.","DOI":"10.1145\/290747.290749"},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1002\/col.5080200605","volume":"20","author":"J. Sturges","year":"1995","unstructured":"J. Sturges and T. Whitfield. Locating basic colours in the munsell space. Color Research and Application, 20:364\u2013376, 1995.","journal-title":"Color Research and Application"},{"key":"22_CR19","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1117\/12.234810","volume":"2670","author":"D. White","year":"1996","unstructured":"D. White and R. Jain. Similarity indexing: Algorithms and performance. In Proc. Storage and Retrieval for Image and Video Databases IV (SPIE), volume 2670, pages 62\u201373, San Diego, CA, USA, 1996.","journal-title":"Proc. Storage and Retrieval for Image and Video Databases IV (SPIE)"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"D. White and R. Jain. Similarity indexing with the SS-tree. In Proc. 12th Intl. Conf. on Data Engineering, pages 516\u2013523, New Orleans, La., USA, 1996.","DOI":"10.1109\/ICDE.1996.492202"}],"container-title":["Lecture Notes in Computer Science","XML-Based Data Management and Multimedia Engineering \u2014 EDBT 2002 Workshops"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36128-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T11:18:40Z","timestamp":1556968720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36128-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001300","9783540361282"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-36128-6_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}