Method for updating an index tree structure of data based on nod

Details Method for updating an index tree structure of data based on nod Method for updating an index tree structure of data based on nod

1992-07-07

1994-04-26

Bowler, Alyssa H.

Boots, shoes, and leggings

395425, 3642516, 3642524, 3642832, 364DIG1, 3642831, 3642821, 36422281, 36422282, G06F 700, G06F 714, G06F 724, G06F 1208

Patent

active

053074866

ABSTRACT:
In a data processing system for processing data having an index tree structure, a buffer rate is set in advance. When a record is to be inserted or deleted, this buffer rate is used so that a data process to be performed can be selected from a simple insert process, an overflow process, node split process, a simple delete process, an underflow process, and a node concatenation process. With this operation, the data of the index tree structure can be efficiently processed.

REFERENCES:
patent: 4032899 (1977-06-01), Jenny et al.
patent: 4378588 (1983-03-01), Katzman et al.
patent: 4468728 (1984-08-01), Wang
patent: 4611272 (1986-09-01), Lomet
patent: 4677550 (1987-06-01), Ferguson
patent: 4879561 (1989-11-01), Inkol
patent: 4914569 (1990-04-01), Levine et al.
patent: 4945475 (1990-07-01), Bruffey et al.
patent: 5089952 (1992-02-01), Bozman
patent: 5202986 (1993-04-01), Nickel
Computing Surveys vol. 11 No. 2 Jun. 1979 pp. 121-237 "The Ubiquitous B-tree". This document shows various forms of a B-tree.

Affiliated with

Also associated with

Rating

Method for updating an index tree structure of data based on nod 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 updating an index tree structure of data based on nod, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for updating an index tree structure of data based on nod will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1719045