A pruned TRIE to index a sorted file and its evaluation
- 31 December 1984
- journal article
- Published by Elsevier in Information Systems
- Vol. 9 (2) , 157-165
- https://doi.org/10.1016/0306-4379(84)90024-3
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- New file organization based on dynamic hashingACM Transactions on Database Systems, 1981
- Extendible hashing—a fast access method for dynamic filesACM Transactions on Database Systems, 1979
- Dynamic hashingBIT Numerical Mathematics, 1978
- Associative retrieval trie hash-codingJournal of Computer and System Sciences, 1977
- Hashing and trie algorithms for partial match retrievalACM Transactions on Database Systems, 1976
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- Attribute based file organization in a paged memory environmentCommunications of the ACM, 1974
- VSAM data set design parametersIBM Systems Journal, 1974