Zusammenfassung
The integrity of B-tree structures can become compromised for many reasons. Since these inconsistencies manifest themselves in unpredictable ways, all commercial database management systems include mechanisms to verify the integrity and trustworthiness of
Graefe, G. & Stonecipher, R.,
(2009).
Efficient verification of B-tree integrity.
In:
Freytag, J.-C., Ruf, T., Lehner, W. & Vossen, G.
(Hrsg.),
Datenbanksysteme in Business, Technologie und Web (BTW) – 13. Fachtagung des GI-Fachbereichs "Datenbanken und Informationssysteme" (DBIS).
Bonn:
Gesellschaft für Informatik e.V..
(S. 27-46).
@inproceedings{mci/Graefe2009,
author = {Graefe, Goetz AND Stonecipher, Ryan},
title = {Efficient verification of B-tree integrity},
booktitle = {Datenbanksysteme in Business, Technologie und Web (BTW) – 13. Fachtagung des GI-Fachbereichs "Datenbanken und Informationssysteme" (DBIS)},
year = {2009},
editor = {Freytag, Johann-Christoph AND Ruf, Thomas AND Lehner, Wolfgang AND Vossen, Gottfried}
,
pages = {
27-46
},
publisher = {Gesellschaft für Informatik e.V.},
address = {Bonn}
}
(en)