{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:42:22Z","timestamp":1725550942904},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441267"},{"type":"electronic","value":"9783540461463"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46146-9_73","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T17:14:30Z","timestamp":1269882870000},"page":"741-750","source":"Crossref","is-referenced-by-count":2,"title":["Partition-Based Similarity Join in High Dimensional Data Spaces"],"prefix":"10.1007","author":[{"given":"Hyoseop","family":"Shin","sequence":"first","affiliation":[]},{"given":"Bongki","family":"Moon","sequence":"additional","affiliation":[]},{"given":"Sukho","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,8,20]]},"reference":[{"key":"73_CR1","doi-asserted-by":"crossref","unstructured":"C. B\u00f6hm, B. Braunmuller, F. Krebs, and H.-P. Kriegel. Epsilon grid order: An algorithm for the similarity join on massive high-dimensional data. In Proceedings of the 2001 ACM-SIGMOD Conference, 2001.","DOI":"10.1145\/375663.375714"},{"key":"73_CR2","doi-asserted-by":"crossref","unstructured":"Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger. The R.-tree: An efficient and robust access method for points and rectangles. In Proceedings of the 1990 ACM-SIGMOD Conference, pages 322\u2013331, Atlantic City, NJ, May 1990.","DOI":"10.1145\/93597.98741"},{"key":"73_CR3","unstructured":"S. Berchtold, D. A. Keim, and H.-P. Kriegel. The X-tree: An index structure for high-dimensional data. In Proceedings of the 22nd VLDB Conference, Bombay, India, September 1996."},{"key":"73_CR4","doi-asserted-by":"crossref","unstructured":"Thomas Brinkho., Hans-Peter Kriegel, and Bernhard Seeger. Efficient processing of spatial joins using R-Trees. In Proceedings of the 1993 ACM-SIGMOD Conference, pages 237\u2013246, Washington, DC, May 1993.","DOI":"10.1145\/170036.170075"},{"key":"73_CR5","doi-asserted-by":"crossref","unstructured":"Antonin Guttman. R-Trees: A dynamic index structure for spatial searching. In Proceedings of the 1984 ACM-SIGMOD Conference, pages 47\u201357, Boston, MA, June 1984.","DOI":"10.1145\/602259.602266"},{"key":"73_CR6","doi-asserted-by":"crossref","unstructured":"Gisli R. Hjaltason and Hanan Samet. Incremental distance join algorithms for spatial databases. In Proceedings of the 1998 ACM-SIGMOD Conference, pages 237\u2013248, Seattle, WA, June 1998.","DOI":"10.1145\/276305.276326"},{"key":"73_CR7","unstructured":"Y.W. Huang, N. Jing, and E. Rundensteiner. Spatial joins using R-trees: Breadth-first traversal with global optimizations. In Proceedings of the 23rd VLDB Conference, 1997."},{"key":"73_CR8","doi-asserted-by":"crossref","unstructured":"N. Koudas and C. Sevcik. High dimensional similarity joins: Algorithms and performance evaluation. In Proceedings of the 1998 IEEE International Conference on Data Engineering, 1998.","DOI":"10.1109\/ICDE.1998.655809"},{"key":"73_CR9","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"K. Lin","year":"1995","unstructured":"K. Lin, H. V. Jagadish, and C. Faloutsos. The TV-tree: An index structure for high-dimensional data. VLDB Journal, 3:517\u2013542, 1995.","journal-title":"VLDB Journal"},{"key":"73_CR10","doi-asserted-by":"crossref","unstructured":"Ming-Ling Lo and Chinya V. Ravishankar. Spatial hash-join. In Proceedings of the 1996 ACM-SIGMOD Conference, pages 247\u2013258, Montreal, Canada, June 1996.","DOI":"10.1145\/235968.233337"},{"key":"73_CR11","doi-asserted-by":"crossref","unstructured":"Jignesh M. Patel and David J. DeWitt. Partition based spatial-merge join. In Proceedings of the 1996 ACM-SIGMOD Conference, pages 259\u2013270, Montreal, Canada, June 1996.","DOI":"10.1145\/235968.233338"},{"key":"73_CR12","unstructured":"K. Shim, R. Srikant, and R. Agrawal. High-dimensional similarity joins. In Proceedings of the 1997 IEEE International Conference on Data Engineering, 1997."},{"key":"73_CR13","doi-asserted-by":"crossref","unstructured":"Hyoseop Shin, Bongki Moon, and Sukho Lee. Adaptive multi-stage distance join processing. In Proceedings of the 2000 ACM-SIGMOD Conference, pages 343\u2013354, Dallas, TX, May 2000.","DOI":"10.1145\/342009.335428"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46146-9_73","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T15:06:53Z","timestamp":1558969613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46146-9_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441267","9783540461463"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-46146-9_73","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}