{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:30:21Z","timestamp":1743143421437,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181226"},{"type":"electronic","value":"9783319181233"}],"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-18123-3_6","type":"book-chapter","created":{"date-parts":[[2015,4,8]],"date-time":"2015-04-08T07:51:48Z","timestamp":1428479508000},"page":"89-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Parallel Top-k Query Processing on Uncertain Strings Using MapReduce"],"prefix":"10.1007","author":[{"given":"Hui","family":"Xu","sequence":"first","affiliation":[]},{"given":"Xiaofeng","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Hai","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Wenbin","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,9]]},"reference":[{"key":"6_CR1","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. In: OSDI, pp. 137\u2013150 (2004)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Jiang, D., Ooi, B.C., Shi, L., Wu, S.: The performance of MapReduce: An in-depth study. In: VLDB, pp. 472\u2013483. VLDB Endowment (2010)","DOI":"10.14778\/1920841.1920903"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Li, F., Ooi, B.C., Tamer \u00d6zsu, M., Wu, S.: Distributed Data Management Using MapReduce. ACM Computing Survey 46(3) (2014)","DOI":"10.1145\/2503009"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Jestes, J., Li, F., Yan, Z., Yi, K.: Probabilistic string similarity joins. In: SIGMOD, pp. 327\u2013338. ACM (2010)","DOI":"10.1145\/1807167.1807204"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: PODS, pp. 102\u2013113 (2001)","DOI":"10.1145\/375551.375567"},{"key":"6_CR6","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. IEEE (2008)","DOI":"10.1109\/ICDE.2008.4497434"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Kim, Y., Woo, K.-G., Park, H., Shim, K.: Efficient processing of substring match queries with inverted q-gram indexes. In: ICDE, pp. 721\u2013732. IEEE (2010)","DOI":"10.1109\/ICDE.2010.5447866"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Wang, X., Ding, X., Tung, K.H., Zhang, Z.: Efficient and effective KNN sequence search with approximate n-grams. In: VLDB, pp. 1\u201312. VLDB Endowment (2013)","DOI":"10.14778\/2732219.2732220"},{"key":"6_CR9","unstructured":"Deng, D., Li, G., Feng, J., Li, W.-S.: Top-k string similarity search with edit-distance constraints. In: ICDE, pp. 925\u2013936. IEEE (2013)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Hua, M., Pei, J., Zhang, W., Lin X.: Efficiently answering probabilistic threshold top-k queries on uncertain data. In: ICDE, pp. 85\u201396. IEEE (2008)","DOI":"10.1109\/ICDE.2008.4497570"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Yi, K., Li, F., Kollios, G., Srivastava, D.: Efficient processing of top-k queries in uncertain databases. In: ICDE, pp. 1406\u20131408. IEEE (2008)","DOI":"10.1109\/ICDE.2008.4497571"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Ge, T., Li, Z.: Approximate substring matching over uncertain strings. In: VLDB, pp. 772\u2013782. VLDB Endowment (2011)","DOI":"10.14778\/3402707.3402717"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Vernica, R., Carey, M.J., Li, C.: Efficient parallel set-similarity joins using MapReduce. In: SIGMOD, pp. 495\u2013506. ACM (2010)","DOI":"10.1145\/1807167.1807222"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Deng, D., Li, G., Hao, S., Wang, J., Feng, J., Li, W.-S.: MassJoin: A MapReduce-based method for scalable string similarity joins. In: ICDE. IEEE (2014)","DOI":"10.1109\/ICDE.2014.6816663"},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G Navarro","year":"2001","unstructured":"Navarro, G.: A guided tour to approximate string matching. ACM Computing Surveys 33(1), 31\u201388 (2001)","journal-title":"ACM Computing Surveys"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Wang, X., Ding, X., Tung, K.H., Ying, S., Jin, H.: An efficient graph indexing method. In: ICDE, pp. 805\u2013816. IEEE (2012)","DOI":"10.1109\/ICDE.2012.28"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kugn","year":"1955","unstructured":"Kugn, H.W.: The Hungarian method for the assignment problem. Naval Research Logistics Quarterly 2, 83\u201397 (1955)","journal-title":"Naval Research Logistics Quarterly"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Bandeira, N., Clauser, K., Pevzner, P.: Shotgun Protein Sequencing: Assembly of peptide tandem mass spectra from Mixtures of Modified Proteins. Molecular and Cellular Proteomics 6(7) (2007)","DOI":"10.1074\/mcp.M700001-MCP200"}],"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-18123-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:10:09Z","timestamp":1676938209000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18123-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181226","9783319181233"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18123-3_6","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"}}]}}