Reverse-byte indexing

Details Reverse-byte indexing Reverse-byte indexing

1996-10-30

1999-09-21

Choules, Jack M.

Data processing: database and file management or data structures

Database design

Data structure types

G06F 1230

Patent

active

059567058

ABSTRACT:
A method and apparatus for inserting sorted data into an indexed table is provided. Two or more nodes are used to insert the data into the indexed table. Before an entry for each inserted row is stored in the index associated with the table, the key values in the index entry are transformed using an operation that affects the order of the key values. For example, the order of the bytes used to represent the key values in the index entry may be reversed. The index entries are stored in the portion of the index that corresponds to the transformed key values. As a result, the entries for consecutive key values will not necessarily be stored in the same portion of the index. Consequently, the nodes will not have to compete for a "hot" portion of an index if the nodes are inserting data with key values that fall into the same approximate range. The inverse of the transformation operation is performed on the transformed key values read from the index before the key values are supplied to the user.

REFERENCES:
patent: 5467471 (1995-11-01), Bader
patent: 5490258 (1996-02-01), Fenner
patent: 5629695 (1997-05-01), Watts et al.

Affiliated with

Also associated with

Rating

Reverse-byte indexing does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Reverse-byte indexing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reverse-byte indexing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-91643