Engineering Aggregation Operators for Relational In-Memory Database Systems
Abstract (englisch):
In this thesis we study the design and implementation of Aggregation operators in the context of relational in-memory database systems. In particular, we identify and address the following challenges: cache-efficiency, CPU-friendliness, parallelism within and across processors, robust handling of skewed data, adaptive processing, processing with constrained memory, and integration with modern database architectures. Our resulting algorithm outperforms the state-of-the-art by up to 3.7x.
| Zugehörige Institution(en) am KIT | Institut für Theoretische Informatik (ITI) |
| Publikationstyp | Hochschulschrift |
| Publikationsjahr | 2016 |
| Sprache | Englisch |
| Identifikator | urn:nbn:de:swb:90-556750 KITopen-ID: 1000055675 |
| Verlag | Karlsruher Institut für Technologie (KIT) |
| Art der Arbeit | Dissertation |
| Fakultät | Fakultät für Informatik (INFORMATIK) |
| Institut | Institut für Theoretische Informatik (ITI) |
| Prüfungsdatum | 11.02.2016 |
| Schlagwörter | database systems, query processing, aggregation, algorithm engineering, cache-efficiency |
| Nachgewiesen in | OpenAlex |
| Referent/Betreuer | Sanders, P. |
