root@lake.scar.toronto.edu (William Barek) (06/07/89)
I would like to write DA or an application which will be a specialized
dictionary. The key might require a 2 bytes per character (it is a
specialized alphabet - glyphs). It will have approx 300,000 entries and
for each key there might be up to a page of text. I would like to be
fairly fast and there might be a cross-indexing from the text.
I would appreciate any help in pointing me in the right direction in
terms of algorithms( hash table vs B-tree) and if there is any public C-sources
that could could be obtained as a starting point.
Many thanks wb
Please send me an e-mail:
barek@bluffs.scar.utoronto.ca