{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T21:16:45Z","timestamp":1682371005403},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2011,4]]},"abstract":"<jats:p>Matching problems are ubiquitous. They occur in economic markets, labor markets, internet advertising, and elsewhere. In this paper we focus on an application of matching for social media. Our goal is to distribute content from information suppliers to information consumers. We seek to maximize the overall relevance of the matched content from suppliers to consumers while regulating the overall activity, e.g., ensuring that no consumer is overwhelmed with data and that all suppliers have chances to deliver their content.<\/jats:p>\n          <jats:p>We propose two matching algorithms, GreedyMR and StackMR, geared for the MapReduce paradigm. Both algorithms have provable approximation guarantees, and in practice they produce high-quality solutions. While both algorithms scale extremely well, we can show that Stack-MR requires only a poly-logarithmic number of MapReduce steps, making it an attractive option for applications with very large datasets. We experimentally show the trade-offs between quality and efficiency of our solutions on two large datasets coming from real-world social-media web sites.<\/jats:p>","DOI":"10.14778\/1988776.1988782","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"460-469","source":"Crossref","is-referenced-by-count":21,"title":["Social content matching in MapReduce"],"prefix":"10.14778","volume":"4","author":[{"given":"Gianmarco","family":"De Francisci Morales","sequence":"first","affiliation":[{"name":"IMT Lucca and ISTI-CNR Pisa, Italy"}]},{"given":"Aristides","family":"Gionis","sequence":"additional","affiliation":[{"name":"Yahoo! Research, Barcelona, Spain"}]},{"given":"Mauro","family":"Sozio","sequence":"additional","affiliation":[{"name":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"}]}],"member":"320","published-online":{"date-parts":[[2011,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341557"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.70"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807362"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772715"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"P. Christiano J. A. Kelner A. Madry D. A. Spielman and S.-H. Teng. Electrical flows laplacian systems and faster approximation of maximum flow in undirected graphs. CoRR arXiv:1010.2921v2 2010.  P. Christiano J. A. Kelner A. Madry D. A. Spielman and S.-H. Teng. Electrical flows laplacian systems and faster approximation of maximum flow in undirected graphs. CoRR arXiv:1010.2921v2 2010.","DOI":"10.1145\/1993636.1993674"},{"key":"e_1_2_1_6_1","first-page":"281","volume-title":"NIPS","author":"Chu C.-T.","year":"2006"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2009.120"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90055-E"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808776"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9386-0"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00179-4"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290181"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11871842_67"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553432"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2009.14"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873677"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1813164.1813193"},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","unstructured":"J. Lin and C. Dyer. Data-intensive text processing with MapReduce. Morgan &amp; Claypool Publishers 2010.   J. Lin and C. Dyer. Data-intensive text processing with MapReduce . Morgan &amp; Claypool Publishers 2010.","DOI":"10.1007\/978-3-031-02136-7"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378558"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-010-0100-x"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00073-9"},{"key":"e_1_2_1_23_1","volume-title":"Springer-Verlag","author":"Vazirani V.","year":"2001"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30186-8_24"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1988776.1988782","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:30:39Z","timestamp":1672219839000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1988776.1988782"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":24,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["10.14778\/1988776.1988782"],"URL":"https:\/\/doi.org\/10.14778\/1988776.1988782","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2011,4]]}}}