Patent US4611310A successfully refreshed from Google Patents.
US4611310A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and system for rearranging data records in accordance with keyfield values
Assignee: Canevari Timber Co Inc
•
Filing: 1982-08-23
•
Granted: 1986-09-09
•
Expires: 2002-08-23
Abstract
Abstract A system and method for manipulating a plurality of data records. Each record is comprised of a plurality of bits and is identified by a unique record address value. A portion of each record comprises a keyfield and each keyfield is generally divided into a plurality of sub-keyfields, each having a different order of significance. The sub-keyfield value of greatest significance of each record is utilized to set one memory location in the column of a matrix memory means corresponding to the record address value of that record, said memory location being in the row of the matrix memory means corresponding to the sub-keyfield value of that record. The column position values of the set memory locations are then arranged in order of row position, and the column position values derived from the same row are grouped together. The process is successively repeated, separately for each group of column position values, for the sub-keyfield value of next greatest significance of each record having a record address value corresponding to a column position value in said group as long as at least one group of column position values remain.
Inventors
- 👤 James W. Durbin
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 10:29
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/90; G06F16/903; G06F16/90335; G06F16/90348
Claims Analysis
Total Claims: 29
Claim 1
Independent Claim
178 words
A system for arranging unique record address values corresponding to a plurality of data records wherein each record is comprised of a plurality of bits and is identified by a unique record address value, wherein one or more bits of each record comprises a keyfield and the record address values of the plurality of records are arranged in accordance with the value of said keyfields, said system comprising: a. matrix memory means having a plurality of rows and columns, wherein each row corresponds to a different keyfield value and each column corresponds to a different record address value; b. first control means for setting, for each record, one memory location in the column of the matrix memory means corresponding to the record address value of that record, said memory location being in the row of the matrix memory means corresponding to the keyfield value of that record; and c. second control means for detecting, for each row of the matrix memory means, in order of row position, the column postion of each set memory location in that row.
Claim 2
Independent Claim
178 words
A system for arranging unique record address values corresponding to a plurality of data records wherein each record is comprised of a plurality of bits and is identified by a unique record address value, wherein one or more bits of each record comprises a keyfield and the record address values of the plurality of records are arranged in accordance with the value of said keyfields, said system comprising: a. matrix memory means having a plurality of rows and columns, wherein each row corresponds to a different keyfield value and each column corresponds to a different record address value; b. first control means for setting, for each record, one memory location in the column of the matrix memory means corresponding to the record address value of that record, said memory location being in the row of the matrix memory means corresponding to the keyfield value of that record; and c. second control means for detecting, for each row of the matrix memory means, in order of row position, the column postion of each set memory location in that row.
Claim 3
Dependent Claim
15 words
The system of claim 1 wherein the matrix memory means is a random access memory.
Claim 4
Dependent Claim
78 words
The system of claim 2 wherein the first control means includes: a. addressing means for providing to the matrix memory means, for each record, the keyfield value of that record as an address of a row of the matrix memory means; and b. selection means for setting, for each record, one memory location in the addressed row of the matrix memory means, said memory location being in the column corresponding to the record address value of that record.
Claim 5
Dependent Claim
72 words
The system of claim 2 wherein the second control means includes: a. addressing means for providing to the matrix memory means, for each row in the matrix memory means having one or more set memory locations, in order of row position, the keyfield value associated with that row as an address for that row; and b. detection means for detecting the column position of each set memory location in an addressed row.
Claim 6
Dependent Claim
78 words
The system of claim 4 wherein the addressing means includes: a. address memory means having a plurality of memory locations, each said memory location corresponding to a different keyfield value; b. input control means for setting, for each record, the memory location in the address memory means corresponding to the keyfield value of that record; and c. wherein the detection means is also utilized for detecting the position of each set memory location in the address memory means.
Claim 7
Dependent Claim
13 words
The system of claim 5 wherein the address memory means is a register.
Claim 8
Dependent Claim
27 words
The system of claim 2 further including output memory means for receiving and storing the column positions detected by the second control means in the order detected.
Claim 9
Dependent Claim
15 words
The system of claim 7 wherein the output memory means is a random access memory.
Claim 10
Independent Claim
290 words
A system for arranging unique record address values corresponding to a plurality of data records wherein each record is comprised of a plurality of bits and is identified by a unique record address value, wherein a portion of each record comprises a keyfield, wherein each keyfield is divided into a plurality of sub-keyfields, each of said sub-keyfields having a different order of significance, and wherein the record address values of the plurality of records are arranged in accordance with the value of said keyfields, said system comprising: a. matrix memory means having a plurality of rows and columns, wherein each row corresponds to a different sub-keyfield value and each column corresponds to a different record address value; b. first control means for receiving sub-keyfield values and setting one memory location in the row of the matrix memory means corresponding to the sub-keyfield value received, said memory location being in the column of the matrix memory means corresponding to a record having that sub-keyfield value; c. second control means for detecting, separately for each row of the matrix memory means, in order of row position, the column position value of each set memory location in that row and for collectively recording each group of column position values detected from memory locations in the same row of the matrix memory means; d. third control means for initially providing the sub-keyfield value of greatest significance of each record to the first control means and for subsequently providing, separately for each group of column position values recorded by the second control means having more than one member in said group, the sub-keyfield value of next greatest significance for each record having a record address value corresponding to a column position value in said group.
Claim 11
Independent Claim
290 words
A system for arranging unique record address values corresponding to a plurality of data records wherein each record is comprised of a plurality of bits and is identified by a unique record address value, wherein a portion of each record comprises a keyfield, wherein each keyfield is divided into a plurality of sub-keyfields, each of said sub-keyfields having a different order of significance, and wherein the record address values of the plurality of records are arranged in accordance with the value of said keyfields, said system comprising: a. matrix memory means having a plurality of rows and columns, wherein each row corresponds to a different sub-keyfield value and each column corresponds to a different record address value; b. first control means for receiving sub-keyfield values and setting one memory location in the row of the matrix memory means corresponding to the sub-keyfield value received, said memory location being in the column of the matrix memory means corresponding to a record having that sub-keyfield value; c. second control means for detecting, separately for each row of the matrix memory means, in order of row position, the column position value of each set memory location in that row and for collectively recording each group of column position values detected from memory locations in the same row of the matrix memory means; d. third control means for initially providing the sub-keyfield value of greatest significance of each record to the first control means and for subsequently providing, separately for each group of column position values recorded by the second control means having more than one member in said group, the sub-keyfield value of next greatest significance for each record having a record address value corresponding to a column position value in said group.
Claim 12
Dependent Claim
15 words
The system of claim 9 wherein the matrix memory means is a random access memory.
Claim 13
Dependent Claim
85 words
The system of claim 10 wherein the first control means includes: a. addressing means for providing to the matrix memory means the sub-keyfield values received from the third control means as an address for the row of the matrix memory means corresponding to that sub-keyfield value; and b. selection means for setting one memory location in the addressed row of the matrix memory means, said memory location being in the column corresponding to the record address value of the record corresponding to the sub-keyfield value.
Claim 14
Dependent Claim
73 words
The system of claim 10 wherein the second control means includes: a. addressing means for providing to the matrix memory means, for each row in the matrix memory means having at least one set memory location, in order of row position, the sub-keyfield value associated with that row as an address for that row; and b. detection means for detecting the column position value of each set memory location in an addressed row.
Claim 15
Dependent Claim
115 words
The system of claim 12 wherein the addressing means includes: a. address memory means having a plurality of memory locations, each memory location corresponding to a different sub-keyfield value; b. input control means for setting, in response to each sub-keyfield value received, the memory location in the address memory means corresponding to that sub-keyfield value; and c. wherein the sub-keyfield values received by the input control means are provided by the third control means and are the same sub-keyfield values which are provided by the third control means to the first control means; and wherein the detection means is also utilized for detecting the position of each set memory location in the address memory means.
Claim 16
Dependent Claim
13 words
The system of claim 13 wherein the address memory means is a register.
Claim 17
Dependent Claim
35 words
The system of claim 14 wherein the second control means further includes row detection control means for detecting each row of the matrix memory means having at least two set memory locations in said row.
Claim 18
Dependent Claim
109 words
The system of claim 15 wherein the row detection control means includes: a. address memory means having a plurality of memory locations, wherein the position of each memory location corresponds to a different sub-keyfield value; b. input control means for setting, in response to a sub-keyfield value received which is the same as a previously received sub-keyfield value, the memory location in the address memory means corresponding to that sub-keyfield value; and c. wherein the sub-keyfield values received by the input control means are provided by the third control means and are the same sub-keyfield values which are provided by the third control means to the first control means.
Claim 19
Dependent Claim
15 words
The system of claim 16 wherein the address memory means is a random access memory.
Claim 20
Dependent Claim
110 words
The system of claim 17 further including output memory means for storing the column position values detected by the second control means in the order detected, beginning at the memory location in said output memory means having a predetermined address; and wherein the third control means is also utilized for initially providing the address value of the first memory location in the output memory means and for subsequently providing, separately for each group of column position values recorded by the second control means having more than one member, the address value of the first memory location in the output memory means where one of said column position values were stored.
Claim 21
Dependent Claim
15 words
The system of claim 18 wherein the output memory means is a random access memory.
Claim 22
Dependent Claim
63 words
The system of claim 19 wherein the second control means further includes row detection memory means for storing, for each row detected by the row detection means, the column position value of each memory location in said detected row together with the address value of the first memory location in the output memory means where one of said column position values is stored.
Claim 23
Dependent Claim
16 words
The system of claim 20 wherein the row detection memory means is a random access memory.
Claim 24
Independent Claim
182 words
A method for arranging unique record address values corresponding to a plurality of data records wherein each record is comprised of a plurality of bits and is identified by a unique record address value, wherein one or more bits of each record comprises a keyfield and the record address values of the plurality of records are arranged in accordance with the values of said keyfields, said method comprising the steps of: a. providing the keyfield value of each record to a matrix memory means having a plurality of rows and columns, each of said rows corresponding to a dirrerent keyfield value and each of said columns corresponding to a different record address value; b. setting, for each keyfield value provided to the matrix memory means, one memory location in the column of the matrix memory means corresponding to the record address value of that record, said memory location being in the row of the matrix memory means corresponding to the keyfield value of that record; and c. arranging the column position values of the set memory location in order of row position.
Claim 25
Independent Claim
182 words
A method for arranging unique record address values corresponding to a plurality of data records wherein each record is comprised of a plurality of bits and is identified by a unique record address value, wherein one or more bits of each record comprises a keyfield and the record address values of the plurality of records are arranged in accordance with the values of said keyfields, said method comprising the steps of: a. providing the keyfield value of each record to a matrix memory means having a plurality of rows and columns, each of said rows corresponding to a dirrerent keyfield value and each of said columns corresponding to a different record address value; b. setting, for each keyfield value provided to the matrix memory means, one memory location in the column of the matrix memory means corresponding to the record address value of that record, said memory location being in the row of the matrix memory means corresponding to the keyfield value of that record; and c. arranging the column position values of the set memory location in order of row position.
Claim 26
Dependent Claim
30 words
The method of claim 22 further including the step of providing each record identified by a record address value corresponding to a column position value arranged in the arranged order.
Claim 27
Dependent Claim
75 words
The method of claim 22 further comprising the steps of: a. writing the column position values in order of row position at consecutively addressable locations in an output memory means; and b. providing each record identified by a record address value corresponding to a column position value written to the output memory means, in accordance with the relative position of the addressable location in said output memory means where said column position value was written.
Claim 28
Independent Claim
282 words
A method for arranging unique record address values corresponding to a plurality of data records wherein each record is comprised of a plurality of bits and is identified by a unique record address value, wherein a portion of each record comprises a keyfield, wherein each keyfield is divided into a plurality of sub-keyfields, each of said sub-keyfields having a different order of significance, and wherein the record address values of the plurality of records are arranged in accordance with the value of said keyfields, said method comprising the steps of: a. providing the sub-keyfield values of greatest significance of each record to a matrix memory means having a plurality of rows and columns, each of said rows corresponding to a different sub-keyfield value and each of said columns corresponding to a different record address value; b. setting, for each of said sub-keyfield values provided to he matrix memory means, one memory location in the column of the matrix memory means corresponding to the record address value of that record, said memory location being in the row of the matrix memory means corresponding to the sub-keyfield value of that record; c. arranging the column position values of the set memory locations in order of row position; d. grouping together the column position values of set memory locations in the same row of the matrix memory means; e. repeating steps a through d, inclusive, separately for each group of column position values, for the sub-keyfield value of next greatest significance of each record having a record address value corresponding to a column position value in said group; and f. repeating step e so long as at least one group of column position values remain.
Claim 29
Independent Claim
282 words
A method for arranging unique record address values corresponding to a plurality of data records wherein each record is comprised of a plurality of bits and is identified by a unique record address value, wherein a portion of each record comprises a keyfield, wherein each keyfield is divided into a plurality of sub-keyfields, each of said sub-keyfields having a different order of significance, and wherein the record address values of the plurality of records are arranged in accordance with the value of said keyfields, said method comprising the steps of: a. providing the sub-keyfield values of greatest significance of each record to a matrix memory means having a plurality of rows and columns, each of said rows corresponding to a different sub-keyfield value and each of said columns corresponding to a different record address value; b. setting, for each of said sub-keyfield values provided to he matrix memory means, one memory location in the column of the matrix memory means corresponding to the record address value of that record, said memory location being in the row of the matrix memory means corresponding to the sub-keyfield value of that record; c. arranging the column position values of the set memory locations in order of row position; d. grouping together the column position values of set memory locations in the same row of the matrix memory means; e. repeating steps a through d, inclusive, separately for each group of column position values, for the sub-keyfield value of next greatest significance of each record having a record address value corresponding to a column position value in said group; and f. repeating step e so long as at least one group of column position values remain.
References Cited (Backward Citations)
US3514760A
Cited
US3533074A
Cited
US3976980A
Cited
US3714634A
Cited
US3815083A
Cited
US4003031A
Cited
US3931612A
Cited
US3973245A
Cited
US4024508A
Cited
US4030077A
Cited
US4031520A
Cited
US4052699A
Cited
US4131947A
Cited
US4145753A
Cited
US4209845A
Cited
US4281393A
Cited
US4312045A
Cited
US4249247A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1989-09-08 | 1990-03-10 | 1990-09-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1993-09-08 | 1994-03-10 | 1994-09-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1997-09-08 | 1998-03-10 | 1998-09-09 | $7700.00 | Window Closed / Lapsed |