Logo des Repositoriums
 

Efficient verification of B-tree integrity

dc.contributor.authorGraefe, Goetz
dc.contributor.authorStonecipher, Ryan
dc.contributor.editorFreytag, Johann-Christoph
dc.contributor.editorRuf, Thomas
dc.contributor.editorLehner, Wolfgang
dc.contributor.editorVossen, Gottfried
dc.date.accessioned2019-02-20T10:28:16Z
dc.date.available2019-02-20T10:28:16Z
dc.date.issued2009
dc.description.abstractThe 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 ofen
dc.identifier.isbn978-3-88579-238-3
dc.identifier.pissn1617-5468
dc.identifier.urihttps://dl.gi.de/handle/20.500.12116/20482
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofDatenbanksysteme in Business, Technologie und Web (BTW) – 13. Fachtagung des GI-Fachbereichs "Datenbanken und Informationssysteme" (DBIS)
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-144
dc.titleEfficient verification of B-tree integrityen
dc.typeText/Conference Paper
gi.citation.endPage46
gi.citation.publisherPlaceBonn
gi.citation.startPage27
gi.conference.date2.-6. März 2009
gi.conference.locationMünster
gi.conference.sessiontitleRegular Research Papers

Dateien

Originalbündel
1 - 1 von 1
Lade...
Vorschaubild
Name:
27.pdf
Größe:
238.53 KB
Format:
Adobe Portable Document Format