Computer implemented method for creating database structures without knowledge on functioning of relational database system

A computer implemented method for storing ad hoc relations between previously unrelated database objects assigned to different data sets using an electronic computing device, the method comprising:

• creating, with aid of the electronic computing device, at least three data sets:
• data set A, data set B and data set C, wherein each of the at least three data sets includes a plurality of objects defined by a plurality of core data structures, wherein objects of data set A and objects of data set B have at least one relation, wherein objects of data set B and objects of data set C have at least one relation, and wherein the at least one relation between objects of data set A and objects of data set B and the at least one relation between objects of data set B and objects of data set C are generated based on a mind map;
• filtering the objects of data set A;
• accessing data set B using a first selected relation between data set A and data set B;
• storing information about filtering of data set A and information on a first selected path between data set A and data set B;
• filtering results obtained from data set B;
• accessing data set C using a second selected relation between data set B and data set C;
• and
• storing information about filtering of data set B and information on a second selected path between data set B and data set C.

A computing device program product for storing ad hoc relations between previously unrelated database objects assigned to different data sets using an electronic computing device, the computing device program product comprising:

• a non-transitory computer readable medium;
• first programmatic instructions for causing the electronic computing device to create at least three data sets:
• data set A, data set B and data set C, wherein each of the at least three data sets includes a plurality of objects defined by a plurality of core data structures, wherein objects of data set A and objects of data set B have at least one relation, wherein objects of data set B and objects of data set C have at least one relation, and wherein the at least one relation between objects of structure A and objects of structure B and the at least one relation between objects of structure B and objects of structure C are created based on a mind map;
• second programmatic instructions for filtering the objects of data set A;
• third programmatic instructions for accessing data set B using a first selected relation between data set A and data set B;
• fourth programmatic instructions for storing information about filtering of data set A and information on a first selected path between data set A and data set B;
• fifth programmatic instructions for filtering results obtained from data set B;
• sixth programmatic instructions for accessing data set C using a second selected relation between data set B and data set C;
• and
• seventh programmatic instructions for storing information about filtering of data set B and information on a second selected path between data set B and data set C.

A computer implemented method for storing ad hoc relations between previously unrelated database objects assigned to different data sets in a database using an electronic computing device, the method comprising:

• causing the electronic computing device to provide at least three data sets in the database:
• data set A, data set B and data set C,
• wherein each of the at least three database structures each includes a plurality of objects defined by a plurality of core data structures,
• wherein objects of data set A and objects of data set B have a first plurality of relations, wherein objects of data set B and objects of data set C have a second plurality of relations;
• and wherein the plurality of relations between objects of data set A and objects of data set B and the plurality of relations between objects of data set B and objects of data set C are created based on a mind map;
• filtering the objects of data set A;
• accessing data set B by selecting any of the first plurality of relations between data set A and data set B;
• storing information about filtering of data set A and information on a first selected path corresponding with the first plurality of relations between data set A and data set B;
• filtering results obtained from data set B;
• accessing data set C by selecting any of the second plurality of relations between data set B and data set C;
• and
• storing information about filtering of data set B and information on a second selected path corresponding with the second plurality of relations between data set B and data set C,
• wherein an ad hoc relation between data set A and data set C is created.