Patent EP0336586A2 successfully refreshed from Google Patents.
EP0336586A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Data storage, retrieval and transmission in computer systems
Assignee: International Business Machines Corp
•
Filing: 1989-03-16
•
Granted: —
•
Expires: 2009-03-16
Abstract
Abstract In order to provide for the efficient storing, accessing and/or transmission of a relational data table of a computer system, the table is stored as a plurality of records, arranged successively in series, said records comprising a plurality of data ("D") records of variable length and including items of data for a particular row arranged serially in succession, thereby forming a plurality of data rows and columns with each item of data in each D record arranged in a separate column; and a plurality of column descriptor ("C") records, each C record being associated with one table column and specifying: (i) the identification of prescribed attributes of the column associated with the respective C record, such as column name, data type, codepage, etc.; (ii) the identification of the associated D record in a table row which contains the items of data to be located in the associated column; (iii) the maximum number of characters forming an item of data in the associated column if the number is not implied by the data type therein; and (iv) the position of the associated column in associated D record, whereby null or varying length data items which terminate a D record are compressible.
Inventors
- 👤 Virginia Lee Alexander
- 👤 James Louis Gaudet
- 👤 Lloyd Eugene Jordan Ii
- 👤 Raymond Hernandez
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-30 19:45
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/28; G06F16/284
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
178 words
A relational data table for a computer system comprising a plurality of items of data arranged logically at the intersections of a plurality of table rows and a plurality of table columns, the table being formed by a plurality of records, such records comprising; (1) a group of one or more data ("D") records for each table row, each D record being of variable length and including one or more items of data for that row arranged serially in succession and terminating with a data character which may be null or of a variable length, the data items for the rows being ordered in a consistent manner within their respective groups of D records, (2) a plurality of column descriptor ("C") records, each C record being associated with one table column and identifying the location of the record of each group which contains the data item for the column, and the beginning position of the associated data item column in the associated D record; whereby null or varying length data items which terminate a D record are compressible.
Claim 2
Dependent Claim
178 words
A relational data table for a computer system comprising a plurality of items of data arranged logically at the intersections of a plurality of table rows and a plurality of table columns, the table being formed by a plurality of records, such records comprising; (1) a group of one or more data ("D") records for each table row, each D record being of variable length and including one or more items of data for that row arranged serially in succession and terminating with a data character which may be null or of a variable length, the data items for the rows being ordered in a consistent manner within their respective groups of D records, (2) a plurality of column descriptor ("C") records, each C record being associated with one table column and identifying the location of the record of each group which contains the data item for the column, and the beginning position of the associated data item column in the associated D record; whereby null or varying length data items which terminate a D record are compressible.
Claim 3
Dependent Claim
46 words
A relational data table as claimed in claim 1, wherein each C record includes an indication of the maximum number of characters forming an item of data in the associated column, if that number is not implied by the type of data in the data item.
Claim 4
Dependent Claim
29 words
A relational data table as claimed in claim 1 or claim 2, wherein the records are arranged in series with all of the C records preceding the D records.
Claim 5
Dependent Claim
60 words
A relational data table as claimed in any preceding claim, wherein a header ("H") record is included which H record specifies some or all of the following information: (i) the software program that generated the table; (ii) the length of the H record; (iii) the codepage environment of the table;. (iv) the date and time of writing of the table.
Claim 6
Dependent Claim
70 words
A relational data table as claimed in any preceding claim, which further includes a table ("T") record which specifies one or more of the following items of information: (i) the type of computer with which machine format the data within the table is compatible; (ii) the length of the T record; (iii) the number of C records in the table; (iv) the name for the data contained in the table.
Claim 7
Dependent Claim
19 words
A relational data table as claimed in any preceding claim, wherein each D record further specifies its own length.
Claim 8
Dependent Claim
47 words
A relational data table as claimed in any preceding claim, wherein each D record includes a code which identifies such D record, and wherein the identification codes for the D records of any given row in the table are different from each other and in ascending order.
Claim 9
Dependent Claim
26 words
A relational data table as claimed in any preceding claim, wherein the identification of the associated D record in the C record includes the identification code.
Claim 10
Dependent Claim
19 words
A relational data table as claimed in any preceding claim, wherein each C record further specifies its own length.
Claim 11
Dependent Claim
25 words
A relational data table as claimed in any preceding claim, wherein the column identification of each C record includes a name for the associated column.
Claim 12
Dependent Claim
27 words
A relational data table as claimed in any preceding claim, wherein the C record further specifies whether nulls are permitted to be entered in the associated column.
Claim 13
Dependent Claim
28 words
A relational data table as claimed in any preceding claim, wherein the C record specifies the codepage environment of the data to be stored in the associated column.
Claim 14
Dependent Claim
27 words
A relational data table as claimed in any preceding claim, wherein the C record specifies the type of data which may be entered in the associated column.
Claim 15
Dependent Claim
67 words
A relational data table as claimed in any preceding claim, wherein the C record further specifies the length of the data item which may be entered in the associated column, if such length is not implied by the data type, the data length being the maximum length of the data item if the data item which may be entered in the associated column is of variable length.
Claim 16
Dependent Claim
33 words
A relational data table as claimed in any preceding claim, wherein the C record includes a number specifying the position within a data record of the data item associated with the corresponding column.
Claim 17
Dependent Claim
20 words
A digital computer system maintaining on a record medium thereof a relational data table as claimed in any preceding claim.
Claim 18
Independent Claim
200 words
A method of storing for accessing and/or transmitting, a relational data table of a digital computer system comprising a plurality of items of data logically arranged at the intersections of a plurality of table rows and a plurality of table columns, the method including the step of storing, on a record medium, the table as a plurality of records arranged successively in series, such records comprising; (1) a group of one or more data ("D") records for each table row, each D record being of variable length and including one or more items of data for that row arranged serially in succession and terminating with a data character which may be null or of a variable length, the data items for the rows being ordered in a consistent manner within their respective groups of D records, (2) a plurality of column descriptor ("C") records, each C record being associated with one table column and identifying the location of the record of each group which contains the data item for the column, and the beginning position of the associated data item column in the associated D record; whereby null or varying length data items which terminate a D record are compressible.
Claim 19
Independent Claim
200 words
A method of storing for accessing and/or transmitting, a relational data table of a digital computer system comprising a plurality of items of data logically arranged at the intersections of a plurality of table rows and a plurality of table columns, the method including the step of storing, on a record medium, the table as a plurality of records arranged successively in series, such records comprising; (1) a group of one or more data ("D") records for each table row, each D record being of variable length and including one or more items of data for that row arranged serially in succession and terminating with a data character which may be null or of a variable length, the data items for the rows being ordered in a consistent manner within their respective groups of D records, (2) a plurality of column descriptor ("C") records, each C record being associated with one table column and identifying the location of the record of each group which contains the data item for the column, and the beginning position of the associated data item column in the associated D record; whereby null or varying length data items which terminate a D record are compressible.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.