Please use this identifier to cite or link to this item: doi:10.22028/D291-26451
Title: The reconstruction problem for dynamic data structures, an overview
Author(s): Smid, Michiel
Language: English
Year of Publication: 1990
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: The reconstruction problem is the following: given a searching problem, design an efficient main memory data structure that solves this problem, together with a shadow administration, to be stored in secondary memory, such that the original main memory structure can be reconstructed in case of e.g. a system crash. The problem is illustrated by considering a specific example of a searching problem, the union-find problem. Furthermore, a general technique is given to implement any shadow administration efficiently. Finally, the technique of deferred data structuring is applied for solving the reconstruction problem.
Link to this record: urn:nbn:de:bsz:291-scidok-51437
Series name: Technischer Bericht / A / Fachbereich Informatik, Universität des Saarlandes
Series volume: 1990/05
Date of registration: 3-Apr-2013
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
fb14_1990_05.pdf50,31 MBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.