{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:14:53Z","timestamp":1737436493363,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744672"},{"type":"electronic","value":"9783540744696"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74469-6_24","type":"book-chapter","created":{"date-parts":[[2007,8,22]],"date-time":"2007-08-22T12:33:31Z","timestamp":1187786011000},"page":"233-242","source":"Crossref","is-referenced-by-count":1,"title":["Progressive High-Dimensional Similarity Join"],"prefix":"10.1007","author":[{"given":"Wee Hyong","family":"Tok","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Bressan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mong-Li","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Tao, Y., Yiu, M.L., Papadias, D., Hadjieleftheriou, M., Mamoulis, N.: RPJ: Producing fast join results on streams through rate-based optimization. In: SIGMOD, pp. 371\u2013382 (2005)","DOI":"10.1145\/1066157.1066200"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Tok, W.H., Bressan, S., Lee, M.-L.: RRPJ: Result-rate based progressive relational join. In: DASFAA, pp. 43\u201354 (2007)","DOI":"10.1007\/978-3-540-71703-4_6"},{"key":"24_CR3","unstructured":"Tok, W.H., Bressan, S., Lee, M.-L.: Progressive spatial joins. In: SSDBM, pp. 353\u2013358 (2006)"},{"key":"24_CR4","unstructured":"Shim, K., Srikant, R., Agrawal, R.: High-dimensional similarity joins. In: ICDE, pp. 301\u2013311 (1997)"},{"issue":"1","key":"24_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/69.842246","volume":"12","author":"N. Koudas","year":"2000","unstructured":"Koudas, N., Sevcik, K.C.: High dimensional similarity joins: Algorithms and performance evaluation. IEEE Transactions on Knowledge and Data Engineering\u00a012(1), 3\u201318 (2000)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, C., Braunm\u00fcller, B., Breunig, M.M., Kriegel, H.-P.: High performance clustering based on the similarity join. In: CIKM, pp. 298\u2013305 (2000)","DOI":"10.1145\/354756.354832"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, C., Braunm\u00fcller, B., Krebs, F., Kriegel, H.-P.: Epsilon grid order: An algorithm for the similarity join on massive high-dimensional data. In: SIGMOD, pp. 379\u2013388 (2001)","DOI":"10.1145\/375663.375714"},{"issue":"1","key":"24_CR8","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.is.2005.07.002","volume":"32","author":"D.V. Kalashnikov","year":"2007","unstructured":"Kalashnikov, D.V., Prabhakar, S.: Fast similarity join for multi-dimensional data. Inf. Syst.\u00a032(1), 160\u2013177 (2007)","journal-title":"Inf. Syst."},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: SIGMOD, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"24_CR10","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.-P.: The x-tree: An index structure for high-dimensional data. In: VLDB, pp. 28\u201339 (1996)"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Koudas, N., Sevcik, K.C.: High dimensional similarity joins: Algorithms and performance evaluation. In: ICDE, pp. 466\u2013475 (1998)","DOI":"10.1109\/ICDE.1998.655809"},{"key":"24_CR12","unstructured":"Urhan, T., Franklin, M.J.: XJoin: Getting fast answers from slow and bursty networks. Technical Report CS-TR-3994, University of Maryland (1999)"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Dittrich, J.-P., Seeger, B., Taylor, D.S., Widmayer, P.: Progressive merge join: A generic and non-blocking sort-based join algorithm. In: VLDB, pp. 299\u2013310 (2002)","DOI":"10.1016\/B978-155860869-6\/50034-2"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Mokbel, M.F., Lu, M., Aref, W.G.: Hash-merge join: A non-blocking join algorithm for producing fast and early join results. In: ICDE, pp. 251\u2013263 (2004)","DOI":"10.1109\/ICDE.2004.1320002"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Wilschut, A.N., Apers, P.M.G.: Dataflow query execution in a parallel main-memory environment. In: PDIS, pp. 68\u201377 (1991)","DOI":"10.1109\/PDIS.1991.183069"},{"key":"24_CR16","unstructured":"Corel image features dataset (1999), http:\/\/kdd.ics.uci.edu\/"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74469-6_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T14:42:30Z","timestamp":1737384150000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74469-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744672","9783540744696"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74469-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}