B-tree structured data base using sparse array bit maps to store

Details B-tree structured data base using sparse array bit maps to store B-tree structured data base using sparse array bit maps to store

1983-08-17

1986-08-12

Springborn, Harvey E.

Boots, shoes, and leggings

364300, G06F 15347, G06F 700, G06F 1204

Patent

active

046060022

ABSTRACT:
Variable length data (e.g., for hospital patients) is embedded in a B-tree type index structure of a relational data base. A logically related inverted B-tree index is used to access the original index. Access time, and storage space for the inverted lists, are decreased by data compression techniques and by encoding certain inverted list parameters in sparse array bit maps.

REFERENCES:
patent: 3593309 (1971-07-01), Clark et al.
patent: 3602895 (1971-08-01), Loizides
patent: 3603937 (1971-09-01), Loizides et al.
patent: 3643226 (1972-02-01), Loizides et al.
patent: 3646524 (1969-12-01), Clark et al.
patent: 3651843 (1972-03-01), Clark et al.
patent: 3670310 (1972-06-01), Bharwani et al.
patent: 3916387 (1972-10-01), Woodrum
patent: 4030078 (1977-06-01), Kluge
patent: 4220103 (1980-09-01), Chang et al.
patent: 4283771 (1981-08-01), Chang
patent: 4553206 (1985-11-01), Smutek et al.
W. Schneider et al, Klaukon--A Microprocessor System for Free Text Acquisition with Automatic Error Checking, Semi-Automatic Indexing and Retrieval, Conf.: Proceedings of the IFIP-IMIA(TC4) Working Conf., Rome, Italy (Feb. 6-8, 1980), pp. 193-214.
A. Waisman, A Flexible Generalized Information System, Masters Thesis, Israel Institute of Technology (Haifa, Jun. 1974) pp. 1-111.

Affiliated with

Also associated with

Rating

B-tree structured data base using sparse array bit maps to store does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with B-tree structured data base using sparse array bit maps to store, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and B-tree structured data base using sparse array bit maps to store will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1947675