Hybrid trees: A data structure for lists of keys

Authors:
W. A. Walker;C. C. Gotlieb
Affiliations:
-;-
Venue:
SIGFIDET '72 Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control
Year:
1972

Citing 5
Cited 0

Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting

Journal of the ACM (JACM)
Randomized binary searching with tree structures

Communications of the ACM
Use of tree structures for processing files

Communications of the ACM
Trie memory

Communications of the ACM
Information retrieval: information storage and retrieval using AVL trees

ACM '65 Proceedings of the 1965 20th national conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

A generalization of the binary tree and the Trie, called the hybrid tree, is defined in which a node can correspond to a key, to any substring in a key, or to a character of the alphabet from which the keys are formed. An algorithm is given for constructing an optimal hybrid tree and it is shown that the search time of an optimal hybrid tree is never larger than the search time of the Trie or the optimal binary tree representing the same set of keys.