Database hierarchy-independent data drilling

• US 10,242,056 B2
• Filed: 06/26/2014
• Issued: 03/26/2019
• Est. Priority Date: 06/30/2013
• Status: Active Grant

• Current Assignee: Datawalk Spolka Akcyjna
• Original Assignee: Datawalk Spolka Akcyjna
• Inventors: Piecko, Krystian
• Primary Examiner(s): Reyes, Mariela
• Assistant Examiner(s): Mincey, Jermaine A
• Application Number:
  US14/315,481
• Publication Number:
  US 20150006507A1
• Time in Patent Office: 1,734 Days
• Field of Search: None
• CPC Class Codes: G06F 16/24544 Join order optimisation
• CPC Class Codes: G06F 16/26 Visual data mining; Browsing structured data

Abstract

Computer implemented methods for database hierarchy-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.

Claims

1. A computer implemented method for database hierarchy-independent data drilling comprising:

(a) accessing a database comprising;

(1) a first data structure comprising definitions of at least two data sets, wherein a definition of a data set comprises a unique set identifier and a set name,

(2) a second data structure comprising definitions of relations of the at least two data sets, wherein a definition of a relation comprises an identifier of the relation, wherein a relation is a type of logical path between two data sets, and

(3) a third data structure comprising definitions of set relations between the at least two data sets, wherein a definition of a set relation associates an identifier of a relation, from the second data structure, to the respective unique set identifiers of two data sets from the first data structure, wherein a given row of the third data structure comprises two unique set identifiers from the first data structure,

 

wherein all data sets in the first data structure are hierarchy independent such that (i) the data sets in the first data structure do not have a parent or child relationship to other data sets, and (ii) a set relation is capable of associating an identifier of a relation to the respective set identifiers of any two data sets of all of the data sets;

(b) selecting a set identifier of a start data set using the first data structure;

(c) setting the set identifier of the start data set as a current data drilling state;

(d) finding one or more data sets related to the current data drilling state by identifying definitions of set relations comprising the set identifier of the start data set using the third data structure, wherein the one or more data sets include a second data set;

(e) identifying a hierarchy-independent relation between the current data drilling state and the second data set using the definitions of the relations in the second data structure, wherein the second data set does not have a parent or child relationship to the current data drilling state, thereby finding a logical path between the start data set and the second data set; and

(f) using the logical path, retrieving the second data set and setting the second data set as the current data drilling state,

 

wherein the combination of the first data structure, second data structure, and third data structure permits efficient data drilling with reduced computational resources.

2. The method of claim 1, further comprising:

(g) iteratively executing (d) to (f) for the current data drilling state until the logical path linking the start data set and an end data set has been data drilled.

3. The method of claim 1 further comprising:

outputting all discovered paths to data tables on a graphical user interface;

selecting a first data table;

selecting records from the first data table; and

passing data of the selected records as parameters to queries for records from a second data table.

4. The method of claim 1 wherein the database further comprises:

a fourth data structure, comprising definitions of data properties of the at least two data sets, wherein a definition of a data property includes an identifier of the data property, a set identifier from the first data structure, and a data property name;

a fifth data structure, comprising definitions of data objects of the at least two data sets, wherein a definition of a data object includes a unique data object identifier and a set identifier from the first data structure; and

a sixth data structure, comprising definitions of data object values, wherein a definition of a data object value comprises (i) the data object value, (ii) a data object identifier from the fifth data structure, and (iii) a data property identifier from the fourth data structure.

5. The method of claim 4, wherein the database further comprises:

a seventh data structure comprising definitions of relations between objects, wherein a definition of each object relation associates a relation from the second data structure to the respective data object identifiers of two data objects from the fifth data structure.

6. 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) accessing a database comprising;

(1) a first data structure comprising definitions of at least two data sets, wherein a definition of a data set comprises a unique set identifier and a set name,

(2) a second data structure comprising definitions of relations of the at least two data sets, wherein a definition of a relation comprises an identifier of the relation, wherein a relation is a type of logical path between two data sets, and

(3) a third data structure comprising definitions of set relations between the at least two data sets, wherein a definition of a set relation associates an identifier of a relation, from the second data structure, to the respective unique set identifiers of two data sets from the first data structure, wherein a given row of the third data structure comprises two unique set identifiers from the first data structure,

 

wherein all data sets in the first data structure are hierarchy independent such that (i) the data sets in the first data structure do not have a parent or child relationship to other data sets, and (ii) a set relation is capable of associating an identifier of a relation to the respective set identifiers of any two data sets of all of the data sets;

(b) selecting a set identifier of a start data set using the first data structure;

(c) setting the set identifier of the start data set as a current data drilling state;

(d) finding one or more data sets related to the current data drilling state by identifying definitions of set relations comprising the set identifier of the start data set using the third data structure, wherein the one or more data sets include a second data set;

(e) identifying a hierarchy-independent relation between the current data drilling state and the second data set using the definitions of the relations in the second data structure, wherein the second data set does not have a parent or child relationship to the current data drilling state, thereby finding a logical path between the start data set and the second data set; and

(f) using the logical path, retrieving the second data set and setting the second data set as the current data drilling state,

 

wherein the combination of the first data structure, second data structure, and third data structure permits efficient data drilling with reduced computational resources.

7. The medium of claim 6, wherein the method further comprises:

(g) iteratively executing (d) to (f) for the current data drilling state until the logical path linking the start data set and an end data set has been data drilled.

8. The medium of claim 6, wherein the method further comprises:

outputting all discovered paths to data tables on a graphical user interface;

selecting a first data table;

selecting records from the first data table; and

passing data of the selected records as parameters to queries for records from a second data table.

9. The medium of claim 6, wherein the database further comprises:

a fourth data structure, comprising definitions of data properties of the at least two data sets, wherein a definition of a data property includes an identifier of the data property, a set identifier from the first data structure, and a data property name;

a fifth data structure, comprising definitions of data objects of the at least two data sets, wherein a definition of a data object includes a unique data object identifier and a set identifier from the first data structure; and

a sixth data structure, comprising definitions of data object values, wherein a definition of a data object value comprises (i) the data object value, (ii) a data object identifier from the fifth data structure, and (iii) a data property identifier from the fourth data structure, the data object value being assigned to.

10. The medium of claim 9, wherein the database further comprises:

a seventh data structure comprising definitions of relations between objects, wherein a definition of each object relation associates a relation from the second data structure to the respective data object identifiers of two data objects from the fifth data structure.