Computer-implemented method for storing unlimited amount of data as a mind map in relational database systems
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.
1. A computer implemented method for processing data in a database system, comprising:
(a) displaying, on a graphical user interface (GUI), a mind map comprising a plurality of nodes and one or more directed links;
(b) receiving, within the GUI, a user input for creating a new node and a new directed link between the new node and a node selected from the plurality of nodes in the mind map; and
(c) creating, for the new directed link, an entry in a first data structure in the database system, which entry in the first data structure comprises an identifier of a relation and a name of the relation, wherein the relation is a relation between a first data set represented by the new node and a second data set represented by the node selected from the plurality of nodes in the mind map.
2. The computer implemented method of claim 1 , wherein the new node is the selected node, and wherein the new directed link represents a self-relation.
3. The computer implemented method of claim 1 , wherein the new node is different from the selected node.
4. The computer implemented method of claim 1 , wherein the name of the relation comprises a text description of the relation.
5. The computer implemented method of claim 1 , further comprising: creating, for the new node, (i) an entry in a second data structure in the database, which entry in the second data structure comprises a data set identifier and a set name, and (ii) an entry in a third data structure in the database, which entry in the third data structure comprises an identifier of a property of the new node and the data set identifier.
6. The computer implemented method of claim 1 , further comprising receiving an additional user input via the GUI for adding an object to a given node selected from the plurality of nodes in the mind map.
7. The computer implemented method of claim 6 , further comprising creating an entry in a fourth data structure of the database, which entry in the fourth data structure comprises an object identifier and a data set identifier corresponding to the selected node.
8. The computer implemented method of claim 7 , further comprising creating an entry in a fifth data structure of the database, which entry in the fifth data structure comprises the object identifier, an identifier of a property and an object value assigned to the property.
9. The computer implemented method of claim 8 , further comprising creating an entry in a sixth data structure of the database, which entry in the sixth data structure comprises an identifier of a relation between the object and an additional object, the object identifier of the object and an additional object identifier of additional object.
10. A non-transitory computer-readable medium comprising machine-executable instructions that, upon execution by one or more computer processors, implements a method for processing data in a database system using a mind map, said method comprising:
(a) displaying, on a graphical user interface (GUI), a mind map comprising a plurality of nodes and one or more directed links;
(b) receiving, within the GUI, a user input for creating a new node and a new directed link between the new node and a node selected from the plurality of nodes in the mind map; and
(c) creating, for the new directed link, an entry in a first data structure in the database system, which entry in the first data structure comprises an identifier of a relation and a name of the relation, wherein the relation is a relation between a first data set represented by the new node and a second data set represented by the node selected from the plurality of nodes in the mind map.
11. The non-transitory computer-readable medium of claim 10 , wherein the new node is the selected node, and wherein the new directed link represents a self-relation.
12. The non-transitory computer-readable medium of claim 10 , wherein the new node is different from the selected node.
13. The non-transitory computer-readable medium of claim 10 , wherein the name of the relation comprises a text description of the relation.
14. The non-transitory computer-readable medium of claim 10 , wherein the method further comprises: creating, for the new node, (i) an entry in a second data structure in the database, which entry in the second data structure comprises a data set identifier and a set name, and (ii) an entry in a third data structure in the database, which entry in the third data structure comprises an identifier of a property of the new node and the data set identifier.
15. The non-transitory computer-readable medium of claim 10 , wherein the method further comprises receiving an additional user input via the GUI for adding an object to a given node selected from the plurality of nodes in the mind map.
16. The non-transitory computer-readable medium of claim 12 , wherein the method further comprises creating an entry in a fourth data structure of the database, which entry in the fourth data structure comprises an object identifier and a data set identifier corresponding to the selected node.
17. The non-transitory computer-readable medium of claim 13 , wherein the method further comprises creating an entry in a fifth data structure of the database, which entry in the fifth data structure comprises the object identifier, an identifier of a property and an object value assigned to the property.
18. The non-transitory computer-readable medium of claim 14 , wherein the method further comprises creating an entry in a sixth data structure of the database, which entry in the sixth data structure comprises an identifier of a relation between the object and another object, the object identifier of the object and an additional object identifier of the additional object.