USRE40063EExpiredUtility

Data processing and method for maintaining cardinality in a relational database

Assignee: DOKTOR KAROLPriority: May 21, 1990Filed: Jun 14, 2005Granted: Feb 12, 2008
Est. expiryMay 21, 2010(expired)· nominal 20-yr term from priority
Inventors:Karol Doktor
C09K 2323/02Y10S707/99952Y10S707/954Y10S707/99932Y10S707/99931Y10S707/99934Y10S707/99933G06F 16/288
74
PatentIndex Score
4
Cited by
108
References
6
Claims

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

exact text as granted — not AI-modified
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.

Join the waitlist — get patent alerts

Track USRE40063E — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.