{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:20:22Z","timestamp":1743009622436,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181196"},{"type":"electronic","value":"9783319181202"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18120-2_32","type":"book-chapter","created":{"date-parts":[[2015,4,8]],"date-time":"2015-04-08T08:08:06Z","timestamp":1428480486000},"page":"545-564","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient String Similarity Search: A Cross Pivotal Based Approach"],"prefix":"10.1007","author":[{"given":"Fei","family":"Bi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijun","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,9]]},"reference":[{"key":"32_CR1","unstructured":"Arasu, A., Ganti, V., Kaushik, R.: Efficient exact set-similarity joins. In: VLDB (2006)"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganjam, K., Ganti, V., Motwani, R.: Robust and efficient fuzzy match for online data cleaning. In: SIGMOD (2003)","DOI":"10.1145\/872757.872796"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganti, V., Kaushik, R.: A primitive operator for similarity joins in data cleaning. In: ICDE (2006)","DOI":"10.1109\/ICDE.2006.9"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Deng, D., Li, G., Feng, J.: A pivotal prefix based filtering algorithm for string similarity search. In: SIGMOD (2014)","DOI":"10.1145\/2588555.2593675"},{"key":"32_CR5","unstructured":"Deng, D., Li, G., Feng, J., Li, W.: Top-k string similarity search with edit-distance constraints. In: ICDE (2013)"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Forman, G., Eshghi, K., Chiocchetti, S.: Finding similar files in large document repositories. In: SIGKDD (2005)","DOI":"10.1145\/1081870.1081916"},{"key":"32_CR7","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 (2001)"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Hadjieleftheriou, M., Koudas, N., Srivastava, D.: Incremental maintenance of length normalized indexes for approximate string matching. In: SIGMOD (2009)","DOI":"10.1145\/1559845.1559891"},{"key":"32_CR9","unstructured":"Kahveci, T., Singh, A.K.: Efficient index structures for string databases. In: VLDB (2001)"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Kim, Y., Shim, K.: Efficient top-k algorithms for approximate substring matching. In: SIGMOD (2013)","DOI":"10.1145\/2463676.2465324"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Li, C., Lu, J., Lu, Y.: Efficient merging and filtering algorithms for approximate string searches. In: ICDE (2008)","DOI":"10.1109\/ICDE.2008.4497434"},{"key":"32_CR12","unstructured":"Li, C., Wang, B., Yang, X.: VGRAM: improving performance of approximate queries on string collections using variable-length grams. In: VLDB (2007)"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Navarro, G.: A guided tour to approximate string matching. ACM Comput. Surv. 33(1) (2001)","DOI":"10.1145\/375360.375365"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Qin, J., Wang, W., Lu, Y., Xiao, C., Lin, X.: Efficient exact edit similarity query processing with the asymmetric signature scheme. In: SIGMOD (2011)","DOI":"10.1145\/1989323.1989431"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Qin, J., Wang, W., Xiao, C., Lu, Y., Lin, X., Wang, H.: Asymmetric signature schemes for efficient exact edit similarity query processing. ACM Trans. Database Syst. 38(3) (2013)","DOI":"10.1145\/2508020.2508023"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Sokol, D., Benson, G., Tojeira, J.: Tandem repeats over the edit distance. Bioinformatics 23(2) (2007)","DOI":"10.1093\/bioinformatics\/btl309"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Wang, J., Li, G., Feng, J.: Can we beat the prefix filtering?: an adaptive framework for similarity join and search. In: SIGMOD (2012)","DOI":"10.1145\/2213836.2213847"},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X.: Ed-join: an efficient algorithm for similarity joins with edit distance constraints. PVLDB 1(1) (2008)","DOI":"10.14778\/1453856.1453957"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X., Yu, J.X.: Efficient similarity joins for near duplicate detection. In: WWW (2008)","DOI":"10.1145\/1367497.1367516"},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"Yang, X., Wang, B., Li, C.: Cost-based variable-length-gram selection for string collections to support approximate queries efficiently. In: SIGMOD (2008)","DOI":"10.1145\/1376616.1376655"},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Hadjieleftheriou, M., Ooi, B.C., Srivastava, D.: Bed-tree: an all-purpose index structure for string similarity search based on edit distance. In: SIGMOD (2010)","DOI":"10.1145\/1807167.1807266"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18120-2_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T07:40:35Z","timestamp":1676446835000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18120-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181196","9783319181202"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18120-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}