Journal article icon

Journal article

Generalizing generalized tries

Abstract:

A trie is a search tree scheme that employs the structure of search keys to organize information. Tries were originally devised as a means to represent a collection of records indexed by strings over a fixed alphabet. Based on work by C.P. Wadsworth and others, R.H. Connelly and F.L. Morris generalized the concept to permit indexing by elements built according to an arbitrary signature. Here we go one step further and define tries and operations on tries generically for arbitrary datatypes of...

Expand abstract

Actions


Access Document


Publisher copy:
10.1017/S0956796800003713

Authors


Journal:
JFP
Volume:
10
Issue:
4
Pages:
327-351
Publication date:
2000-01-01
DOI:
URN:
uuid:307b9a99-90c8-4c24-9e60-8e2ff69242c9
Local pid:
cs:4830

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP