Locating information in an unsorted database utilizing a B-tree

Details Locating information in an unsorted database utilizing a B-tree Locating information in an unsorted database utilizing a B-tree

1992-12-23

1995-05-23

Black, Thomas G.

Boots, shoes, and leggings

364DIG1, 36422281, 3642229, G06F 1540

Patent

active

054189470

ABSTRACT:
A binary search tree is created having a plurality of linked tree nodes, each of which store a key generated using a predetermined hashing function for each record in a database based upon a predetermined set of fields of each record. Tree nodes consist of such keys and the address of the corresponding record. The keys are arranged on the tree relative to the numerical value of keys previously entered in the tree. To locate a particular record, the key is generated for the record and the tree is traversed to locate a tree node having an identical key value. The address stored with the matching node in the tree is utilized to access the record.

REFERENCES:
patent: 4215402 (1980-07-01), Mitchell et al.
patent: 4527239 (1985-07-01), Brandin
patent: 4611272 (1986-09-01), Lomet
patent: 4677550 (1987-06-01), Ferguson
patent: 4922417 (1990-05-01), Churm et al.
patent: 5204958 (1993-04-01), Cheng et al.
patent: 5319779 (1994-06-01), Chang et al.

Affiliated with

Also associated with

Rating

Locating information in an unsorted database utilizing a B-tree does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Locating information in an unsorted database utilizing a B-tree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Locating information in an unsorted database utilizing a B-tree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2147745