PERFORMANCE IMPLICATIONS OF REVERSE CHAINS WITH CHAINED PROGRESSIVE OVERFLOW FILES
The conventional method of loading overflow records in a hash file employing chained progressive overflow requires that the overflow records be loaded as a linked list, with the pointers pointing to the next record of the list. The paper deals with a variation, called reverse chaining, where records...
| Main Author: | |
|---|---|
| Format: | Other/Unknown Material |
| Language: | English |
| Published: |
University of Calgary
1984
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1880/46275 https://doi.org/10.11575/PRISM/30454 |
| Summary: | The conventional method of loading overflow records in a hash file employing chained progressive overflow requires that the overflow records be loaded as a linked list, with the pointers pointing to the next record of the list. The paper deals with a variation, called reverse chaining, where records are loaded in the normal sequence but each record except the home address record points to the prior record of the chain. The home address record points only to the most distant record of the chain, so that performance is improved for record insertion since the entire chain does not have to be scanned. Other aspects of performance are not affected. An analysis of the performance implications shows that the improvement is significant. We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca |
|---|