Intentionally-Linked Entities: A General-Purpose Database System

• US 20090319564A1
• Filed: 06/23/2009
• Published: 12/24/2009
• Est. Priority Date: 06/24/2008
• Status: Abandoned Application

• Current Assignee: Vitit Kantabutra
• Original Assignee: Vitit Kantabutra
• Inventors: Kantabutra, Vitit
• Application Number:
  US12/490,270
• Publication Number:
  US 20090319564A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/20 of structured data, e.g. relational data
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence

Abstract

In accordance with one embodiment the subject of the patent is a method for storing a database comprising entity objects or data structures representing the data entities, and relationship objects or data structures representing the relationships amongst the entities. Each relationship object or data structure possesses links to the entity objects or data structures that play the various roles in the relationship. Where there is a link from a relationship to an entity, there is also a link from the entity to the relationship, facilitating queries and updates to the database system. It is possible and often desirable for an embodiment to permit not merely one, but possibly many (or zero) entities to play each role in a relationship. The database is value-oriented in the sense that the address of an entity is not part of the key, thus permitting value-comparison-based searches.

Claims

1. A method for storing a database involving data entities and relationships of any finite arity amongst said entities, comprising:

a. storing each said entity in a data structure, which could be an object, henceforth referred to as an entity object,

b. storing each said relationship amongst entities in a data structure, which could be an object, henceforth referred to as a relationship object,

c. for each said relationship, grouping zero, one, or more said entities that serve in each role of said relationship into a composite data structure such as a dynamically-allocated array,

d. linking with pointers or references each said relationship object with the appropriate members of said composite of entities involved in the relationship represented by said relationship object,

e. providing users or client programs with convenient and direct means of creating said entity objects and relationship objects without having to simulate or create said objects from other types of records.

2. The method of claim 1 wherein said entities of like kind are grouped together into entity sets, and said relationships of like kind are grouped together into relationship sets.

3. The method of claim 2 wherein, in each said entity, there exist links between the entity and all the relationships in which said entity is involved, and associated with each said link is a means by which the entity'"'"'s role in the relationship can be identified.

4. The method of claim 3 wherein said means of role identification is implemented as a hash of hashes of dynamically-allocated arrays, where each hash element at the outer level represents links from said entity set to the relations in any one particular relationship set whose name would be the hash key.

5. The method of claim 4 wherein each hash element at the inner level represents a particular role played by said entity, and the role index would serve as the hash key.

6. The method of claim 5 wherein each array element represents one relationship, and in one embodiment these relationships are not sorted in any particular order in the array.

7. The method of claim 1 wherein a query language is provided as means for find (search) operations taking attributes and entity sets as parameters, such that it is not necessary to traverse the entire database or traverse entities in irrelevant entity sets to answer queries.

8. A method for storing a database involving data entities and relationships of any finite arity amongst said entities, comprising:

a. storing each said entity in a data structure or an object, henceforth referred to as an entity object,

b. storing each said relationship amongst entities in a data structure or an object, henceforth referred to as a relationship object,

c. linking with pointers or references in both directions each said relationship object with the entities involved in the relationship represented by said relationship object,

d. providing users or client programs with convenient and direct means of creating said entity objects and relationship objects without having to simulate or create said objects from other types of records.

9. The method of claim 8 wherein said entities of like kind are grouped together into entity sets, and said relationships of like kind are grouped together into relationship sets.

10. The method of claim 9 wherein, in each said entity, there exist links between the entity and all the relationships in which said entity is involved, and associated with each said link is a means by which the entity'"'"'s role in the relationship can be identified.

11. The method of claim 8 wherein a query language is provided as means for find (search) operations taking attributes and entity sets as parameters, such that it is not necessary to traverse the entire database or traverse entities in irrelevant entity sets to answer queries.