Die Klausureinsicht zur Datenbankprüfung in Sommersemester 2018 findet am 11. Oktober 14:00 Uhr im Raum APB 3105 statt. Bitte die Teilnahme an der Einsicht per Email an email@example.com anzeigen.
The Database Systems Group Dresden (Chair of Database) at the Institute of Systems Architecture of the Faculty of Computer Science at TU Dresden was established in 2002 and is lead by Prof. Wolfgang Lehner.
Research activities conducted by the database systems group focus on the problem of adding application-specific functionality to the classical concept of a database management system. The general goal of research activities is the development of a database management system that will be the central integration and analysis platform within an enterprise-wide data organization system.
We are happy to announce that our paper „Column Scan Optimization by Increasing Intra-Instruction Parallelism“ written by Nusrat Jahan Lisa, Annett Ungethüm, Dirk Habich, Nguyen Duy Anh Tuan, Akash Kumar, and Wolfgang Lehner has been awarded with the Best Paper of the 2018 DATA conference in Porto, Portugal.
We are delighted to announce that our paper „Lower Bound-oriented Parameter Calculation for AN coding“ written by Juliana Hildebrandt, Till Kolditz, Dirk Habich, and Wolfgang Lehner has been accepted at the International Symposium on Information Theory and Its Applications (ISITA). ISITA is the leading conference on information theory.
Abstract: The hardware as well as software communities have recently experienced a shift towards mitigating bit flips issues in software, rather than completely mitigating only in hardware. For this software error mitigation, arithmetic error coding schemes like AN coding are increasingly applied because arithmetic operations can be directly executed without decoding and bit flip detection is provided in an end-to-end fashion. In this case, the encoded data words are computed by multiplying a constant integer value A onto each original data word. To reliably detect b bit flips in each code word, the value A has to be well-chosen, so that a minimum Hamming distance of b+1 can be guaranteed. However, the value A depends on the data word length as well as on the desired minimum Hamming distance. Up to now, a very expensive brute force approach for computation of the value for A is applied. To tackle that in a more efficient way, we present a lower bound-oriented approach for this calculation in this paper.