{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T11:40:07Z","timestamp":1744026007105,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325830"},{"type":"electronic","value":"9783642325847"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32584-7_15","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T11:53:13Z","timestamp":1346154793000},"page":"180-191","source":"Crossref","is-referenced-by-count":0,"title":["Landmark-Join: Hash-Join Based String Similarity Joins with Edit Distance Constraints"],"prefix":"10.1007","author":[{"given":"Kazuyo","family":"Narita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinji","family":"Nakadai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takuya","family":"Araki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Arasu, A., Ganti, V., Kaushik, R.: Efficient exact set-similarity joins. In: VLDB, pp. 918\u2013929 (2006)","key":"15_CR1"},{"doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Ma, Y., Srikant, R.: Scaling up all pairs similarity search. In: WWW, pp. 131\u2013140 (2007)","key":"15_CR2","DOI":"10.1145\/1242572.1242591"},{"unstructured":"Bocek, T., Hunt, E., Stiller, B.: Fast similarity search in large dictionaries. Technical Report ifi-2007.02, Department of Informatics, University of Zurich (April 2007)","key":"15_CR3"},{"doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganti, V., Kaushik, R.: A primitive operator for similarity joins in data cleaning. In: ICDE, p. 5 (2006)","key":"15_CR4","DOI":"10.1109\/ICDE.2006.9"},{"unstructured":"DeWitt, D.J., Naughton, J.F., Schneider, D.A.: An evaluation of non-equijoin algorithms. In: VLDB, pp. 443\u2013452 (1991)","key":"15_CR5"},{"unstructured":"Gravano, L., Ipeirotis, P.G., Jagadish, H.V., Koudas, N., Muthukrishnan, S., Srivastava, D.: Approximate string joins in a database (almost) for free. In: VLDB, pp. 491\u2013500 (2001)","key":"15_CR6"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-45123-4_7","volume-title":"Combinatorial Pattern Matching","author":"S.-R. Kim","year":"2000","unstructured":"Kim, S.-R., Park, K.: A Dynamic Edit Distance Table. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol.\u00a01848, pp. 60\u201368. Springer, Heidelberg (2000)"},{"doi-asserted-by":"crossref","unstructured":"Kitsuregawa, M., Ichiro Tsudaka, S., Nakano, M.: Parallel grace hash join on shared-everything multiprocessor: Implementation and performance evaluation on symmetry s81. In: ICDE, pp. 256\u2013264 (1992)","key":"15_CR8","DOI":"10.1109\/ICDE.1992.213185"},{"doi-asserted-by":"crossref","unstructured":"Li, C., Lu, J., Lu, Y.: Efficient merging and filtering algorithms for approximate string searches. In: ICDE, pp. 257\u2013266 (2008)","key":"15_CR9","DOI":"10.1109\/ICDE.2008.4497434"},{"unstructured":"Li, C., Wang, B., Yang, X.: Vgram: Improving performance of approximate queries on string collections using variable-length grams. In: VLDB, pp. 303\u2013314 (2007)","key":"15_CR10"},{"doi-asserted-by":"crossref","unstructured":"Li, G., Deng, D., Wang, J., Feng, J.: Pass-join: A partition-based method for similarity joins. In: PVLDB, pp. 253\u2013264 (2011)","key":"15_CR11","DOI":"10.14778\/2078331.2078340"},{"doi-asserted-by":"crossref","unstructured":"Vernica, R., Carey, M.J., Li, C.: Efficient parallel set-similarity joins using mapreduce. In: SIGMOD Conference, pp. 495\u2013506 (2010)","key":"15_CR12","DOI":"10.1145\/1807167.1807222"},{"doi-asserted-by":"crossref","unstructured":"Wang, J., Li, G., Feng, J.: Trie-join: Efficient trie-based string similarity joins with edit-distance constraints. In: PVLDB, vol.\u00a03(1), pp. 1219\u20131230 (2010)","key":"15_CR13","DOI":"10.14778\/1920841.1920992"},{"doi-asserted-by":"crossref","unstructured":"Wang, W., Xiao, C., Lin, X., Zhang, C.: Efficient approximate entity extraction with edit distance constraints. In: SIGMOD Conference, pp. 759\u2013770 (2009)","key":"15_CR14","DOI":"10.1145\/1559845.1559925"},{"doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X.: Ed-join: an efficient algorithm for similarity joins with edit distance constraints. In: PVLDB, vol.\u00a01(1), pp. 933\u2013944 (2008)","key":"15_CR15","DOI":"10.14778\/1453856.1453957"}],"container-title":["Lecture Notes in Computer Science","Data Warehousing and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32584-7_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T11:09:47Z","timestamp":1744024187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32584-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325830","9783642325847"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32584-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}