Computer-implemented method for storing unlimited amount of data as a mind map in relational database systems

• US 10,657,111 B2
• Filed: 01/10/2018
• Issued: 05/19/2020
• Est. Priority Date: 03/29/2013
• Status: Active Grant

• Current Assignee: Datawalk Spolka Akcyjna
• Original Assignee: Datawalk Spolka Akcyjna
• Inventors: Piecko, Krystian
• Primary Examiner(s): Bibbee, Jared M
• Application Number:
  US15/866,713
• Publication Number:
  US 20180203884A1
• Time in Patent Office: 860 Days
• CPC Class Codes: G06F 16/211 Schema design and management
• CPC Class Codes: G06F 16/213 with details for schema evolution support

Abstract

A computer implemented method for creating and managing a database system comprising data structures for storing, in a memory, data and relations between the data, the method comprising the steps of creating a mind map structure wherein each node of the mind map represents a set in the first data structure and each branch represents a relation in the fifth data structure of the database in which there are defined five data structures that hold all information relating to tables, records and relations, namely: a first data structure comprising a definition of at least one data set, a second data structure comprising definitions of properties of objects, a third data structure comprising definitions of objects, a fourth data structure comprising definitions of properties of each object, a fifth data structure comprising definitions of relations and a sixth data structure for storing definitions of relations between objects.

Claims

1. A computer implemented method for adding a new object to a database system, comprising:

(a) providing a database comprising;

a first data structure, stored in a memory, comprising a definition of data sets in the database, wherein an entry of the first data structure comprises a unique data set identifier and a set name;

a second data structure, stored in the memory, comprising definitions of properties of objects in the database, wherein an entry of the second data structure comprises a unique identifier of the property and a data set identifier, from the first data structure, the property is assigned to;

a third data structure, stored in the memory, comprising definitions of objects of the data sets in the database, wherein an entry of the third data structure comprises a unique object identifier and a data set identifier, from the first data structure, the object is assigned to;

a fourth data structure, stored in the memory, comprising definitions of object values of the data sets in the database, wherein an entry of the fourth data structure comprises an object identifier, from the third data structure, an identifier of a property of the data set, from the second data structure, the object value is assigned to, and the object value;

a fifth data structure, stored in the memory, comprising definitions of relations of data sets in the database, wherein an entry of the fifth data structure comprises a unique identifier of the relation and a name of the relation; and

a sixth data structure, stored in the memory, comprising definitions of objects relations between the objects in the database, wherein an entry of the sixth data structure comprises an identifier of a relation, from the fifth data structure, and two object identifiers from the third data structure;

(b) creating a new entry in the third data structure associated with the new object, wherein the new entry comprises a unique object identifier for the new object and a data set identifier, from the first data structure, the new object is assigned to;

(c) for each object property of a given set defined in the second data structure, creating an object value entry in the fourth data structure, wherein the object value entry comprises a unique object identifier for the new object; and

(d) creating relations of the new object with existing objects in the sixth data structure.

2. The computer implemented method of claim 1, wherein the database further comprises a seventh data structure, stored in the memory, comprising definitions of set relations between data sets in the database, wherein an entry of the seventh data structure comprises an identifier of a relation, form the fifth data structure, with two set identifiers from the first data structure.

3. The computer implemented method of claim 2, wherein the first data structure comprises a reference to the seventh data structure.

4. The computer implemented method of claim 1, wherein the second data structure comprises a reference to the fourth data structure.

5. The computer implemented method of claim 1, further comprising assigning a property type name to each entry in the second data structure and in the data structure.

6. The computer implemented method of claim 1, wherein the data structures are created based on a mind map structure wherein each node of the mind map represents a set in the first data structure and each direct link represents a relation in the fifth data structure of the database.

7. The computer implemented method of claim 6, further comprising:

assigning a name to each node of the mind map wherein each name of a respective node is the name property of a record of the first data structure; and

assigning a name to each direct link of the mind map wherein each name of a respective link is the name property of the fifth data structure.

8. The computer implemented method of claim 6, further comprising:

assigning properties to each node of the mind map wherein each property is an entry in the second data structure.

9. The computer implemented method of claim 1, wherein the first data structure has definitions of a first property type and a second property type that are different from one another.

10. The computer implemented method of claim 9, wherein the relations defined in the fifth data structure include a relation from the first property type to the second property type, or vice versa.

11. A computer program comprising program code means for performing all the steps of the computer-implemented method according to claim 1 when said program is run on a computer.

12. A computer readable medium storing computer-executable instructions performing all the steps of the computer-implemented method according to claim 1 when executed on a computer.

13. A computer implemented method for removing an object from a database system, comprising:

(a) providing a database comprising;

a first data structure, stored in a memory, comprising a definition of data sets in a database, wherein an entry of the first data structure comprises a unique data set identifier and a set name;

a second data structure, stored in the memory, comprising definitions of properties of objects in the database, wherein an entry of the second data structure comprises a unique identifier of the property and a data set identifier, from the first data structure, the property is assigned to;

a third data structure, stored in the memory, comprising definitions of objects of the data sets in the database, wherein an entry of the third data structure comprises a unique object identifier and a data set identifier, from the first data structure, the object is assigned to;

a fourth data structure, stored in the memory, comprising definitions of object values of the data sets in the database, wherein an entry of the fourth data structure comprises an object identifier, from the third data structure, an identifier of a property of the data set, from the second data structure, the object value being assigned to, and the object value;

a fifth data structure, stored in the memory, comprising definitions of relations of data sets in the database, wherein an entry of the fifth data structure comprises a unique identifier of the relation and a name of the relation; and

a sixth data structure, stored in the memory, comprising definitions of objects relations between the objects in the database, wherein an entry of the sixth data structure comprises an identifier of a relation, from the fifth data structure, and two object identifiers from the third data structure;

(b) identifying an object to be removed from the database; and

(c) removing any existing relations of the object to be removed with other existing objects by deleting entries in the sixth data structure that relate to the object being removed.

14. The computer implemented method of claim 13, wherein the database further comprises a seventh data structure, stored in the memory, comprising definitions of set relations between data sets in the database, wherein an entry of the seventh data structure comprises an identifier of a relation, form the fifth data structure, with two set identifiers from the first data structure.

15. The computer implemented method of claim 13, further comprising assigning a property type name to each entry in the second data structure and in the fifth data structure.

16. The computer implemented method of claim 13, wherein the data structures are created based on a mind map structure wherein each node of the mind map represents a set in the first data structure and each direct link represents a relation in the fifth data structure of the database.

17. The computer implemented method of claim 13, wherein the first data structure has definitions of a first property type and a second property type that are different from one another.

18. The computer implemented method of claim 17, wherein the relations defined in the fifth data structure include a relation from the first property type to the second property type, or vice versa.

19. A computer program comprising program code means for performing all the steps of the computer-implemented method according to claim 13 when said program is run on a computer.

20. A computer readable medium storing computer-executable instructions performing all the steps of the computer-implemented method according to claim 13 when executed on a computer.