Please use this identifier to cite or link to this item:
doi:10.22028/D291-26454
Title: | Dynamic data structures on multiple storage media, a tutorial |
Author(s): | Smid, Michiel van Emde Boas, Peter |
Language: | English |
Year of Publication: | 1990 |
Free key words: | binary search trees range trees secondary memory |
DDC notations: | 004 Computer science, internet |
Publikation type: | Report |
Abstract: | Two problems are considered that deal with dynamic data structures on multiple storage media. In the first problem we want to partition a range tree into parts of a small size, such that queries and updates visit only a small number of parts. In this way, the range tree can be maintained in secondary memory efficiently. The second problem is the reconstruction problem: given a main memory data structure, design a shadow administration, to be stored in secondary memory, such that the main memory structure can be reconstructed after e.g. a system crash. |
Link to this record: | urn:nbn:de:bsz:291-scidok-51463 hdl:20.500.11880/26510 http://dx.doi.org/10.22028/D291-26454 |
Series name: | Technischer Bericht / A / Fachbereich Informatik, Universität des Saarlandes |
Series volume: | 1990/15 |
Date of registration: | 4-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 | Size | Format | |
---|---|---|---|---|
fb14_1990_15.pdf | 69,86 MB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.