Sparse array bit map used in data bases

Details Sparse array bit map used in data bases Sparse array bit map used in data bases

G - Physics

06

F

354/237

G06F 12/06 (2006.01) G06F 17/30 (2006.01)

Patent

CA 1214284

ABSTRACT OF THE DISCLOSURE A data base system uses a self-descriptive index key format having variable length data fields so that the data base system manipulation is independent of the type and arrangement of the data being stored and retrieved. The data is characterized by three index variables which represent the data table, the record in that table, and a particular field within that record. Each table is composed of data imbedded in the B-tree index structure of the data base. In order to access records using the field variables, the data base additionally includes an inverted B-tree index logically related to the original index. The operation of the index is enhanced by the use of data compression and the use of a sparse array bit map to represent the record associated with each field. The index structure within the data base allows each index variable to identify data by means of the index variables inde- pendently of the physical location in which the data is stored. The efficiency of storage is further enhanced by storing the data in variable length data records. The sparse array bit maps also be used to provide inter- record relationships for records stored in different data tables.

453210

Affiliated with

Also associated with

Rating

Sparse array bit map used in data bases does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Sparse array bit map used in data bases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sparse array bit map used in data bases will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1181608