Patent US5133068A successfully refreshed from Google Patents.
US5133068A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Complied objective referential constraints in a relational database having dual chain relationship descriptors linked in data record tables
Assignee: International Business Machines Corp
•
Filing: 1991-08-28
•
Granted: 1992-07-21
•
Expires: 2011-08-28
Abstract
Abstract An implementation of referential integrity in which descriptions of referential constraints are compiled into meta-data descriptions of the constraint rules and specifications. The meta-data descriptions of the constraints are stored in the form of objects called relationship descriptors. Each relationship descriptor contains a complete description of a referential constraint, either directly or by means of pointers to other objects such as record and index descriptors which contain information comprised in the constraint's specification. The relationship descriptors are linked into two types of chains by symbolic pointers. One type of relationship descriptor chain connects all relationship descriptors which have a common parent table. The other type of relationship descriptor chain connects relationship descriptors with common dependent tables. Both types of chains are anchored in respective fields in the tables' record descriptors. The use of meta-data descriptors facilitates both ready modification of the constraints, and speedy enforcement of the constraints by a single, shared procedure which may be embedded in the data base manager.
Inventors
- 👤 Richard A. Crus
- 👤 Michael J. Dockter
- 👤 Robert W. Engles
- 👤 Donald J. Haderle
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 10:38
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/23; G06F16/2365
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
229 words
A computer-implemented, relational data base management system comprising: (a) a first table containing data records; (b) a second table containing data records; (c) a third table containing data records; (d) a first relationship descriptor, having pointer connections to the first table and the second table, for describing meta-data of a first referential constraint between the first and second tables, the meta-data including the first constraint's parent and dependent tables and primary and foreign keys, the first relationship descriptor being a separate object internal to the data base management system; (e) a second relationship descriptor, having pointer connections to one of the first two tables and the third table, for describing meta-data of a second referential constraint between one of the first two tables and the third table, the meta-data including the second constraint's parent and dependent tables and primary and foreign keys, the second relationship descriptor being a separate object internal to the data base management system; (f) a first chain for connecting the first and second relationship descriptors to their respective parent tables; (g) a second chain for connecting the first and second relationship descriptors to their respective dependent tables; (h) means for accessing the first and second relationship descriptors when any of the tables is to be modified; and (i) means for enforcing the referential constraints described by the first and second relationship descriptors upon such modification.
Claim 2
Dependent Claim
229 words
A computer-implemented, relational data base management system comprising: (a) a first table containing data records; (b) a second table containing data records; (c) a third table containing data records; (d) a first relationship descriptor, having pointer connections to the first table and the second table, for describing meta-data of a first referential constraint between the first and second tables, the meta-data including the first constraint's parent and dependent tables and primary and foreign keys, the first relationship descriptor being a separate object internal to the data base management system; (e) a second relationship descriptor, having pointer connections to one of the first two tables and the third table, for describing meta-data of a second referential constraint between one of the first two tables and the third table, the meta-data including the second constraint's parent and dependent tables and primary and foreign keys, the second relationship descriptor being a separate object internal to the data base management system; (f) a first chain for connecting the first and second relationship descriptors to their respective parent tables; (g) a second chain for connecting the first and second relationship descriptors to their respective dependent tables; (h) means for accessing the first and second relationship descriptors when any of the tables is to be modified; and (i) means for enforcing the referential constraints described by the first and second relationship descriptors upon such modification.
Claim 3
Dependent Claim
20 words
The system of claim 1, wherein the first relationship descriptor is stored within the data base system in compiled form.
Claim 4
Dependent Claim
62 words
The system of claim 1, further comprising: a first record descriptor for describing the data records of the first table, the first record descriptor being a separate object within the data base system which can be modified individually; and wherein the means for accessing the first relationship descriptor comprises a logical connection between the first relationship descriptor and the first record descriptor.
Claim 5
Dependent Claim
33 words
The system of claim 3, wherein the logical connection between the first record descriptor and the first relationship descriptor comprises a symbolic pointer from the first record descriptor to the first relationship descriptor.
Claim 6
Dependent Claim
27 words
The system of claim 4, wherein the first table is the parent table of the constraint and the second table is the dependent table of the constraint.
Claim 7
Dependent Claim
62 words
The system of claim 5, further including: a second record descriptor for describing the records of the second table, the second record descriptor being a separate object within the data base system which can be modified individually; and wherein the means for accessing the first relationship descriptor further comprises a logical connection between the second record descriptor and the first relationship descriptor.
Claim 8
Dependent Claim
33 words
The system of claim 6, wherein the logical connection between the second record descriptor and the first relationship descriptor comprises a symbolic pointer from the second record descriptor to the first relationship descriptor.
Claim 9
Dependent Claim
36 words
The system of claim 1, further comprising: an index descriptor for describing a primary key index of the first table; and wherein the first relationship descriptor identifies the constraint's primary key by referencing the index descriptor.
Claim 10
Dependent Claim
27 words
The system of claim 8, where the first relationship descriptor references the index descriptor by a logical connection from the first relationship descriptor to the index descriptor.
Claim 11
Dependent Claim
22 words
The system of claim 9, wherein the logical connection from the first relationship descriptor to the index descriptor comprises a symbolic pointer.
Claim 12
Dependent Claim
57 words
The system of claim 1, wherein the first and second relationship descriptors each include a delete rule having a value equal to any of "restrict," "set null," and "cascade," and wherein any relationship descriptor having a delete rule value of "restrict" precedes in the first and second chains any relationship descriptor having any other delete rule value.
Claim 13
Dependent Claim
34 words
The system of claim 11, wherein any relationship descriptor having a delete rule value of "set null" precedes in the first and second chains any relationship descriptor having a delete rule value of "cascade."
References Cited (Backward Citations)
US4498145A
Cited
US4631673A
Cited
US4870397A
Cited
US4918593A
Cited
US4933848A
Cited
US4947320A
Cited
US5043872A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-07-21 | 1996-01-20 | 1996-07-21 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-07-21 | 2000-01-20 | 2000-07-21 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-07-21 | 2004-01-20 | 2004-07-21 | $7700.00 | Window Closed / Lapsed |