US 12,287,787 B2
Database hierarchy-independent data drilling
Krystian Piecko, Wroclaw (PL)
Assigned to DataWalk Spółka Akcyjna, Wroclaw (PL)
Filed by DataWalk Spółka Akcyjna, Wroclaw (PL)
Filed on Jul. 27, 2022, as Appl. No. 17/874,543.
Application 17/874,543 is a continuation of application No. 16/269,268, filed on Feb. 6, 2019, granted, now 11,436,225.
Application 16/269,268 is a continuation of application No. 14/315,481, filed on Jun. 26, 2014, granted, now 10,242,056, issued on Mar. 26, 2019.
Claims priority of application No. EP13461536.8 (EP), filed on Jun. 30, 2013.
Prior Publication US 2023/0147132 A1, May 11, 2023
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 16/24 (2019.01); G06F 16/2453 (2019.01); G06F 16/26 (2019.01); G06F 16/29 (2019.01)
CPC G06F 16/24544 (2019.01) [G06F 16/26 (2019.01)] 20 Claims
OG exemplary drawing
 
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.