Method of optimizing an N-gram memory structure

Details Method of optimizing an N-gram memory structure Method of optimizing an N-gram memory structure

1997-09-26

1999-10-12

Lintz, Paul R.

Data processing: database and file management or data structures

Database design

Data structure types

707 3, G06F 1730

Patent

active

059667095

ABSTRACT:
By placing a low cardinality node or a leaf in a lower level, and a high cardinality node or a leaf at a higher level, an optimal memory structure is automatically generated which yields the best compression within N-gram technology. After making an initial list of parallel streams or fields, the streams are ordered in accordance with increasing cardinality. Adjacent streams (fields), or nodes, are paired, and the children of the resulting node are eliminated from the list, while a new parent node is added to the list. The resulting new list is re-arranged from right to left as a function of increasing cardinality, and the pairing steps are repeated until a single root node is remains for the final memory structure.

REFERENCES:
patent: 4853696 (1989-08-01), Mukherjee
patent: 5245337 (1993-09-01), Bugajski et al.
patent: 5274805 (1993-12-01), Fergurson et al.
patent: 5293164 (1994-03-01), Bugajski
patent: 5533148 (1996-07-01), Sayah et al.
patent: 5592667 (1997-01-01), Bugajski
patent: 5694591 (1997-12-01), Du et al.
patent: 5781906 (1998-07-01), Aggarwal et al.

Affiliated with

Also associated with

Rating

Method of optimizing an N-gram memory structure does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method of optimizing an N-gram memory structure, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of optimizing an N-gram memory structure will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-662542