Trie Hashing with Controlled Load .
| dc.contributor.author | Litwin, Witold | en_US |
| dc.contributor.author | Roussopoulos, N. | en_US |
| dc.contributor.author | Levy, G. | en_US |
| dc.contributor.author | Wang, H. | en_US |
| dc.contributor.department | ISR | en_US |
| dc.date.accessioned | 2007-05-23T09:43:10Z | |
| dc.date.available | 2007-05-23T09:43:10Z | |
| dc.date.issued | 1989 | en_US |
| dc.description.abstract | Trie hashing is an access methods to primary key ordered dynamic files. The key address is computed through a trie. Key search needs usually one disk access since the trie may be in core and needs two accesses for very large files, when the trie has to be on the disk. We present a new variant of the method that allows to set up an arbitrary load factor for ordered insertions. In particular, one may create compact files, loaded up to 100%. We show that the capabilities of trie hashing make the method preferable to a B-tree by most of criteria that motivated the latter method supremacy over the database world. | en_US |
| dc.format.extent | 1445929 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/4862 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 1989-13 | en_US |
| dc.title | Trie Hashing with Controlled Load . | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1