§
Luxuse
Patent Intelligence
Sign In
← Back to Patent Explorer
EP0360387A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

Data base management system

Assignee: International Business Machines Corp
•
Filing: 1989-07-12
•
Granted: —
•
Expires: 2009-07-12
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

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 Anthony Crus
  • 👤 Michael Jon Dockter
  • 👤 Robert William Engles
  • 👤 Donald James Haderle

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-11-05 19:14
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/23; G06F16/2365

Claims Analysis

Total Claims: 12
Claim 1
Independent Claim 89 words
A computer-implemented, relational data base management system comprising: (a) a first table; (b) a second table; (c) a relationship descriptor for describing meta-data of a referential constraint between the first and second tables, the meta-data including the constraint's parent and dependent tables and primary and foreign keys, the relationship descriptor being a separate object within the data base system; (d) means for accessing the relationship descriptor when the table is to be modified; and (e) means for enforcing the referential constraint described by the relationship descriptor upon such modification.
Claim 2
Dependent Claim 89 words
A computer-implemented, relational data base management system comprising: (a) a first table; (b) a second table; (c) a relationship descriptor for describing meta-data of a referential constraint between the first and second tables, the meta-data including the constraint's parent and dependent tables and primary and foreign keys, the relationship descriptor being a separate object within the data base system; (d) means for accessing the relationship descriptor when the table is to be modified; and (e) means for enforcing the referential constraint described by the relationship descriptor upon such modification.
Claim 3
Dependent Claim 21 words
A system as claimed in claim 1, wherein the relationship descriptor is stored within the data base system in compiled form.
Claim 4
Dependent Claim 64 words
A system as claimed in claim 1 or claim 2, further comprising: (f) a first record descriptor for describing the records of the first table, the record descriptor being a separate object within the data base system which can be modified individually; and wherein the means for accessing the relationship descriptor comprises a logical connection between the relationship descriptor and the first record descriptor.
Claim 5
Dependent Claim 27 words
A system as claimed in claim 3, wherein the means for accessing the relationship descriptor comprises a symbolic pointer from the record descriptor to the relationship descriptor.
Claim 6
Dependent Claim 29 words
A system as claimed in 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 63 words
A system as claimed in claim 5, further comprising: (g) 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 relationship descriptor further comprises a logical connection between the second record descriptor and the relationship descriptor.
Claim 8
Dependent Claim 32 words
A system as claimed in claim 6, wherein the logical connection between the first and second relationship descriptors comprises a symbolic pointer from the first relationship descriptor to the second record descriptor.
Claim 9
Independent Claim 39 words
A system as claimed in any preceding claim, further comprising: (h) an index descriptor for describing a primary key index of the first table; and wherein the relationship descriptor identifies the constraint's primary key by referencing the index descriptor.
Claim 10
Dependent Claim 27 words
A system as claimed in claim 8, where the relationship descriptor references the index descriptor by a logical connection from the relationship descriptor to the index descriptor.
Claim 11
Dependent Claim 23 words
A system as claimed in claim 9, wherein the logical connection from the relationship descriptor to the index descriptor comprises a symbolic pointer.
Claim 12
Independent Claim 79 words
A system as claimed in any preceding claim, further comprising: (i) a second relationship descriptor for describing a second referential constraint between the first and second tables; the second relationship descriptor indentifying the second constraint's parent and dependent tables and primary and foreign keys, the second relationship descriptor also being a separate object within the data base system; and wherein the accessing means accesses both relationship descriptors and the enforcing means enforces the referential constraints of both relationship descriptors.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag