Data processing system and method for maintaining cardinality in a relational database

• US 5,675,779 A
• Filed: 05/11/1995
• Issued: 10/07/1997
• Est. Priority Date: 05/21/1990
• Status: Expired due to Term

• Current Assignee: Financial Systems Technology Intellectual Property Pty. Ltd. (Financial Systems Technology Pty. Ltd.)
• Original Assignee: Financial Systems Technology Pty. Ltd.
• Inventors: Doktor, Karol
• Primary Examiner(s): Black, Thomas G.
• Assistant Examiner(s): HO, RUAY L
• Application Number:
  US08/439,207
• Time in Patent Office: 880 Days
• Field of Search: 395/600, 395/611, 395/612, 395/613, 395/614, 395/615, 395/650, 395/700, 395/800, 395/601, 395/602, 395/603, 395/604, 395/605, 395/606, 395/607, 395/608, 395/609, 395/610, 395/616, 395/617, 395/618, 395/619, 395/620, 395/622
• US Class Current: 1/1
• CPC Class Codes: C09K 2323/02 Alignment layer characterised by chemical composition
• CPC Class Codes: G06F 16/288 Entity relationship models
• CPC Class Codes: Y10S 707/954 Relational
• CPC Class Codes: Y10S 707/99931 Database or file accessing
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation
• CPC Class Codes: Y10S 707/99952 Coherency, e.g. same view to multiple users

Abstract

A relationships processing computing system provides for the recording and extraction of data objects (entities) and for development data representing a queried relationship between data objects (entities). The set of entities and relationships may be expanded at any time during the life of the system without reprogramming or compiling computer code and without disrupting concurrent use of the system. Complex inquiries, normally requiring multiple nested queries, may be performed without code level programming.

Claims

1. In a computer system, a data processing system for maintaining cardinality in a relational database, said data processing system comprising:

memory means containing (i) relation definition table means comprised of at least one relation type record wherein each relation type record defines a relation type and includes cardinality data defining cardinality of said relation type and (ii) relation instance table means comprised of at least one relation instance record, wherein said relation definition table means and said relation instance table means are a part of said relational database;

means, operatively coupled to said relation definition table means and said relation instance table means, for storing a plurality of relation instance records in said relation instance table means, wherein each relation instance record defines a relation of one of said relation types and further wherein said relation is between two entities; and

means, operatively coupled to said relation instance record storing means, for detecting a cardinality violation for a first relation type, said means for detecting comprising

means for determining whether said relation instance table means contains a first relation instance record, that defines a first relation of said first relation type between a first entity and a second entity; and

means for determining whether said relation instance table means contains a second relation instance record that defines a second relation of said first relation type between said first entity and a third entity.

2. The data processing system of claim 1 wherein each relation instance record defines a relation between a head entity and a tail entity;

and

further wherein said first entity is a head entity and said second and third entities are tail entities.

3. The data processing system of claim 1 wherein each relation instance record defines a relation between a head entity and a tail entity;

and

further wherein said first entity is a tail entity and said second and third entities are head entities.

4. A computer method for maintaining cardinality in a relational database, said method comprising:

storing in relation definition table means of said relational database a plurality of relation type records wherein each said relation type record defines a relation type and includes cardinality data defining cardinality of said relation type;

storing in relation instance table means of said relational database a plurality of relation instance records wherein each said relation instance record defines a relation of a relation type defined by one of said relation type records and further wherein said relation is between two entities; and

detecting a cardinality violation for a first relation type wherein said step of detecting comprises

determining whether said relation instance table means contains a first relation instance record defining a first relation of a first relation type between a first entity and a second entity; and

determining whether said relation instance table means contains a second relation instance record that defines a second relation of said first relation type between said first entity and a third entity.

5. The method of claim 4 wherein each relation instance record defines a relation between a head entity and a tail entity;

and

further wherein said first entity is a head entity and said second and third entities are tail entities.

6. The method of claim 4 wherein each relation instance record defines a relation between a head entity and a tail entity;

and

further wherein said first entity is a tail entity and said second and third entities are head entities.