{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:50:18Z","timestamp":1773481818734,"version":"3.50.1"},"reference-count":35,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1109\/icde.2016.7498293","type":"proceedings-article","created":{"date-parts":[[2016,6,25]],"date-time":"2016-06-25T07:36:34Z","timestamp":1466840194000},"page":"823-834","source":"Crossref","is-referenced-by-count":9,"title":["Topology-aware optimization of big sparse matrices and matrix multiplications on main-memory systems"],"prefix":"10.1109","author":[{"given":"David","family":"Kernert","sequence":"first","affiliation":[]},{"given":"Wolfgang","family":"Lehner","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Kohler","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654078"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1693453.1693471"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/080733243"},{"key":"ref30","first-page":"442","author":"chakrabarti","year":"0","journal-title":"R-MAT A Recursive Model for Graph Mining"},{"key":"ref35","year":"0"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1077464.1077466"},{"key":"ref10","author":"saad","year":"1994","journal-title":"SPARSKIT A Basic Tool Kit for Sparse Matrix Computations"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/355791.355796"},{"key":"ref12","year":"0"},{"key":"ref13","author":"vuduc","year":"2004","journal-title":"Automatic performance tuning of sparse matrix kernels"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20119-1_4"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465273"},{"key":"ref16","author":"kamel","year":"1994","journal-title":"Hilbert R-tree An Improved R-tree Using Fractals"},{"key":"ref17","volume":"59","author":"markl","year":"1999","journal-title":"MISTRAL Processing Relational Queries Using A Multidimensional Access Technique"},{"key":"ref18","author":"morton","year":"1966","journal-title":"A Computer Oriented Geodetic Data Base and a New Technique in File Sequencing"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1514894.1514909"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824043"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719918"},{"key":"ref27","first-page":"40","volume":"11","author":"lameter","year":"0","journal-title":"NUMA (non-uniform memory access) An overview"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/BIBM.2013.6732613"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807271"},{"key":"ref29","article-title":"The SAP HANA Database – An Architecture Overview","volume":"35","author":"f\u00e4rber","year":"2012","journal-title":"IEEE Data Eng Bull"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687576"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2618243.2618254"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732292"},{"key":"ref2","article-title":"Modular Data Clustering - Algorithm Design beyond MapReduce","author":"hahmann","year":"2014","journal-title":"EDBT Workshops"},{"key":"ref9","article-title":"SpMacho - Optimizing Sparse Linear Algebra Expressions with Probabilistic Density Estimation","author":"kernert","year":"2015","journal-title":"EDBT"},{"key":"ref1","article-title":"Principal Component Analysis - A Powerful Tool in Computing Marketing Information","volume":"7","author":"constantin","year":"2014","journal-title":"Bulletin of the Transilvania University of Brasov"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44777-2_62"},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.1137\/110848244","article-title":"Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments","volume":"34","author":"bulu\u00e7","year":"2012","journal-title":"SIAM J Scientific Computing"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2012.6507483"},{"key":"ref24","author":"schubert","year":"2011","journal-title":"Parallel Sparse Matrix-vector Multiplication As A Test Case for Hybrid MPI+OpenMP Programming"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.2172\/891708"},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.1177\/1094342011403516","article-title":"The Combinatorial BLAS: Design, Implementation, and Applications","volume":"25","author":"bulu\u00e7","year":"2011","journal-title":"Int J High Perform Comput Appl"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/0613024"}],"event":{"name":"2016 IEEE 32nd International Conference on Data Engineering (ICDE)","location":"Helsinki, Finland","start":{"date-parts":[[2016,5,16]]},"end":{"date-parts":[[2016,5,20]]}},"container-title":["2016 IEEE 32nd International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7491900\/7498210\/07498293.pdf?arnumber=7498293","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T13:06:27Z","timestamp":1498309587000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7498293\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/icde.2016.7498293","relation":{},"subject":[],"published":{"date-parts":[[2016,5]]}}}