Algorithm engineering for big data
| dc.contributor.author | Sanders, Peter | |
| dc.contributor.editor | Plödereder, E. | |
| dc.contributor.editor | Grunske, L. | |
| dc.contributor.editor | Schneider, E. | |
| dc.contributor.editor | Ull, D. | |
| dc.date.accessioned | 2017-07-26T11:00:47Z | |
| dc.date.available | 2017-07-26T11:00:47Z | |
| dc.date.issued | 2014 | |
| dc.description.abstract | Perhaps the most fundamental challenge implied by advanced applications of big data sets is how to perform the vast amount of required computations sufficiently efficiently. Efficient algorithms are at the heart of this question. But how can we obtain innovative algorithmic solutions for demanding application problems with exploding input sizes using complex modern hardware and advanced algorithmic techniques? This tutorial gives examples how the methodology of algorithm engineering can be applied here. Examples include sorting, main memory based data bases, communication efficient algorithms, particle tracking at CERN LHC, 4D image processing, parallel graph algorithms, and full text indexing. Compared to a previous tutorial in Koblenz 2013 with the same title, this tutorial talks less about methodology and more about actual algorithms and applications. For further reading refer to [San13] and, for selected individual results to [DS03, KS07, SSP07, MS08, San09, RSS10, SS12, DS13]. | en |
| dc.identifier.isbn | 978-3-88579-626-8 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | Informatik 2014 | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-232 | |
| dc.title | Algorithm engineering for big data | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 57 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 57 | |
| gi.conference.date | 22.-26. September 2014 | |
| gi.conference.location | Stuttgart |