10.18453/rosdok_id00002192 Höpfner, Hagen Hagen Höpfner http://d-nb.info/gnd/123224748 Bunse, Christian Christian Bunse http://d-nb.info/gnd/122810058 Universität Rostock 2009 004 Data processing Computer sciences 2009 en http://purl.uni-rostock.de/rosdok/id00002192 urn:nbn:de:gbv:28-rosdok_id00002192-9 Database management systems comprise various algorithms for efficiently retrieving and managing data. Typically, algorithm efficiency or performance is correlated with execution speed. However, the uptime of battery powered mobile- and embedded systems strongly depends on the energy consumption of the involved components. This paper reports our results concerning the energy consumption of different implementations of sorting and join algorithms. We demonstrate that high performance algorithms often require more energy than slower ones. Furthermore, we show that dynamically exchanging algorithms at runtime results in a better throughput.