{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:44:38Z","timestamp":1725795878492},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080093"},{"type":"electronic","value":"9783319080109"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08010-9_43","type":"book-chapter","created":{"date-parts":[[2014,6,18]],"date-time":"2014-06-18T22:17:50Z","timestamp":1403129870000},"page":"415-418","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Graph Similarity Join with Scalable Prefix-Filtering Using MapReduce"],"prefix":"10.1007","author":[{"given":"Jun","family":"Pang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yubin","family":"Bao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Zeng, Z., Tung, A.K.H., Wang, J., et al.: Comparing stars: On approximating graph edit distance. In: PVLDB, vol.\u00a02(1), pp. 25\u201336 (2009)","DOI":"10.14778\/1687627.1687631"},{"key":"43_CR2","unstructured":"MapReduce, \n                      \n                        http:\/\/hadoop.apache.org\/"},{"key":"43_CR3","unstructured":"MapReduce, \n                      \n                        http:\/\/en.wikipedia.org\/wiki\/MapReduce"},{"key":"43_CR4","unstructured":"A graph synthetic generator, \n                      \n                        http:\/\/www.cse.ust.hk\/graphgen\/"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Wang, G., Wang, B., Yang, X., et al.: Efficiently indexing large sparse graphs for similarity search. In: TKDE, pp. 440\u2013451 (2010)","DOI":"10.1109\/TKDE.2010.28"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Zhao, X., Xiao, C., Lin, X.M., et al.: Efficient graph similarity joins with edit distance constraints. In: ICDE, pp. 834\u2013845 (2012)","DOI":"10.1109\/ICDE.2012.91"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Vernica, R., Carey, M.J., Li, C.: Efficient parallel set-similarity joins using MapReduce. In: SIGMOD, pp. 495\u2013506 (2010)","DOI":"10.1145\/1807167.1807222"},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"Baraglia, R., De Morales, G.F., Lucchese, C.: Document similarity self-Join with MapReduce. In: ICDM, pp. 731\u2013736 (2010)","DOI":"10.1109\/ICDM.2010.70"},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"Metwally, A., Faloutsos, C.: V-SMART-Join a scalable MapReduce framework for all-pair similarity joins of multisets and vectors. In: PVLDB, vol.\u00a05(8), pp. 704\u2013715 (2012)","DOI":"10.14778\/2212351.2212353"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Afrati, N.F., Sarma, D., et al.: Fuzzy joins using MapReduce. In: ICDE, pp. 498\u2013509 (2012)","DOI":"10.1109\/ICDE.2012.66"},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"Elsayed, T., Lin, J., Oard, D.W.: Pairwise document similarity in large collections with MapReduce. In: ACL, pp. 265\u2013268 (2008)","DOI":"10.3115\/1557690.1557767"},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"Silva, N.Y., Jason, M., et al.: Exploiting MapReduce-based similarity joins. In: SIGMOD, pp. 693\u2013696 (2012)","DOI":"10.1145\/2213836.2213935"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08010-9_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T03:03:40Z","timestamp":1558926220000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08010-9_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080093","9783319080109"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08010-9_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}