6 research outputs found

    VLC Tries

    No full text
    The basic trie structure has the desirable feature of O(j W j) access time to determine if key word W is present but tries also have the undesirable feature of an excessive amount of wasted storage. A variation of the trie, called a VLC trie, addresses the issue of wasted storage when storing large static data sets while maintaining the O(j W j) access time. The VLC trie applies a divide and conquer approach to minimize storage requirements through the efficient storage of the different components of the basic trie structure
    corecore