Online bit flip detection for in-memory B-trees live!
| dc.contributor.author | Kolditz, Till | |
| dc.contributor.author | Schlegel, Benjamin | |
| dc.contributor.author | Habich, Dirk | |
| dc.contributor.author | Lehner, Wolfgang | |
| dc.contributor.editor | Seidl, Thomas | |
| dc.contributor.editor | Ritter, Norbert | |
| dc.contributor.editor | Schöning, Harald | |
| dc.contributor.editor | Sattler, Kai-Uwe | |
| dc.contributor.editor | Härder, Theo | |
| dc.contributor.editor | Friedrich, Steffen | |
| dc.contributor.editor | Wingerath, Wolfram | |
| dc.date.accessioned | 2017-06-30T11:40:50Z | |
| dc.date.available | 2017-06-30T11:40:50Z | |
| dc.date.issued | 2015 | |
| dc.description.abstract | Hardware vendors constantly decrease the feature sizes of integrated circuits to obtain higher performance and energy efficiency. As a side-effect, integrated circuits - like CPUs and main memory - become more and more vulnerable to external influences and thus unreliable, which results in increasing numbers of (multi-) bit flips. From a database perspective bit flip errors in main memory will become a major challenge for modern in-memory database systems, which keep all their enterprise data in volatile, unreliable main memory. Existing hardware error control techniques like ECC-DRAM are able to detect and correct memory errors, but their detection and correction capabilities are limited and come along with several downsides. To underline this we heat up RAM live on-site to show possible error rates of future hardware. We previously presented various techniques for the B-Tree - as a wide-spread index structure - for online error detection and thus increase its overall reliability [Kea14b]. We also show live performance comparisons in terms of throughput and error detection rates between several bit flip detecting B-Tree variants. By that, we demonstrate the tradeoff between detection accuracy and index throughput. Furthermore, we show annotated structural information about the trees like corrupted nodes and inaccessible sub-trees. | en |
| dc.identifier.isbn | 978-3-88579-635-0 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | Datenbanksysteme für Business, Technologie und Web (BTW 2015) | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-241 | |
| dc.title | Online bit flip detection for in-memory B-trees live! | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 678 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 675 | |
| gi.conference.date | 2.-3. März 2015 | |
| gi.conference.location | Hamburg |
Dateien
Originalbündel
1 - 1 von 1