Skip Navigation

The Computer Journal 1981 24(4):367-373; doi:10.1093/comjnl/24.4.367
© 1981 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (6)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Mullin, J. M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Change area B-trees: A technique to aid error recovery

J. M. Mullin *

Computer Science Department, University of Western Ontario, London, Canada

B-tree structures with the restriction that all data records are stored at the leaves of the tree are investigated from the standpoint of recovery from hardware and software errors. A technique is presented for maintaining the original file inviolate—which could reside on read only memory—and recording changes in a separate area. Standard algorithms are used for direct access search and hence retrieval time is not affected. Update algorithms are slightly altered to direct all modifications to a separate area. Expressions are developed for storage and time penalties. Due to system overheads, the range of application is limited to files which can tolerate small blocking factors. The technique is contrasted to differential files and a direct point comparison is made to an earlier paper by Severance and Lohman.

Received May 1980. revised August 1980.

* Computer Science Department, University of Western Ontario, London, Ontario, Canada N6A 5B9


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.