Patent
1992-11-02
1997-05-06
Black, Thomas G.
395898, G06F 724
Patent
active
056280025
ABSTRACT:
Arrangement of fields in binary tree nodes provides a minimal storage encoding storing fixed and variable length keys in factored form in a multilevel tree. A locating method, and apparatus embodying that method, directed by an argument key, which may or may not be stored in the tree, traces a path following arcs upward or downward between nodes in said binary tree, starting from the top node or any other node, until it finds either the argument key or the delta arc where said argument key would be inserted into said tree. The novel binary tree encoding also provides for path tracing starting at a data backpointer field, which allows accessing of neighboring data entries in collating sequence order.
REFERENCES:
patent: 4181821 (1980-01-01), Pirz et al.
patent: 5018201 (1991-05-01), Sugawara
patent: 5131055 (1992-07-01), Chao
patent: 5317507 (1994-05-01), Gallant
patent: 5317741 (1994-05-01), Schwanke
M. Mano, "Digital Logic and Computer Design" Prentice-Hall, pp. 145-149. 1979.
G. Salton "Automatic Text Processing" Addison-Wesley pp. 328-338, 1989.
Black Thomas G.
Choules Jack M.
Taphorn Joseph B.
LandOfFree
Binary tree flag bit arrangement and partitioning method and app does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Binary tree flag bit arrangement and partitioning method and app, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Binary tree flag bit arrangement and partitioning method and app will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2140134