Show simple item record

dc.contributor.authorSanders, Peter
dc.contributor.editorPlödereder, E.
dc.contributor.editorGrunske, L.
dc.contributor.editorSchneider, E.
dc.contributor.editorUll, D.
dc.date.accessioned2017-07-26T11:00:47Z
dc.date.available2017-07-26T11:00:47Z
dc.date.issued2014
dc.identifier.isbn978-3-88579-626-8
dc.identifier.issn1617-5468
dc.description.abstractPerhaps 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.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofInformatik 2014
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-232
dc.titleAlgorithm engineering for big dataen
dc.typeText/Conference Paper
dc.pubPlaceBonn
mci.reference.pages57-57
mci.conference.locationStuttgart
mci.conference.date22.-26. September 2014


Files in this item

FilesSizeFormatView

There are no files associated with this item.

Show simple item record