| Current Forum: Homework 4 - Lempel Ziv (Part 2) |
| Date: Mon Oct 15 2001 12:47 pm |
| Author: Brands, Marc C. <brands@cmu.edu> |
| Subject: Implemantation of Directory |
|
|
What data structure would you recommend to use for our Stringtable. Many documents seem to use a hash table. I came up with a a structure that uses a Trie with pointers in both directions(to the children and to the parent) and a index vector that points directly to the node that represents the string. Do you think that might get too slow if the String get's too large?
Marc |
|