Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Daniel Schall 0002

dblp:11/1123-2 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2015
0000-0002-1038-0241ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 5 · 4 first-authorArtificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Distributed and cloud data management · 78% Database system architecture and tuning · 22%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Energy-efficient computing · 100%

Topics — the 3 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed and cloud data management
data partitioning
0.212015
Dynamic physiological partitioning on a shared-nothing database cluster · ICDE 2015
Energy-efficient computing
power management
0.222015
WattDB: an energy-proportional cluster of wimpy nodes · SIGMOD Conference 2011
Dynamic physiological partitioning on a shared-nothing database cluster · ICDE 2015
Energy-efficient computing › power management
energy proportional computing
0.112015
Dynamic physiological partitioning on a shared-nothing database cluster · ICDE 2015

Methods — techniques the papers use, named apart from their topics

dynamic repartitioning · 0.4data migration · 0.4workload-based node activation · 0.2
YearPublicationVenuePosition
2015 Dynamic physiological partitioning on a shared-nothing database cluster
abstract
Traditional database management systems (DBMSs) running on powerful single-node servers are usually over-provisioned for most of their daily workloads and, because they do not show good-enough energy proportionality, waste a lot of energy while underutilized. A cluster of small (wimpy) servers, where its size can be dynamically adjusted to the current workload, offers better energy characteristics for those workloads. Yet, data migration, necessary to balance utilization among the nodes, is a non-trivial and time-consuming task that may consume the energy saved. For this reason, a sophisticated and easy to adjust partitioning scheme fostering dynamic reorganization is needed. In this paper, we adapt a technique originally created for SMP systems, called physiological partitioning, to distribute data among nodes that allows to easily repartition data without interrupting transactions. We dynamically partition DB tables based on the nodes' utilization and given energy constraints and compare our approach with physical partitioning and logical partitioning methods. To quantify possible energy saving and its conceivable drawback on query runtimes, we evaluate our implementation on an experimental cluster and compare the results w.r.t. performance and energy consumption. Depending on the workload, we can substantially save energy without sacrificing too much performance.
Daniel Schall 0002, Theo Härder
ICDE1
2014 Approximating an Energy-Proportional DBMS by a Dynamic Cluster of Nodes
Daniel Schall 0002, Theo Härder
DASFAA (1)1
2013 Energy-proportional query execution using a cluster of wimpy nodes
abstract
Because energy use of single-server systems is far from being energy proportional, we explore whether or not better energy efficiency may be achieved by a cluster of nodes whose size is dynamically adjusted to the current workload demand. As data-intensive workloads, we submit specific TPC-H queries against a distributed shared-nothing DBMS, where time and energy use are captured by specific monitoring and measurement devices. We configure various static clusters of varying sizes and show their influence on energy efficiency and performance. Further, using an EnergyController and a load-aware scheduler, we verify the hypothesis that energy proportionality can be well approximated by dynamic clusters.
Daniel Schall 0002, Theo Härder
DaMoN1
2011 WattDB: an energy-proportional cluster of wimpy nodes
abstract
The constant growth of data in all businesses leads to bigger database servers. While peak load times require fast and heavyweight hardware to guarantee performance, idle times are a waste of energy and money. Todays DBMSs have the ability to cluster several servers for performance and fault tolerance. Nevertheless, they do not support dynamic powering of the cluster's nodes based on the current workload.
Daniel Schall 0002, Volker Hudlet
SIGMOD Conference1
2010 Performance and Power Evaluation of Flash-Aware Buffer Algorithms
Yi Ou, Theo Härder, Daniel Schall 0002
DEXA (1)3