Patent EP0079465A2 successfully refreshed from Google Patents.
EP0079465A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Method for storing and accessing a relational data base
Assignee: International Business Machines Corp
•
Filing: 1982-10-14
•
Granted: —
•
Expires: 2002-10-14
Abstract
Abstract An improved method for storing and accessing relational data bases in information processing systems. The data base records (44) are synthesized into a summary sorted list (45) of unique data elements. The data elements are related by virtue of their positions in the sorted list to pointers stored in an index table (43) which is an isomorphic mapping of the data base records from which the summary sorted list was derived. The index table captures the record content and juxtaposition of the record fields in a relational manner and yields the effect of a totally inverted data base file. The index table pointers facilitate high speed relational query processing with a minimum allocation of memory.
Inventors
- 👤 David Glickman
- 👤 Walter Steven Rosenbaum
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-28 22:16
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/28; G06F16/284; G06F16/90; G06F16/901; G06F16/9017
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
95 words
A method for encoding and compactly storing an information data base characterized in that it comprises the steps of : a) accessing records from said information data base; b) accessing information fields from said records; c) arranging said information fields into a list of unique items; d) associating a position code with each unique item; e) forming an index table of records by replacing each field in each record in said information data base with its unique item list position code; and f) storing said index table of records and said list of unique items.
Claim 2
Independent Claim
95 words
A method for encoding and compactly storing an information data base characterized in that it comprises the steps of : a) accessing records from said information data base; b) accessing information fields from said records; c) arranging said information fields into a list of unique items; d) associating a position code with each unique item; e) forming an index table of records by replacing each field in each record in said information data base with its unique item list position code; and f) storing said index table of records and said list of unique items.
Claim 3
Dependent Claim
28 words
Method according to Claim 1 characterized in that the step of arranging said information fields includes sorting said information fields into alphabetical and numerical order and deleting duplicates.
Claim 4
Dependent Claim
26 words
Method according to Claim 1 or 2 characterized in that said step of associating a position code includes associating a sequence number with each unique item.
Claim 5
Independent Claim
96 words
A method for relational accessing of information stored in a data base characterized in that it comprises the steps of: a) receiving an input query of related items; b) determining the relative positions of said related items in a prestored list of unique items; c) comparing said relative positions to a prestored index table of records of relative positions; d) saving the records from said index table of records that compare equal; and e) replacing the fields in the saved index table of records with the corresponding unique items from the prestored list of unique items.
Claim 6
Independent Claim
96 words
A method for relational accessing of information stored in a data base characterized in that it comprises the steps of: a) receiving an input query of related items; b) determining the relative positions of said related items in a prestored list of unique items; c) comparing said relative positions to a prestored index table of records of relative positions; d) saving the records from said index table of records that compare equal; and e) replacing the fields in the saved index table of records with the corresponding unique items from the prestored list of unique items.
Claim 7
Dependent Claim
23 words
Method of relational accessing according to Claim 4 characterized in that the prestored list of unique items are alphabetic and numeric data fields.
Claim 8
Dependent Claim
19 words
Method of relational accessing according to Claim 4 or 5 characterized in that the relative positions are sequence numbers.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.