Method for balancing of distributed tree file structures in para

Details Method for balancing of distributed tree file structures in para Method for balancing of distributed tree file structures in para

1990-04-16

1993-07-20

Harrell, Robert B.

Boots, shoes, and leggings

364DIG1, 364264, 364265, 364267, 3642821, 3642824, G06F 1100

Patent

active

052300471

ABSTRACT:
A distributed network is described which contains a plurality of interconnected nodes each node including a processor and data storage apparatus. A plurality of key-index data identifiers are distributed among the nodes, with each node including a tree data structure in non-volatile storage defining locations of the key-index data identifiers. The tree data structure includes a ROOT data structure comprising two lists, "NEW ROOT" and "OLD ROOT", each comprised of an ordered array of boundaries assigned nodes for the top level of the tree. A method is described for balancing the tree data structure which comprises the steps of:

REFERENCES:
patent: 4412285 (1983-10-01), Neches et al.
patent: 4445171 (1984-04-01), Neches
patent: 4575798 (1986-03-01), Lindstrom et al.
patent: 4766534 (1988-08-01), DeBenedictis
patent: 4825354 (1989-04-01), Agrawal et al.
patent: 4860201 (1989-08-01), Stolfo et al.
patent: 5020059 (1991-05-01), Gorin et al.
Knuth, "The Art of Computer Programming", vol. 3 Sorting and Searching, Addison-Wesley Publishing Co., 1973, pp. 473-479.

Affiliated with

Also associated with

Rating

Method for balancing of distributed tree file structures in para 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 for balancing of distributed tree file structures in para, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for balancing of distributed tree file structures in para will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1767114