Efficient verification of B-tree integrity

dc.contributor.author	Graefe, Goetz
dc.contributor.author	Stonecipher, Ryan
dc.contributor.editor	Freytag, Johann-Christoph
dc.contributor.editor	Ruf, Thomas
dc.contributor.editor	Lehner, Wolfgang
dc.contributor.editor	Vossen, Gottfried
dc.date.accessioned	2019-02-20T10:28:16Z
dc.date.available	2019-02-20T10:28:16Z
dc.date.issued	2009
dc.identifier.isbn	978-3-88579-238-3
dc.identifier.issn	1617-5468
dc.identifier.uri	http://dl.gi.de/handle/20.500.12116/20482
dc.description.abstract	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	en
dc.language.iso	en
dc.publisher	Gesellschaft für Informatik e.V.
dc.relation.ispartof	Datenbanksysteme in Business, Technologie und Web (BTW) – 13. Fachtagung des GI-Fachbereichs "Datenbanken und Informationssysteme" (DBIS)
dc.relation.ispartofseries	Lecture Notes in Informatics (LNI) - Proceedings, Volume P-144
dc.title	Efficient verification of B-tree integrity	en
dc.type	Text/Conference Paper
dc.pubPlace	Bonn
mci.reference.pages	27-46
mci.conference.sessiontitle	Regular Research Papers
mci.conference.location	Münster
mci.conference.date	2.-6. März 2009