Acta Informatica
An introduction to database systems: vol. 1 (5th ed.)
An introduction to database systems: vol. 1 (5th ed.)
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Time- and space-optimality in B-trees
ACM Transactions on Database Systems (TODS)
ACM Transactions on Database Systems (TODS)
Concurrent operations on B-trees with overtaking
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Communications of the ACM
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
Handbook of Algorithms
Multi-table search for B-tree files
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Storage mappings for multidimensional linear dynamic hashing
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
EDBT '88 Proceedings of the International Conference on Extending Database Technology: Advances in Database Technology
Proceedings of the Fourth International Conference on Data Engineering
The Bounded Disorder Access Method
Proceedings of the Second International Conference on Data Engineering
The Reconstruction and Optimization of Trie Hashing Functions
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Query Processing on Personal Computers: A Pragmatic Approach (Extended Abstract)
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
New results on the size of tries
IEEE Transactions on Information Theory
LH: Linear Hashing for distributed files
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
A Trie Compaction Algorithm for a Large Set of Keys
IEEE Transactions on Knowledge and Data Engineering
A dynamic construction algorithm for the compact patricia trie using the hierarchical structure
Information Processing and Management: an International Journal
RP*: A Family of Order Preserving Scalable Distributed Data Structures
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
A compression algorithm using integrated record information for translation dictionaries
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Informatics and computer science intelligent systems applications
Hashed patricia trie: efficient longest prefix matching in peer-to-peer systems
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
An approach for indexing file names in a directory
Proceedings of the 13th International Conference on Computer Systems and Technologies
| Hi-index | 0.00 |
Trie hashing (TH), a primary key access method for storing and accessing records of dynamic files, is discussed. The key address is computed through a trie. A key search usually requires only one disk access when the trie is in core and two disk accesses for very large files when the trie must be on disk. A refinement to trie hashing, trie hashing with controlled load (THCL), is presented. It is designed to control the load factor of a TH file as tightly as that of a B-tree file, allows high load factor of up to 100% for ordered insertions, and increases the load factor for random insertions from 70% to over 85%. It is shown that these properties make trie hashing preferable to a B-tree.