US4933848A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for enforcing referential constraints in a database management system
Assignee: International Business Machines Corp
•
Filing: 1988-07-15
•
Granted: 1990-06-12
•
Expires: 2008-07-15
Abstract
Abstract A method is disclosed for deferring enforcement of referential constraints in large-scale data base operations such as the population or loading of relational tables 10, 12. First, the new rows are loaded in a Data Load phase 24 into the tables, and information on the new rows and their constraints is extracted and sorted 26 into a sorted key data set 68. Any primary indexes 22 required for constraint checking are then updated 28 using the sorted key data set. The new rows are then checked 70 for constraint violations, such violations are rectified 72 to restore the table's referential integrity, and a deletion data set 80 is produced. The deletion data set is merged and sorted 86 with row information 53 stored during loading, and the result is used to copy 88 the new rows violating referential constraints to a separate discard data set 48 where they can be corrected and reloaded into the table. Finally, an error summary report 36 is generated for use in correcting the discard data set.
Inventors
- 👤 Donald J. Haderle
- 👤 Julie A. Watts
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 13:09
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/23; G06F16/2365; Y; Y10; Y10S; Y10S707/00; Y10S707/99951; Y10S707/99952
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
74 words
A method for enforcing referential constraints in a data base management system, comprising the steps performed by a computer of: (a) manipulating two or more records of data; (b) storing information relating to the records so manipulated and their referential constraints; (c) placing in order the stored information of step (b), with information on primary keys preceding information on foreign keys; and (d) enforcing the referential constraints using the ordered information of step (c).
Claim 2
Independent Claim
74 words
A method for enforcing referential constraints in a data base management system, comprising the steps performed by a computer of: (a) manipulating two or more records of data; (b) storing information relating to the records so manipulated and their referential constraints; (c) placing in order the stored information of step (b), with information on primary keys preceding information on foreign keys; and (d) enforcing the referential constraints using the ordered information of step (c).
Claim 3
Dependent Claim
22 words
The method of claim 1, wherein records violating referential constraints are stored separately for future correction and manipulation of the data base.
Claim 4
Dependent Claim
43 words
The method of claim 1, wherein the system includes at least one persistent structure useful for checking referential constraints, further comprising the step of: updating the persistent structure in response to the manipulated data before the step (d) of enforcing the referential constraints.
Claim 5
Dependent Claim
22 words
The method of claim 3, wherein the persistent structure is updated in a step subsequent to the step (a) of manipulating data.
Claim 6
Dependent Claim
33 words
The method of claim 1, wherein the step (d) of enforcing the referential constraints comprises the steps of: (d1) identifying violations of the referential constraints; and (d2) undoing manipulations causing any such violations.
Claim 7
Dependent Claim
24 words
The method of claim 1, wherein records initiating referential constraint violations are reported separately from records violating referential constraints but not initiating such violations.
Claim 8
Independent Claim
124 words
A method for enforcing referential constraints in a relational data base management system having at least one table and at least one index, the method comprising the steps performed by a computer of: (a) manipulating at least two rows of the table; (b) storing information relating to the rows so manipulated and their referential constraints; (c) placing in order the stored information of step (b), with information on index keys preceding information on nonindex keys, and with information on primary keys preceding information on foreign keys; (d) updating the index using the ordered information of step (c); (e) checking for violations of referential constraints by the manipulated rows, using the ordered information of step (c); and (f) deleting manipulated rows which violate referential constraints.
Claim 9
Independent Claim
124 words
A method for enforcing referential constraints in a relational data base management system having at least one table and at least one index, the method comprising the steps performed by a computer of: (a) manipulating at least two rows of the table; (b) storing information relating to the rows so manipulated and their referential constraints; (c) placing in order the stored information of step (b), with information on index keys preceding information on nonindex keys, and with information on primary keys preceding information on foreign keys; (d) updating the index using the ordered information of step (c); (e) checking for violations of referential constraints by the manipulated rows, using the ordered information of step (c); and (f) deleting manipulated rows which violate referential constraints.
Claim 10
Dependent Claim
17 words
The method of claim 7, wherein the step (e) of checking for violations uses the updated index.
Claim 11
Dependent Claim
21 words
The method of claim 7, wherein the deleted rows are set aside for future correction and manipulation of the data base.
Claim 12
Dependent Claim
22 words
The method of claim 7, further including the step of: (g) reporting the deleted rows and the referential constraints violated by them.
Claim 13
Dependent Claim
15 words
The method of claim 7, wherein the manipulating step (a) loads rows into the table.
Claim 14
Dependent Claim
135 words
In a relational data base management system having at least one table and at least one index useful for checking referential constraints on the table, an improved method for populating the table with new rows, comprising the steps performed by a computer of: (a) loading the new rows into the table; (b) storing information relating to the new rows and their referential constraints; (c) sorting the stored information of step (b) so that information on index keys precedes information on nonindex keys and information on primary keys precedes information on foreign keys; (d) updating the index using the sorted information of step (c); (e) checking the new rows violating referential constraints, by using the sorted information of step (c) and the updated index of step (d); and deleting the new rows which violate referential constraints.
Claim 15
Dependent Claim
135 words
In a relational data base management system having at least one table and at least one index useful for checking referential constraints on the table, an improved method for populating the table with new rows, comprising the steps performed by a computer of: (a) loading the new rows into the table; (b) storing information relating to the new rows and their referential constraints; (c) sorting the stored information of step (b) so that information on index keys precedes information on nonindex keys and information on primary keys precedes information on foreign keys; (d) updating the index using the sorted information of step (c); (e) checking the new rows violating referential constraints, by using the sorted information of step (c) and the updated index of step (d); and deleting the new rows which violate referential constraints.
Claim 16
Dependent Claim
20 words
The method of claim 12, wherein the deleted rows are discarded for future correction and loading into the data base.
Claim 17
Dependent Claim
25 words
The method of claim 12, further including the step of: (g) generating a report of the deleted rows and the referential constraints violated by them.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-06-11 | 1993-12-11 | 1994-06-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-06-11 | 1997-12-11 | 1998-06-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-06-11 | 2001-12-11 | 2002-06-12 | $7700.00 | Window Closed / Lapsed |