{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:48:14Z","timestamp":1725500894199},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540454854"},{"type":"electronic","value":"9783540454878"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11875581_66","type":"book-chapter","created":{"date-parts":[[2006,9,25]],"date-time":"2006-09-25T08:23:29Z","timestamp":1159172609000},"page":"546-553","source":"Crossref","is-referenced-by-count":1,"title":["Partition-Based Similarity Joins Using Diagonal Dimensions in High Dimensional Data Spaces"],"prefix":"10.1007","author":[{"given":"Hyoseop","family":"Shin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"66_CR1","unstructured":"Brinkhoff, T., Kriegel, H.-P., Seeger, B.: Efficient processing of spatial joins using R-trees. In: Proceedings of the 1996 VLDB Conference, Bombay, India (September 1996)"},{"key":"66_CR2","unstructured":"Huang, Y.W., Jing, N., Rundensteiner, E.: Spatial joins using R-trees: Breadth-first traversal with global optimizations. In: Proceedings of the 1997 VLDB Conference (1997)"},{"key":"66_CR3","doi-asserted-by":"crossref","unstructured":"Hjaltason, G.R., Samet, H.: Incremental distance join algorithms for spatial databases. In: Proceedings of the 1998 ACM-SIGMOD Conference, Seattle, WA, June 1998, pp. 237\u2013248 (1998)","DOI":"10.1145\/276304.276326"},{"key":"66_CR4","doi-asserted-by":"crossref","unstructured":"Shin, H., Moon, B., Lee, S.: Adaptive multi-stage distance join processing. In: Proceedings of the 2000 ACM-SIGMOD Conference, Dallas, TX, May 2000, pp. 343\u2013354 (2000)","DOI":"10.1145\/342009.335428"},{"key":"66_CR5","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM-SIGMOD Conference, Boston, MA, June 1984, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"66_CR6","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: An efficient and robust access method for points and rectangles. In: Proceedings of the 1990 ACM-SIGMOD Conference, Atlantic City, NJ, May 1990, pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"66_CR7","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.-P.: The X-tree: An index structure for highdimensional data. In: Proceedings of the 1996 Conference, Bombay, India (September 1996)"},{"key":"66_CR8","doi-asserted-by":"crossref","unstructured":"Patel, J.M., Dewitt, D.J.: Partition based spatial-merge join. In: Proceedings of the 1996 ACM-SIGMOD Conference, Montreal, Canada, June 1996, pp. 259\u2013270 (1996)","DOI":"10.1145\/233269.233338"},{"key":"66_CR9","doi-asserted-by":"crossref","unstructured":"Lo, M.-L., Ravishankar, C.V.: Spatial hash join. In: Proceedings of the 1996 ACM-SIGMOD Conference, Montreal, Canada pp. 247\u2013258 (June 1996)","DOI":"10.1145\/233269.233337"},{"key":"66_CR10","unstructured":"Shim, K., Srikant, R., Agrawal, R.: High-dimensional similarity joins. In: Proceedings of the 1997 IEEE International Conference on Data Engineering (1997)"},{"key":"66_CR11","doi-asserted-by":"crossref","unstructured":"Koudas, N., Sevcik, C.: 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":"66_CR12","doi-asserted-by":"crossref","unstructured":"Bohm, C., Braunmuller, B., Krebs, F., Kriegel, H.-P.: 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"},{"issue":"4","key":"66_CR13","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"K.-I. Lin","year":"1994","unstructured":"Lin, K.-I., Jagadish, H.V., Faloutsos, C.: The TV-Tree: An Index Structure for High-Dimensional Data. VLDB Journal\u00a03(4), 517\u2013542 (1994)","journal-title":"VLDB Journal"},{"key":"66_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/3-540-46146-9_73","volume-title":"Database and Expert Systems Applications","author":"H. Shin","year":"2002","unstructured":"Shin, H., Moon, B., Lee, S.: Partition-Based Similarity Join in High Dimensional Data Spaces. In: Hameurlain, A., Cicchetti, R., Traunm\u00fcller, R. (eds.) DEXA 2002. LNCS, vol.\u00a02453, pp. 741\u2013750. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11875581_66.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:25:38Z","timestamp":1619493938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11875581_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540454854","9783540454878"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11875581_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}