Mark-based agile data drilling method and drilling system

Abstract

The invention provides a mark-based agile data drill-down method and drill-down system, and solves the problems of tedious manual configuration and inflexible use of a drill-down method in the prior art. The invention discloses a mark-based agile data drilling method. The method comprises a mark generation step, a mark modification step and a data updating step, the method for generating the mark comprises the following steps of: 1.1, drilling down data; 1.2, automatically generating a new mark, wherein the new mark has an identifier corresponding to the new mark; 1.3, recording the information of the drilled data table and the marked row index set; 1.4, binding parent mark reference, and updating a mark relation and an adjacency list; the drilling method provided by the invention has the capabilities of automatically forming the new mark, managing the mark relationship and establishing association under the condition of multiple data tables, data based on the mark limiting relationship can be quickly positioned and searched for hundreds of millions of rows of data, and the marked data can be quickly positioned.

Description

Technical Field

[0001] The present invention relates to the technical field of data processing and data analysis, and in particular to a tag-based agile data drill-down method and a drill-down system. Background Art

[0002] In the current era of big data, data analysis and processing have become an important part of corporate decision-making and business development. Data drill-down methods are essential for users to quickly and flexibly obtain information from complex data sets. However, traditional data drill-down methods have the following problems:

[0003] Problem 1: The tediousness of manual configuration

[0004] Many existing data drill-down methods require users to manually configure tags and relationships between tags, which makes the configuration cumbersome. Users need to spend a lot of time and effort to define the drill-down path, which limits the efficiency of ad hoc analysis.

[0005] The main reason for this problem is that manual configuration is prone to errors, and the processing of complex data sets requires users to have strong professional knowledge. In addition, data relationships may become complex over time and with business changes, and manual configuration is difficult to adapt to changes in a timely manner.

[0006] Problem 2: Inflexible handling of multiple data tables

[0007] Some implementations require processing multiple data tables into one table to facilitate data drilling. This approach is not flexible enough when dealing with multiple data sources and requires a lot of preprocessing work.

[0008] Merging multiple data tables may involve different data structures, field conflicts, and other issues, which require advance planning and processing. This is a limitation for frequently changing business needs.

[0009] These methods have the problems of complex configuration and inflexible use, and cannot meet users' needs for ad hoc and agile data drilling. Therefore, it is necessary to provide a more flexible and efficient data drilling method to adapt to the ever-changing business needs. Summary of the invention

[0010] The present invention proposes a tag-based agile data drill-down method and a drill-down system, which solve the problems of cumbersome manual configuration and inflexible use of the drill-down method in the prior art.

[0011] The technical solution of the present invention is implemented as follows: an agile data drill-down method based on tags,

[0012] It includes a tag generation step, a tag modification step, and a data update step;

[0013] The tag generation method is as follows: 1.1 data drilling down; 1.2, automatically generating new tags, the new tags have corresponding identifiers; 1.3, recording the drilled data table information and the marked row index set; 1.4, binding the parent tag reference, updating the tag relationship and adjacency table;

[0014] The tag modification method includes: 2.1, modifying the tag; 2.2, modifying the parent tag reference, updating the tag relationship and adjacency list; 2.3, updating the row index set;

[0015] The data update process includes: 3.1, updating data; 3.2, obtaining a sub-tag set; 3.3, updating a row index set.

[0016] Preferably, the specific steps of the tag generation method are as follows:

[0017] When a user selects business data for drill-down operations, the data drill-down system captures the action, automatically forms a new tag, and generates an identifier that corresponds to the new tag. The new tag records the row index set marked by the user's drill-down operation.

[0018] When the data marked by the new tag exists in the original tag, the new tag is the child tag of the original tag, and the original tag is the parent tag of the new tag, thus establishing a parent-child inheritance relationship between tags; the child tag references the identifier of the parent tag;

[0019] All tags form a relationship network based on the parent-child inheritance relationship; the adjacency list is updated according to the relationship network, the adjacency list records all tags, and the adjacency list also records the sub-tag sets of all tags. The adjacency list is used to update the sub-tag data after the subsequent tag data is updated.

[0020] Preferably, the specific steps of the mark modification method are as follows:

[0021] The user modifies the relationship network, including adding a parent tag to a tag, or deleting a parent tag from a tag; when any tag A adds a parent tag B, the system will add the identifier of tag B to the parent tag reference of tag A, and update the adjacency list at the same time, adding the tag A to the child tag set of tag B; when a tag A deletes its parent tag B, the system will delete the identifier of tag B in the parent tag reference of tag A, and update the adjacency list at the same time, deleting the tag A from the child tag set of tag B;

[0022] After any tag A modifies its parent tag reference, the row index set of tag A is updated; before the update, the row index set of tag A is H0, its parent tag is Bi, i=1, 2, 3,..., n-1, n, and the row index set of tag Bi is Ii; after the update, the row index set of tag A is H1=H0∩(∩Ii).

[0023] Preferably, the data updating method comprises the following specific steps:

[0024] When the row index set I of any tag B is updated, the sub-tag set {Aj} of tag B is obtained through the adjacency list, and the row index set of sub-tag Aj is updated, j = 1, 2, 3, ..., m-1, m; before the update, the row index set of sub-tag Aj is recorded as H0j, and after the update, the row index set of Aj is H1j = H0j∩I.

[0025] Preferably, when drilling down data, there are multiple data tables, and a multi-data table relationship is established by associating fields. The multiple data tables that establish the relationship transfer tags from one data table to another data table.

[0026] Preferably, the business data is selected by randomly selecting from a list, or aggregating the business data table using multiple index dimensions, or at least one aggregation dimension.

[0027] The present invention also proposes a drill-down system based on labeled agile data.

[0028] Includes: data drill-down module, tag relationship maintenance module, data update module, and data display module;

[0029] The data drill-down module drills down on the data, forms a mark, records the marked row index set, and triggers the mark relationship maintenance module; or modifies the mark to trigger the mark relationship maintenance module;

[0030] The tag relationship maintenance module performs relationship maintenance when there is a change in the tag relationship and triggers the data update module;

[0031] The data update module updates the row index set of the current tag, and iteratively updates the row index sets in its multi-level sub-tag sets until all tags without sub-tag sets are updated;

[0032] The data display module displays the data represented by the row index set of the tag and displays the parent tag of the tag.

[0033] Beneficial effects of the present invention:

[0034] The present invention provides a tag-based agile data drill-down method with the ability to automatically form new tags, manage tag relationships, and establish associations in the case of multiple data tables. Data based on tag-restricted relationships can be quickly located to find hundreds of millions of rows of data, and the tagged data can be quickly located. Compared with the traditional manual configuration method, the present invention is more intelligent and flexible, allowing users to perform ad hoc data drill-down analysis more freely without tedious preprocessing. This technical solution not only improves the efficiency of data analysis, but also reduces the user's operating burden, which is in line with the current development trend of data processing. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.

[0036] Figure 1 It is a schematic diagram of the principle of the present invention;

[0037] Figure 2 It is a schematic diagram of the tag relationship network of the present invention;

[0038] Figure 3 This is intended to be an adjoining representation of the present invention. DETAILED DESCRIPTION

[0039] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0040] An agile data drill-down method based on tags.

[0041] It includes a tag generation step, a tag modification step, and a data update step;

[0042] The specific steps of the tag generation method are as follows:

[0043] The user selects business data for drill-down operation, and the data drill-down system captures the action, automatically forms a new tag, and generates an identifier corresponding to the new tag. The new tag records the row index set marked by the user's drill-down operation. The business data is selected by random selection from the list, or by aggregating the business data table with multiple index dimensions or at least one aggregation dimension.

[0044] When the data marked by the new tag exists in the original tag, the new tag is the child tag of the original tag, and the original tag is the parent tag of the new tag, thus establishing a parent-child inheritance relationship between tags; the child tag references the identifier of the parent tag;

[0045] All tags form a relationship network based on the parent-child inheritance relationship; the adjacency list is updated according to the relationship network, the adjacency list records all tags, and the adjacency list also records the sub-tag sets of all tags. The adjacency list is used to update the sub-tag data after the subsequent tag data is updated.

[0046] like Figure 1 As shown, the tag generation process includes: step 1, data drilling down; step 2, automatically generating new tags, and the tags have unique identifiers; step 3, recording the drilled data table information and the marked row index set; step 4, binding the parent tag reference, and updating the tag relationship and adjacency table.

[0047] like Figure 2 As shown in the figure, when drilling down on data with tag 1, tag 3 is automatically generated. Tag 3 records the drilled-down data table information and the marked row index set, and records tag 1 in the parent tag reference of tag 3, updates the relationship between tag 1 and tag 3, and updates the adjacency list. The updated content of the adjacency list is as follows: Figure 3 As shown, tag 1 already exists in the tag list, the sub-tag set corresponding to tag 1 is updated, and tag 3 is added; at the same time, tag 3 is added to the tag list.

[0048] Similarly, when drilling down on data with tag 3, tag 5 is automatically generated; when drilling down on data with tag 2, tags 4 and 6 are automatically generated; when drilling down on data with tag 4, tag 7 is automatically generated, and the row index set of tag 7 is the same as the row index set of tag 6, which are the same tags, and only tag 6 is retained. Update the relationship between tag 3 and tag 5, tag 2 and tag 4, tag 2 and tag 6, and tag 4 and tag 6, and update the adjacency table.

[0049] After the above process, tag 3 is added as the parent tag of tag 4, and finally the following is obtained: Figure 2 The relationship diagram shown in Figure 3 The adjacency list shown.

[0050] The specific steps of the tag modification method are as follows:

[0051] The user modifies the relationship network, including adding a parent tag to a tag, or deleting a parent tag from a tag; when any tag A adds a parent tag B, the system will add the identifier of tag B to the parent tag reference of tag A, and update the adjacency list at the same time, adding the tag A to the child tag set of tag B; when a tag A deletes its parent tag B, the system will delete the identifier of tag B in the parent tag reference of tag A, and update the adjacency list at the same time, deleting the tag A from the child tag set of tag B;

[0052] After any tag A modifies its parent tag reference, the row index set of tag A is updated; before the update, the row index set of tag A is H0, its parent tag is Bi, i=1, 2, 3,..., n-1, n, and the row index set of tag Bi is Ii; after the update, the row index set of tag A is H1=H0∩(∩Ii).

[0053] like Figure 1As shown, the tag modification process includes: step 1, modifying the tag; step 2, modifying the parent tag reference, updating the tag relationship and adjacency list; step 3, updating the row index set.

[0054] like Figure 2 As shown, tag 4 is modified and tag 3 is added as the parent tag of tag 4.

[0055] Add tag 3 to the parent tag reference of tag 4 and update the tag relationship. Update the adjacency list. The updated content of the adjacency list is as follows: Figure 3 As shown, tag 3 already exists in the tag list, and the sub-tag set corresponding to tag 3 is updated, and tag 4 is added.

[0056] Update the row index set of marker 4. Before the update, the row index set of marker 4 is H0, its parent markers are marker 2 and marker 3, the row index set of marker 2 is I1, and the row index set of marker 3 is I2; after the update, the row index set of marker 4 is H1 = H0 ∩ (I2 ∩ I3) = H0 ∩ I2 ∩ I3 = H0 ∩ I3.

[0057] The specific steps of the data updating method are as follows:

[0058] When the row index set I of any tag B is updated, the sub-tag set {Aj} of tag B is obtained through the adjacency list, and the row index set of sub-tag Aj is updated, j = 1, 2, 3, ..., m-1, m; before the update, the row index set of sub-tag Aj is recorded as H0j, and after the update, the row index set of Aj is H1j = H0j∩I.

[0059] like Figure 1 As shown, the data update process includes: step 1, updating data; step 2, obtaining a sub-tag set; step 3, updating a row index set.

[0060] like Figure 3 As shown, the subtag set of tag 1 includes tag 3, the subtag set of tag 3 includes tags 4 and 5, and the subtag set of tag 4 includes tag 6. When the row index set I1 of tag 1 changes, the subtags are first iterated downward to obtain the first-level subtag set {tag 3}, the second-level subtag set {tag 4, tag 5}, and the third-level subtag set {tag 6}. Then, the row index sets of the first-level subtags, the second-level subtags, and the third-level subtags are changed in turn.

[0061] The row index set of marker 3 is H03 before updating and is H13=H03∩I1 after updating.

[0062] The row index set of marker 4 is H04 before updating and H14=H04∩H13 after updating. The row index set of marker 5 is H05 before updating and H15=H05∩H13 after updating.

[0063] The row index set of mark 6 is H06 before updating and is H16=H06∩H14 after updating.

[0064] After tag 6 is updated, if tag 6 has sub-tags, it is necessary to continue updating the sub-tags until the related tags have no sub-tags. Currently, tag 6 has no sub-tags, and the update is completed.

[0065] The present invention also provides a drilling method for multiple data tables: when multiple data tables exist during data drilling, a multi-data table relationship is established through associated fields, and the multiple data tables with established relationships transfer tags from one data table to another.

[0066] A tag-based agile data drill-down system, comprising: a data drill-down module, a tag relationship maintenance module, a data update module, and a data display module;

[0067] The data drill-down module drills down on the data, forms a mark, records the marked row index set, and triggers the mark relationship maintenance module; or modifies the mark to trigger the mark relationship maintenance module;

[0068] The tag relationship maintenance module performs relationship maintenance when there is a change in the tag relationship and triggers the data update module;

[0069] The data update module updates the row index set of the current tag, and iteratively updates the row index sets in its multi-level sub-tag sets until all tags without sub-tag sets are updated;

[0070] The data display module displays the data represented by the row index set of the tag and displays the parent tag of the tag.

[0071] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. A tag-based agile data drill-down method, characterized in that: It includes a tag generation step, a tag modification step, and a data update step; The tag generation method is as follows: 1.1 data drilling down; 1.2, automatically generating new tags, the new tags have corresponding identifiers; 1.3, record the drilled data table information and the marked row index set; 1.4, bind the parent tag reference, update the tag relationship and adjacency list; The tag modification method includes: 2.1, modifying the tag; 2.2, modifying the parent tag reference, updating the tag relationship and adjacency list; 2.3, updating the row index set; The data update process includes: 3.1, updating data; 3.2, obtaining a sub-tag set; 3.3, updating a row index set.

2. The tag-based agile data drill-down method according to claim 1, characterized in that: The specific steps of the tag generation method are as follows: When a user selects business data for drill-down operations, the data drill-down system captures the action, automatically forms a new tag, and generates an identifier that corresponds to the new tag. The new tag records the row index set marked by the user's drill-down operation. When the data marked by the new tag exists in the original tag, the new tag is the child tag of the original tag, and the original tag is the parent tag of the new tag, thus establishing a parent-child inheritance relationship between the tags; The child tag references the identifier of the parent tag through the parent tag; All tags form a relationship network based on the parent-child inheritance relationship; the adjacency list is updated according to the relationship network, the adjacency list records all tags, and the adjacency list also records the sub-tag sets of all tags. The adjacency list is used to update the sub-tag data after the subsequent tag data is updated.

3. The tag-based agile data drill-down method according to claim 1, characterized in that: The specific steps of the tag modification method are as follows: The user modifies the relationship network, including adding a parent tag to a tag, or deleting a parent tag from a tag; if any tag A adds a parent tag B, the system will add the identifier of tag B to the parent tag reference of tag A, and update the adjacency list at the same time, adding tag A to the child tag set of tag B; When a tag A deletes its parent tag B, the system will delete the identifier of tag B in the parent tag reference of tag A, and update the adjacency list to delete tag A from the child tag set of tag B; When any tag A modifies the parent tag reference, update the row index set of tag A; Before the update, the row index set of tag A is H0, its parent tag is Bi, i=1, 2, 3, ..., n-1, n, and the row index set of tag Bi is Ii; after the update, the row index set of tag A is H1=H0∩(∩Ii).

4. The tag-based agile data drill-down method according to claim 1, characterized in that: The specific steps of the data updating method are as follows: When the row index set I of any tag B is updated, the sub-tag set {Aj} of tag B is obtained through the adjacency list, and the row index set of sub-tag Aj is updated, j = 1, 2, 3, ..., m-1, m; before the update, the row index set of sub-tag Aj is recorded as H0j, and after the update, the row index set of Aj is H1j = H0j∩I.

5. The tag-based agile data drill-down method according to claim 1, characterized in that: When drilling down data, there are multiple data tables. A multi-data table relationship is established by associating fields. The multiple data tables that establish a relationship transfer tags from one data table to another.

6. The tag-based agile data drill-down method according to claim 2, characterized in that: The business data is selected by randomly selecting from a list, or aggregating the business data table using multiple index dimensions, or at least one aggregation dimension.

7. A drill-down system based on labeled agile data, characterized in that: include: Data drill-down module, tag relationship maintenance module, data update module, data display module; The data drill-down module drills down on the data, forms a mark, records the marked row index set, and triggers the mark relationship maintenance module; Or modify the tag to trigger the tag relationship maintenance module; The tag relationship maintenance module performs relationship maintenance when there is a change in the tag relationship and triggers the data update module; The data update module updates the row index set of the current tag, and iteratively updates the row index sets in its multi-level sub-tag sets until all tags without sub-tag sets are updated; The data display module displays the data represented by the row index set of the tag and displays the parent tag of the tag.

Images