- AutorIn
- Prof. Dr.-Ing. Wolfgang Lehner Technische Universität Dresden, Fakultät Informatik, Institut für Systemarchitektur, Professur Datenbanken
- David KernertTechnische Universität Dresden, Fakultät Informatik, Institut für Systemarchitektur, Dresden Database Research Group
- Frank Köhler
- Titel
- Topology-aware optimization of big sparse matrices and matrix multiplications on main-memory systems
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-821171
- Konferenz
- International Conference on Data Engineering. Helsinki, 16.-20.05.2016
- Quellenangabe
- 2016 IEEE 32nd International Conference on Data Engineering (ICDE)
Erscheinungsort: New York
Verlag: IEEE
Erscheinungsjahr: 2016
Seiten: 823-834 - Erstveröffentlichung
- 2016
- Abstract (EN)
- Since data sizes of analytical applications are continuously growing, many data scientists are switching from customized micro-solutions to scalable alternatives, such as statistical and scientific databases. However, many algorithms in data mining and science are expressed in terms of linear algebra, which is barely supported by major database vendors and big data solutions. On the other side, conventional linear algebra algorithms and legacy matrix representations are often not suitable for very large matrices. We propose a strategy for large matrix processing on modern multicore systems that is based on a novel, adaptive tile matrix representation (AT MATRIX). Our solution utilizes multiple techniques inspired from database technology, such as multidimensional data partitioning, cardinality estimation, indexing, dynamic rewrites, and many more in order to optimize the execution time. Based thereon we present a matrix multiplication operator ATMULT, which outperforms alternative approaches. The aim of our solution is to overcome the burden for data scientists of selecting appropriate algorithms and matrix storage representations. We evaluated AT MATRIX together with ATMULT on several real-world and synthetic random matrices.
- Andere Ausgabe
- Link zum Artikel, der zuerst in der IEEE Xplore Digital Library erschienen ist.
DOI: 10.1109/ICDE.2016.7498293 - Freie Schlagwörter (DE)
- Lückenhafte Matrizen, Optimierung, Lineare Algebra, Datenstrukturen, Datenbanken, Matrixkonverter, Partitionierungsalgorithmen
- Freie Schlagwörter (EN)
- Sparse matrices, Optimization, Linear algebra, Data structures, Databases, Matrix converters, Partitioning algorithms
- Klassifikation (DDC)
- 005
- Verlag
- IEEE, New York
- Version / Begutachtungsstatus
- angenommene Version / Postprint / Autorenversion
- URN Qucosa
- urn:nbn:de:bsz:14-qucosa2-821171
- Veröffentlichungsdatum Qucosa
- 12.01.2023
- Dokumenttyp
- Konferenzbeitrag
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis