System and method for using a compressed trie to estimate...

Details System and method for using a compressed trie to estimate... System and method for using a compressed trie to estimate...

2007-12-11

2007-12-11

Mizrahi, Diane D. (Department: 2165)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000

Reexamination Certificate

active

10978901

ABSTRACT:
A compressed trie has nodes including multiple character sub-strings. Such multiple character storage reduces the number of nodes in the trie, thereby reducing the amount of memory required for storing the trie and reducing the amount of time required to perform matching. Furthermore, in such a compressed trie, sub-strings are stored in a single character string. Each node references its corresponding sub-string by the sub-string's starting position and length in the character string. Multiple nodes may reference a single sub-string. Thus, referencing rather than storing sub-strings in corresponding nodes eliminates repetitive sub-string storage, thereby reducing the amount of memory required for storing the trie.

REFERENCES:
S.M. Jafar Rizvi, et al., Comparison of Hash Table Verses Lexical Transducer based Implementations of Urdu Lexicon, 2005, ieeexplore.ieee.org/ie15/10465/33211, pp. 1-6.
Stephan Schosser et al., An Indexing Scheme for Update Propagtion in Large Mobile Information Systems, Mar. 15, 2004, www.ipd.ira.uka.del/-schosser, pp. 1-12.

Affiliated with

Also associated with

Rating

System and method for using a compressed trie to estimate... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System and method for using a compressed trie to estimate..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for using a compressed trie to estimate... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3883059