{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:33:24Z","timestamp":1765546404822,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T00:00:00Z","timestamp":1548633600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"The Scientific and Technological Research Council of Turkey","award":["EEEAG-115E512"],"award-info":[{"award-number":["EEEAG-115E512"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib Parallel Databases"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10619-019-07257-y","type":"journal-article","created":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T10:15:15Z","timestamp":1548670515000},"page":"31-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Scaling sparse matrix-matrix multiplication in the accumulo database"],"prefix":"10.1007","volume":"38","author":[{"given":"Gunduz Vehbi","family":"Demirci","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4559-1321","authenticated-orcid":false,"given":"Cevdet","family":"Aykanat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,28]]},"reference":[{"issue":"2","key":"7257_CR1","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/1365815.1365816","volume":"26","author":"F Chang","year":"2008","unstructured":"Chang, F., Dean, J., Ghemawat, S., Hsieh, W.C., Wallach, D.A., Burrows, M., Chandra, T., Fikes, A., Gruber, R.E.: Bigtable: a distributed storage system for structured data. ACM Trans. Comput. Syst. (TOCS) 26(2), 4 (2008)","journal-title":"ACM Trans. Comput. Syst. (TOCS)"},{"issue":"6","key":"7257_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1145\/1323293.1294281","volume":"41","author":"Giuseppe DeCandia","year":"2007","unstructured":"DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., Vogels, W.: Dynamo: amazon\u2019s highly available key-value store. In: ACM SIGOPS operating systems review, vol. 41, pp. 205\u2013220. ACM (2007)","journal-title":"ACM SIGOPS Operating Systems Review"},{"issue":"2","key":"7257_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/1773912.1773922","volume":"44","author":"A Lakshman","year":"2010","unstructured":"Lakshman, A., Malik, P.: Cassandra: a decentralized structured storage system. ACM SIGOPS Oper. Syst. Rev. 44(2), 35\u201340 (2010)","journal-title":"ACM SIGOPS Oper. Syst. Rev."},{"key":"7257_CR4","unstructured":"Fuchs, A.: Accumulo-extensions to googles bigtable design, National Security Agency, Tech. Rep (2012)"},{"key":"7257_CR5","unstructured":"Apache hbase. https:\/\/hbase.apache.org\/ (2018). Accessed 15 April 2018"},{"key":"7257_CR6","doi-asserted-by":"crossref","unstructured":"Sen, R., Farris, A., Guerra, P.: Benchmarking apache accumulo bigdata distributed table store using its continuous test suite. In: 2013 IEEE International Congress on Big Data (BigData Congress), pp. 334\u2013341. IEEE (2013)","DOI":"10.1109\/BigData.Congress.2013.51"},{"key":"7257_CR7","doi-asserted-by":"crossref","unstructured":"Hutchison, D., Kepner, J., Gadepally, V., Howe, B.: From nosql accumulo to newsql graphulo: Design and utility of graph algorithms inside a bigtable database. In: 2016 IEEE on High Performance Extreme Computing Conference (HPEC), pp. 1\u20139. IEEE (2016)","DOI":"10.1109\/HPEC.2016.7761577"},{"issue":"1","key":"7257_CR8","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1186\/2192-113X-2-22","volume":"2","author":"K Grolinger","year":"2013","unstructured":"Grolinger, K., Higashino, W.A., Tiwari, A., Capretz, M.A.: Data management in cloud environments: Nosql and newsql data stores. J. Cloud Comput. 2(1), 22 (2013)","journal-title":"J. Cloud Comput."},{"key":"7257_CR9","doi-asserted-by":"crossref","unstructured":"Gadepally, V., Bolewski, J., Hook, D., Hutchison, D., Miller, B., Kepner, J.: Graphulo: Linear algebra graph kernels for nosql databases. In: 2015 IEEE International on Parallel and Distributed Processing Symposium Workshop (IPDPSW), pp. 822\u2013830. IEEE (2015)","DOI":"10.1109\/IPDPSW.2015.19"},{"key":"7257_CR10","doi-asserted-by":"publisher","first-page":"2453","DOI":"10.1016\/j.procs.2015.05.353","volume":"51","author":"J Kepner","year":"2015","unstructured":"Kepner, J., Bader, D., Bulu\u00e7, A., Gilbert, J., Mattson, T., Meyerhenke, H.: Graphs, matrices, and the graphblas: seven good reasons. Procedia Comput. Sci. 51, 2453\u20132462 (2015)","journal-title":"Procedia Comput. Sci."},{"key":"7257_CR11","doi-asserted-by":"crossref","unstructured":"Weale, T., Gadepally, V., Hutchison, D., Kepner, J.: Benchmarking the graphulo processing framework. In: 2016 IEEE on High Performance Extreme Computing Conference (HPEC), pp. 1\u20135. IEEE (2016)","DOI":"10.1109\/HPEC.2016.7761640"},{"key":"7257_CR12","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7, A., Gilbert, J.R.: Highly parallel sparse matrix-matrix multiplication, arXiv preprint arXiv:1006.2183 (2010)","DOI":"10.1137\/1.9780898719918.ch14"},{"key":"7257_CR13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719918","volume-title":"Graph algorithms in the language of linear algebra","author":"J Kepner","year":"2011","unstructured":"Kepner, J., Gilbert, J.: Graph algorithms in the language of linear algebra. SIAM, Philadelphia (2011)"},{"key":"7257_CR14","doi-asserted-by":"crossref","unstructured":"Hutchison, D., Kepner, J., Gadepally, V., Fuchs, A.: Graphulo implementation of server-side sparse matrix multiply in the accumulo database. In: 2015 IEEE on High Performance Extreme Computing Conference (HPEC), pp. 1\u20137. IEEE (2015)","DOI":"10.1109\/HPEC.2015.7322448"},{"issue":"3","key":"7257_CR15","first-page":"13","volume":"4","author":"K Akbudak","year":"2018","unstructured":"Akbudak, K., Selvitopi, O., Aykanat, C.: Partitioning models for scaling parallel sparse matrix-matrix multiplication. ACM Trans. Parallel Comput. (TOPC) 4(3), 13 (2018)","journal-title":"ACM Trans. Parallel Comput. (TOPC)"},{"key":"7257_CR16","first-page":"1","volume":"2","author":"D Bader","year":"2006","unstructured":"Bader, D., Madduri, K., Gilbert, J., Shah, V., Kepner, J., Meuse, T., Krishnamurthy, A.: Designing scalable synthetic compact applications for benchmarking high productivity computing systems. Cyberinfrastruct. Technol. Watch 2, 1\u201310 (2006)","journal-title":"Cyberinfrastruct. Technol. Watch"},{"key":"7257_CR17","doi-asserted-by":"crossref","unstructured":"Shvachko, K., Kuang, H., Radia, S., Chansler, R.: The hadoop distributed file system. In: 2010 IEEE 26th symposium on Mass storage systems and technologies (MSST), pp. 1\u201310. IEEE (2010)","DOI":"10.1109\/MSST.2010.5496972"},{"key":"7257_CR18","unstructured":"Hunt, P., Konar, M., Junqueira, F.P., Reed, B.: Zookeeper: Wait-free coordination for internet-scale systems. In: USENIX annual technical conference, vol. 8, p. 9 (2010)"},{"key":"7257_CR19","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/978-3-319-06486-4_7","volume-title":"High-Performance Computing on the Intel\u00ae Xeon Phi\u2122","author":"Endong Wang","year":"2014","unstructured":"Wang, E., Zhang, Q., Shen, B., Zhang, G., Lu, X., Wu, Q., Wang, Y.: Intel math kernel library. In: High-Performance Computing on the Intel $${\\textregistered }$$ \u00ae Xeon Phi, pp. 167\u2013188. Springer, New York (2014)"},{"key":"7257_CR20","first-page":"48","volume-title":"Lecture Notes in Computer Science","author":"Md. Mostofa Ali Patwary","year":"2015","unstructured":"Patwary, M.M.A., Satish, N.R., Sundaram, N., Park, J., Anderson, M.J., Vadlamudi, S.G., Das, D., Pudov, S.G., Pirogov, V.O., Dubey, P.: Parallel efficient sparse matrix-matrix multiplication on multicore platforms. In: International Conference on High Performance Computing, pp. 48\u201357. Springer, New York (2015)"},{"issue":"1","key":"7257_CR21","doi-asserted-by":"publisher","first-page":"C54","DOI":"10.1137\/130948811","volume":"37","author":"F Gremse","year":"2015","unstructured":"Gremse, F., Hofter, A., Schwen, L.O., Kiessling, F., Naumann, U.: GPU-accelerated sparse matrix-matrix multiplication by iterative row merging. SIAM J. Sci. Comput. 37(1), C54\u2013C71 (2015)","journal-title":"SIAM J. Sci. Comput."},{"issue":"8","key":"7257_CR22","doi-asserted-by":"publisher","first-page":"2258","DOI":"10.1109\/TPDS.2017.2656893","volume":"28","author":"K Akbudak","year":"2017","unstructured":"Akbudak, K., Aykanat, C.: Exploiting locality in sparse matrix-matrix multiplication on many-core architectures. IEEE Trans. Parallel Distrib. Syst. 28(8), 2258\u20132271 (2017)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"7257_CR23","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1145\/1089014.1089021","volume":"31","author":"MA Heroux","year":"2005","unstructured":"Heroux, M.A., Bartlett, R.A., Howle, V.E., Hoekstra, R.J., Hu, J.J., Kolda, T.G., Lehoucq, R.B., Long, K.R., Pawlowski, R.P., Phipps, E.T.: An overview of the trilinos project. ACM Trans. Math. Softw. (TOMS) 31(3), 397\u2013423 (2005)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"4","key":"7257_CR24","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1177\/1094342011403516","volume":"25","author":"A Bulu\u00e7","year":"2011","unstructured":"Bulu\u00e7, A., Gilbert, J.R.: The combinatorial blas: design, implementation, and applications. Int. J. High Perform. Comput. Appl. 25(4), 496\u2013509 (2011)","journal-title":"Int. J. High Perform. Comput. Appl."},{"issue":"4","key":"7257_CR25","doi-asserted-by":"publisher","first-page":"C170","DOI":"10.1137\/110848244","volume":"34","author":"A Bulu\u00e7","year":"2012","unstructured":"Bulu\u00e7, A., Gilbert, J.R.: Parallel sparse matrix-matrix multiplication and indexing: implementation and experiments. SIAM J. Sci. Comput. 34(4), C170\u2013C191 (2012)","journal-title":"SIAM J. Sci. Comput."},{"issue":"5","key":"7257_CR26","doi-asserted-by":"publisher","first-page":"C568","DOI":"10.1137\/13092589X","volume":"36","author":"K Akbudak","year":"2014","unstructured":"Akbudak, K., Aykanat, C.: Simultaneous input and output matrix partitioning for outer-product-parallel sparse matrix-matrix multiplication. SIAM J. Sci. Comput. 36(5), C568\u2013C590 (2014)","journal-title":"SIAM J. Sci. Comput."},{"key":"7257_CR27","doi-asserted-by":"crossref","unstructured":"Catalyurek, U., Aykanat, C.: A hypergraph-partitioning approach for coarse-grain decomposition. In: Proceedings of the 2001 ACM\/IEEE Conference on Supercomputing, pp. 28\u201328. ACM (2001)","DOI":"10.1145\/582034.582062"},{"key":"7257_CR28","doi-asserted-by":"crossref","unstructured":"Karypis, G.: Multilevel algorithms for multi-constraint hypergraph partitioning, tech. rep., MINNESOTA UNIV MINNEAPOLIS DEPT OF COMPUTER SCIENCE (1999)","DOI":"10.1109\/SC.1998.10018"},{"key":"7257_CR29","unstructured":"Karypis, G., Kumar, V.: Metis\u2014unstructured graph partitioning and sparse matrix ordering system, version 2.0 (1995)"},{"issue":"6\u20138","key":"7257_CR30","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.parco.2007.12.001","volume":"34","author":"C Chevalier","year":"2008","unstructured":"Chevalier, C., Pellegrini, F.: Pt-scotch: a tool for efficient parallel graph ordering. Parallel Comput. 34(6\u20138), 318\u2013331 (2008)","journal-title":"Parallel Comput."},{"key":"7257_CR31","volume-title":"Getting Started with Google Guava","author":"B Bejeck","year":"2013","unstructured":"Bejeck, B.: Getting Started with Google Guava. Packt Publishing Ltd, Birmingham (2013)"},{"issue":"1","key":"7257_CR32","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: Multilevelk-way partitioning scheme for irregular graphs. J. Parallel Distrib. Comput. 48(1), 96\u2013129 (1998)","journal-title":"J. Parallel Distrib. Comput."},{"key":"7257_CR33","doi-asserted-by":"crossref","unstructured":"Liu, W., Vinter, B.: An efficient GPU general sparse matrix-matrix multiplication for irregular data. In: 2014 IEEE 28th International on Parallel and Distributed Processing Symposium, pp.\u00a0370\u2013381. IEEE (2014)","DOI":"10.1109\/IPDPS.2014.47"},{"issue":"1","key":"7257_CR34","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1137\/13093426X","volume":"36","author":"M McCourt","year":"2015","unstructured":"McCourt, M., Smith, B., Zhang, H.: Sparse matrix-matrix products executed through coloring. SIAM J. Matrix Anal. Appl. 36(1), 90\u2013109 (2015)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"7257_CR35","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00453-006-1224-z","volume":"47","author":"P D\u2019Alberto","year":"2007","unstructured":"D\u2019Alberto, P., Nicolau, A.: R-kleene: a high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks. Algorithmica 47(2), 203\u2013213 (2007)","journal-title":"Algorithmica"},{"issue":"2","key":"7257_CR36","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1109\/TKDE.2009.83","volume":"22","author":"C Ordonez","year":"2010","unstructured":"Ordonez, C.: Optimization of linear recursive queries in SQL. IEEE Trans. Knowl. Data Eng. 22(2), 264\u2013277 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"7","key":"7257_CR37","doi-asserted-by":"publisher","first-page":"1905","DOI":"10.1109\/TKDE.2016.2545664","volume":"28","author":"C Ordonez","year":"2016","unstructured":"Ordonez, C., Zhang, Y., Cabrera, W.: The gamma matrix to summarize dense and sparse data sets for big data analytics. IEEE Trans. Knowl. Data Eng. 28(7), 1905\u20131918 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"7257_CR38","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/MIC.2003.1167344","volume":"7","author":"G Linden","year":"2003","unstructured":"Linden, G., Smith, B., York, J.: Amazon. com recommendations: item-to-item collaborative filtering. IEEE Internet Comput. 7(1), 76\u201380 (2003)","journal-title":"IEEE Internet Comput."},{"issue":"1","key":"7257_CR39","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The university of florida sparse matrix collection. ACM Trans. Math. Softw. (TOMS) 38(1), 1 (2011)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"4","key":"7257_CR40","doi-asserted-by":"publisher","first-page":"C123","DOI":"10.1137\/110838844","volume":"34","author":"N Bell","year":"2012","unstructured":"Bell, N., Dalton, S., Olson, L.N.: Exposing fine-grained parallelism in algebraic multigrid methods. SIAM J. Sci. Comput. 34(4), C123\u2013C152 (2012)","journal-title":"SIAM J. Sci. Comput."},{"key":"7257_CR41","unstructured":"Li, H., Li, K., Peng, J., Hu, J., Li, K.: An efficient parallelization approach for large-scale sparse non-negative matrix factorization using kullback-leibler divergence on multi-GPU. In: IEEE International Symposium on Parallel and Distributed Processing with Applications and 2017 IEEE International Conference on Ubiquitous Computing and Communications (ISPA\/IUCC), 2017, pp.\u00a0511\u2013518. IEEE (2017)"},{"key":"7257_CR42","doi-asserted-by":"crossref","unstructured":"Li, H., Li, K., Peng, J., Li, K.: Cusnmf: A sparse non-negative matrix factorization approach for large-scale collaborative filtering recommender systems on multi-GPU. In: 2017 IEEE International Symposium on Parallel and Distributed Processing with Applications and 2017 IEEE International Conference on Ubiquitous Computing and Communications (ISPA\/IUCC), pp. 1144\u20131151. IEEE (2017)","DOI":"10.1109\/ISPA\/IUCC.2017.00172"},{"issue":"3","key":"7257_CR43","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1109\/TKDE.2017.2767592","volume":"30","author":"R Kannan","year":"2018","unstructured":"Kannan, R., Ballard, G., Park, H.: Mpi-faun: an MPI-based framework for alternating-updating nonnegative matrix factorization. IEEE Trans. Knowl. Data Eng. 30(3), 544\u2013558 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"7257_CR44","unstructured":"Lee, D.D., Seung, H.S.: Algorithms for non-negative matrix factorization. In: Advances in neural information processing systems, pp. 556\u2013562 (2001)"}],"container-title":["Distributed and Parallel Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10619-019-07257-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-019-07257-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10619-019-07257-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T06:48:23Z","timestamp":1694587703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10619-019-07257-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,28]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["7257"],"URL":"https:\/\/doi.org\/10.1007\/s10619-019-07257-y","relation":{},"ISSN":["0926-8782","1573-7578"],"issn-type":[{"type":"print","value":"0926-8782"},{"type":"electronic","value":"1573-7578"}],"subject":[],"published":{"date-parts":[[2019,1,28]]},"assertion":[{"value":"28 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}