Database hierarchy-independent data drilling
Computer implemented methods for database hierarch-independent data drilling are presented including: a. selecting one of at least two database structures each having data, where the at least two database structures include, at least two distinct paths that lead from a first of the at least two database structures to a second of the at least two database structures, where a path logically relates at least two data structures which are otherwise directly unrelated using data structures and data structures' relations, and a database information schema that provides information about the at least two database structures including information regarding relations between data structures; b. setting the selected database structure as a current data drilling state; and c. finding at least one related data structure corresponding with the selected database structure for the current data drilling state utilizing the database information schema.
1. A computer implemented method for database hierarchy-independent data drilling comprising:
(a) selecting one or more primary keys of one or more records from a first data structure in response to a query received from a user;
(b) identifying one or more second data structures related to the first data structure based at least in part on the one or more primary keys of the one or more records;
(c) determining that at least one of the one or more second data structures is an intermediate relation table, wherein a row in the intermediate relation table defines a mapping relationship between at least two elements and wherein the row comprises two foreign keys of the two elements with a first foreign key same as a primary key of the first data structure and a second foreign key same as a primary key of a third data structure;
(d) for the intermediate relation table, identifying one or more result foreign keys based on the one or more primary keys and one or more of the third data structures, wherein at least one of the one or more third data structures comprises one of the two elements uniquely identified by the one or more result foreign keys, and wherein the first data structure, the one or more second data structures, and the one or more third data structures are hierarchical independent and the element in the at least one of the one or more third data structures do not have a parent or child relationship with other elements; and
(e) presenting the one or more third data structures to the user for selection for further data drilling, wherein the combination of the first data structure, the one or more second data structures, and the one or more third data structures permits efficient data drilling with reduced computational resources.
2. The computer implemented method of claim 1 , wherein the one or more third data structures are not intermediate relation tables.
3. The computer implemented method of claim 1 , wherein the mapping relationship is between one or more elements of the first data structure and one or more elements of the one or more third data structures.
4. The computer implemented method of claim 3 , wherein the one or more elements of the first data structure is represented by a first foreign key from the at least two foreign keys in the intermediate relation table and the one or more elements of the third data structure is represented by a second foreign key from the at least two foreign keys in the intermediate relation table.
5. The computer implemented method of claim 4 , wherein the second foreign key corresponds to a primary key of the respective one or more elements in the one or more third data structures.
6. The computer implemented method of claim 1 , further comprising determining that at least one of the one or more second data structures is a table that is not an intermediate relation table.
7. The computer implemented method of claim 6 , further comprising presenting the table to the user.
8. The computer implemented method of claim 6 , wherein the one or more primary keys of the one or more records are presented as one or more foreign keys in the table.
9. The computer implemented method of claim 1 , wherein the one or more third data structures are presented to the user on a graphical user interface (GUI).
10. The computer implemented method of claim 9 , further comprising identifying a new second data structure and repeating (b)-(e).
11. A non-transitory computer-readable medium comprising machine-executable code that, upon execution by a computer, implements a method for data hierarchy-independent data drilling, the method comprising:
(a) selecting one or more primary keys of one or more records from a first data structure in response to a query received from a user;
(b) identifying one or more second data structures related to the first data structure based at least in part on the one or more primary keys of the one or more records;
(c) determining that at least one of the one or more second data structures is an intermediate relation table, wherein a row in the intermediate relation table defines a mapping relationship between two elements and wherein the row comprises two foreign keys of the two elements with a first foreign key same as a primary key of the first data structure and a second foreign key same as a primary key of a third data structure;
(d) for the intermediate relation table, identifying one or more result foreign keys based on the one or more primary keys and one or more of the third data structures, wherein at least one of the one or more third data structures comprises one of the two elements uniquely identified by the one or more result foreign keys, and wherein the first data structure, the one or more second data structures, and the one or more third data structures are hierarchical independent and the element in the at least one of the one or more third data structures do not have a parent or child relationship with other elements; and
(e) presenting the one or more third data structures to the user for selection for further data drilling.
12. The non-transitory computer-readable medium of claim 11 , wherein the one or more third data structures are not intermediate relation tables.
13. The non-transitory computer-readable medium of claim 11 , wherein the mapping relationship is between one or more elements of the first data structure and one or more elements of the one or more third data structures.
14. The non-transitory computer-readable medium of claim 13 , wherein the one or more elements of the first data structure is represented by a first foreign key from the at least two foreign keys in the intermediate relation table and the one or more elements of the third data structure is represented by a second foreign key from the at least two foreign keys in the intermediate relation table.
15. The non-transitory computer-readable medium of claim 14 , wherein the second foreign key corresponds to a primary key of the respective one or more elements in the one or more third data structures.
16. The non-transitory computer-readable medium of claim 11 , wherein the method further comprises determining that at least one of the one or more second data structures is a table that is not an intermediate relation table.
17. The non-transitory computer-readable medium of claim 16 , wherein the method further comprises presenting the table to the user.
18. The non-transitory computer-readable medium of claim 16 , wherein the one or more primary keys of the one or more records are presented as one or more foreign keys in the regular table.
19. The non-transitory computer-readable medium of claim 11 , wherein the one or more third data structures are presented to the user on a GUI.
20. The non-transitory computer-readable medium of claim 11 , wherein the method further comprises identifying a new second data structure and repeating (b)-(e).