All searches are divided into three parts: string searches using ternary trees

Authors:
David E. Siegel
Affiliations:
Two Independence Way, Princeton, NJ
Venue:
APL '98 Proceedings of the APL98 conference on Array processing language
Year:
1998

Citing 4
Cited 0

Algorithms in C

Algorithms in C
Fast algorithms for sorting and searching strings

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The analysis of hybrid trie structures

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Randomized binary searching with tree structures

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the problem of searching for strings in a dictionary or symbol table. It presents a data structure which can be used for this purpose---the Ternary Tree. It considers the theoretical properties of this structure, compared with other possible structures for the same purpose. It presents an implementation of this structure in APL, including code to do a variety of operations on it.