{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T05:19:35Z","timestamp":1737609575253,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"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_43","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T22:20:41Z","timestamp":1194992441000},"page":"638-649","source":"Crossref","is-referenced-by-count":2,"title":["Compression Techniques Based on Concave Cluster Geometries for Efficient High-Dimensional Nearest Neighbor Retrieval"],"prefix":"10.1007","author":[{"given":"S\u00f6ren","family":"Balko","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"S. Balko and I. Schmitt. Active Vertice Clusters-A Sophisticated Concave Cluster Shape Approach for Efficient High Dimensional Nearest Neighbor Retrieval. Preprint 24, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Magdeburg, 2001.","key":"43_CR1","DOI":"10.1007\/3-540-36128-6_43"},{"unstructured":"S. Balko and I. Schmitt. Concave Cluster Shapes for Efficient Nearest Neighbor Search in High Dimensional Space. Preprint 23, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Magdeburg, 2001.","key":"43_CR2"},{"key":"43_CR3","first-page":"28","volume-title":"Proc. of the 22nd Int. Conf. on Very Large Data Bases, VLDB\u201996, Bombay, India, September 3-6, 1996","author":"S. Berchtold","year":"1996","unstructured":"S. Berchtold, D. A. Keim, and H.-P. Kriegel. The X-tree: An Index Structure for High-Dimensional Data. In T. M. Vijayaraman, A. P. Buchmann, C. Mohan, and N. L. Sarda, editors, Proc. of the 22nd Int. Conf. on Very Large Data Bases, VLDB\u201996, Bombay, India, September 3-6, 1996, pages 28\u201339. Morgan Kaufmann Publishers, San Francisco, CA, 1996."},{"doi-asserted-by":"crossref","unstructured":"C. B\u00f6hm, S. Berchtold, and D.A. Keim. Searching in High-dimensional Spaces-Index Structures for Improving the Performance of Multimedia Databases. ACM Computing Surveys, 2001. To appear.","key":"43_CR4","DOI":"10.1145\/502807.502809"},{"key":"43_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/602259.602266","volume-title":"Proc. of the 1984 ACM SIGMOD Int. Conf. on Management of Data","author":"A. Guttman","year":"1984","unstructured":"A. Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. In B. Yor-mark, editor, Proc. of the 1984 ACM SIGMOD Int. Conf. on Management of Data, Boston, NJ, ACM SIGMOD Record, Vol. 14, No. 2, pages 47\u201357. ACM Press, New York, 1984."},{"doi-asserted-by":"crossref","unstructured":"Norio Katayama and Shin\u2019ichi Satoh. The SR-tree: an Index Structure for High-Dimensional Nearest Neighbor Queries. In Proc. of the 1997 ACM SIGMOD Int. Conf. on Management of Data, pages 369\u2013380, 1997.","key":"43_CR6","DOI":"10.1145\/253262.253347"},{"unstructured":"I. Schmitt. Nearest Neighbor Search in High Dimensional Space by Using Convex Hulls. Preprint 6, Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Magdeburg, 2001.","key":"43_CR7"},{"key":"43_CR8","first-page":"194","volume-title":"Proc. of the 24st Int. Conf. on Very Large Data Bases, VLDB\u201998, Ney York City, August 24\u201327, 1998","author":"R. Weber","year":"1998","unstructured":"R. Weber, H.-J. Schek, and S. Blott. A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces. In A. Gupta, O. Shmueli, and J. Widom, editors, Proc. of the 24st Int. Conf. on Very Large Data Bases, VLDB\u201998, Ney York City, August 24\u201327, 1998, pages 194\u2013205. Morgan Kaufmann Publishers, San Francisco, CA, 1998."}],"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_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T08:52:39Z","timestamp":1737535959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36128-6_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001300","9783540361282"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-36128-6_43","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}