Dynamically Encoding Types and Inhabitants in a Relational Database

• US 20100287220A1
• Filed: 05/05/2009
• Published: 11/11/2010
• Est. Priority Date: 05/05/2009
• Status: Abandoned Application

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Brown, Allen L. JR., Karkanias, Chris D., Campbell, David G., Aust, Brian S.
• Application Number:
  US12/435,407
• Publication Number:
  US 20100287220A1
• Time in Patent Office: Days
• US Class Current: 707/955
• CPC Class Codes: G06F 16/284 Relational databases

Abstract

Described is a technology, such as for representing scientific data and information, in which a database table contains rows of type data representing types, and term data representing terms that inhabit the types. Types include composite types (e.g., that represent entities), and instances of relation types that express relationships between types, between a type and a term, or between terms. Types and/or terms may have multiple relationships with one another, and a relationship may span database tables. A new relationship may be established by adding a new row to the database table to represent a new relation term, along with one or more similar rows to represent the relation role terms associated with that relation term; relationships may be removed by removing rows. As a result, the database table may change its state rapidly, without needing to change the database schema.

Claims

1. In a computing environment, a system comprising, a database table that contains rows of type data representing types, and term data representing terms, in which at least one type is a relation type that specifies a relationship between two other types, between another type and a term, or between two terms.

2. The system of claim 1 further comprising means for establishing a new relationship by adding a row to the database table to represent a new relation type.

3. The system of claim 1 further comprising means for establishing a new relationship by adding a row to the database table to represent a new term of an existing relation type.

4. The system of claim 1 wherein at least one of the types is a composite type that has a relationship with a member type according to a member definition.

5. The system of claim 1 wherein the relation type has a relationship with a relation term according to a role definition.

6. The system of claim 1 wherein two types have at least two relationships with one another, including via the relation type and at least one other relation type.

7. The system of claim 1 wherein a type and a term have at least two relationships with one another, including via the relation type and at least one other relation type.

8. The system of claim 1 wherein a term and another term have at least two relationships with one another, including via the relation type and at least one other relation type.

9. The system of claim 1 wherein the relation type specifies that a type or a term of the database table has a relationship with a type or a term of another database table.

10. The system of claim 1 wherein the database table models relationships between scientific concepts.

11. One or more computer-readable media having stored thereon a data structure, comprising rows of type data representing types, including a row that includes a relation term that inhabits a relation type, whereby accessing the row that includes the relation term relates the relation term to another term.

12. The computer-readable media of claim 11 wherein and a row that represents a relation role term associated with the relation term.

13. The computer-readable media of claim 11 wherein the relation type is associated with the role term according to a role definition.

14. The computer-readable media of claim 13 wherein one of the types is a composite type associated with a member term according to a member definition.

15. The computer-readable media of claim 13 wherein at least two of the types are composite types each having a composite term, and wherein the relation term relates one composite term to the other composite term.

16. The computer-readable media of claim 12 wherein the data structure includes a row corresponding to a relation type having a term that relates to a type or term in another data structure.

17. One or more computer-readable media having stored thereon a data structure, comprising rows of type data representing types, including a row that includes a member term that inhabits a composite type, and data that relates the member term to another member term, whereby accessing the row that includes the member term provides access to the other member term.

18. The computer-readable media of claim 17 wherein one of the types is a composite type associated with the member term according to a member definition.

19. The computer-readable media of claim 17 wherein the data that relates the member term to the other member term is a relation term of a relation type row.

20. The computer-readable media of claim 17 wherein the relation type is associated with the role term according to a role definition.