{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T10:09:35Z","timestamp":1767262175606,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,3,18]],"date-time":"2013-03-18T00:00:00Z","timestamp":1363564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,3,18]]},"DOI":"10.1145\/2452376.2452449","type":"proceedings-article","created":{"date-parts":[[2013,3,25]],"date-time":"2013-03-25T14:14:26Z","timestamp":1364220866000},"page":"625-636","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Sparkler"],"prefix":"10.1145","author":[{"given":"Boduo","family":"Li","sequence":"first","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandeep","family":"Tata","sequence":"additional","affiliation":[{"name":"IBM Almaden Research Center, San Jose, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis","family":"Sismanis","sequence":"additional","affiliation":[{"name":"IBM Almaden Research Center, San Jose, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,3,18]]},"reference":[{"unstructured":"Apache Hadoop. https:\/\/hadoop.apache.org.  Apache Hadoop. https:\/\/hadoop.apache.org.","key":"e_1_3_2_1_1_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/1807128.1807148"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/1247480.1247504"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1109\/ICDE.2011.5767921"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.14778\/1920841.1920881"},{"volume-title":"ACM '11","author":"Cand\u00e8s E. J.","unstructured":"E. J. Cand\u00e8s , X. Li , Y. Ma , and J. Wright . Robust principal component analysis? J . ACM '11 , 58(3). E. J. Cand\u00e8s, X. Li, Y. Ma, and J. Wright. Robust principal component analysis? J. ACM '11, 58(3).","key":"e_1_3_2_1_6_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/2018436.2018448"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/1242572.1242610"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/1327452.1327492"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1109\/MCISE.2000.814652"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/1851476.1851593"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/2213836.2213874"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.5555\/647441.726883"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/2020408.2020426"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1109\/ICDE.2011.5767930"},{"volume-title":"NSDI '11","author":"Hindman B.","unstructured":"B. Hindman , A. Konwinski , M. Zaharia , A. Ghodsi , A. D. Joseph , R. Katz , S. Shenker , and I. Stoica . Mesos: A Platform for Fine-Grained Resource Sharing in the Data Center. In USENIX , NSDI '11 . B. Hindman, A. Konwinski, M. Zaharia, A. Ghodsi, A. D. Joseph, R. Katz, S. Shenker, and I. Stoica. Mesos: A Platform for Fine-Grained Resource Sharing in the Data Center. In USENIX, NSDI '11.","key":"e_1_3_2_1_17_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1145\/312624.312649"},{"volume-title":"JMLR '10","author":"Keshavan R. H.","unstructured":"R. H. Keshavan , A. Montanari , and S. Oh . Matrix completion from noisy entries . JMLR '10 , 11. R. H. Keshavan, A. Montanari, and S. Oh. Matrix completion from noisy entries. JMLR '10, 11.","key":"e_1_3_2_1_19_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1109\/MC.2009.263"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/1559845.1559923"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/1772690.1772760"},{"key":"e_1_3_2_1_23_1","volume-title":"Divide-and-conquer matrix factorization. CoRR, abs\/1107.0789","author":"Mackey L. W.","year":"2011","unstructured":"L. W. Mackey , A. Talwalkar , and M. I. Jordan . Divide-and-conquer matrix factorization. CoRR, abs\/1107.0789 , 2011 . L. W. Mackey, A. Talwalkar, and M. I. Jordan. Divide-and-conquer matrix factorization. CoRR, abs\/1107.0789, 2011."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1145\/1807167.1807184"},{"unstructured":"Memcached. http:\/\/memcached.org.  Memcached. http:\/\/memcached.org.","key":"e_1_3_2_1_25_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1145\/1871437.1871475"},{"key":"e_1_3_2_1_27_1","volume-title":"Hogwild!: A lock-free approach to parallelizing stochastic gradient descent. CoRR, abs\/1106.5730","author":"Niu F.","year":"2011","unstructured":"F. Niu , B. Recht , C. Re , and S. J. Wright . Hogwild!: A lock-free approach to parallelizing stochastic gradient descent. CoRR, abs\/1106.5730 , 2011 . F. Niu, B. Recht, C. Re, and S. J. Wright. Hogwild!: A lock-free approach to parallelizing stochastic gradient descent. CoRR, abs\/1106.5730, 2011."},{"volume-title":"CVPR '10","author":"Peng Y.","unstructured":"Y. Peng , A. Ganesh , J. Wright , W. Xu , and Y. Ma . Rasl: Robust alignment by sparse and low-rank decomposition for linearly correlated images . In CVPR '10 . Y. Peng, A. Ganesh, J. Wright, W. Xu, and Y. Ma. Rasl: Robust alignment by sparse and low-rank decomposition for linearly correlated images. In CVPR '10.","key":"e_1_3_2_1_28_1"},{"volume-title":"OSDI '10","author":"Power R.","unstructured":"R. Power and J. Li . Piccolo: Building Fast, Distributed Programs with Partitioned Tables. In USENIX , OSDI '10 , Berkeley, CA, USA. R. Power and J. Li. Piccolo: Building Fast, Distributed Programs with Partitioned Tables. In USENIX, OSDI '10, Berkeley, CA, USA.","key":"e_1_3_2_1_29_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1145\/2168836.2168857"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1145\/1868294.1868314"},{"volume-title":"LNCS '01","author":"Rowstron A.","unstructured":"A. Rowstron and P. Druschel . Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems . LNCS '01 . A. Rowstron and P. Druschel. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. LNCS '01.","key":"e_1_3_2_1_32_1"},{"volume-title":"NIPS '07","author":"Salakhutdinov R.","unstructured":"R. Salakhutdinov and A. Mnih . Probabilistic matrix factorization . In NIPS '07 . R. Salakhutdinov and A. Mnih. Probabilistic matrix factorization. In NIPS '07.","key":"e_1_3_2_1_33_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1007\/978-3-540-87481-2_24"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.1145\/1644893.1644932"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_36_1","DOI":"10.1109\/5992.814658"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1145\/383059.383071"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_38_1","DOI":"10.1155\/2009\/421425"},{"volume-title":"ICDM '12","author":"Teflioudi C.","unstructured":"C. Teflioudi , F. M. Manshadi , and R. Gemulla . Distributed algorithms for matrix completion . In ICDM '12 . C. Teflioudi, F. M. Manshadi, and R. Gemulla. Distributed algorithms for matrix completion. In ICDM '12.","key":"e_1_3_2_1_39_1"},{"key":"e_1_3_2_1_40_1","volume-title":"HotCloud","author":"Venkataraman S.","year":"2012","unstructured":"S. Venkataraman , I. Roy , A. AuYoung , and R. S. Schreiber . Using r for iterative and incremental processing . In HotCloud , 2012 . S. Venkataraman, I. Roy, A. AuYoung, and R. S. Schreiber. Using r for iterative and incremental processing. In HotCloud, 2012."},{"volume-title":"NSDI '12","author":"Zaharia M.","unstructured":"M. Zaharia , M. Chowdhury , T. Das , A. Dave , J. Ma , M. McCauley , M. J. Franklin , S. Shenker , and I. Stoica . Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing. In USENIX , NSDI '12 . M. Zaharia, M. Chowdhury, T. Das, A. Dave, J. Ma, M. McCauley, M. J. Franklin, S. Shenker, and I. Stoica. Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing. In USENIX, NSDI '12.","key":"e_1_3_2_1_41_1"}],"event":{"acronym":"EDBT\/ICDT '13","name":"EDBT\/ICDT '13: Joint 2013 EDBT\/ICDT Conferences","location":"Genoa Italy"},"container-title":["Proceedings of the 16th International Conference on Extending Database Technology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2452376.2452449","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2452376.2452449","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:25Z","timestamp":1750234705000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2452376.2452449"}},"subtitle":["supporting large-scale matrix factorization"],"short-title":[],"issued":{"date-parts":[[2013,3,18]]},"references-count":40,"alternative-id":["10.1145\/2452376.2452449","10.1145\/2452376"],"URL":"https:\/\/doi.org\/10.1145\/2452376.2452449","relation":{},"subject":[],"published":{"date-parts":[[2013,3,18]]},"assertion":[{"value":"2013-03-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}