Data drilling method

Abstract

The invention discloses a data drilling method. The data drilling method comprises the steps of obtaining a plurality of nodes, and determining chart description information of each node; establishingat least one drilling path, and determining drilling path information of each node; storing each node with the corresponding chart description information and the corresponding drilling path information as node description information of the node; receiving a query instruction, and establishing a data query structure according to the query instruction; searching a drill-down data query result ofthe current node in a database according to the data query structure; and searching a drill-up data query result of any node in a database according to the data query structure. According to the datadrilling method, the corresponding node description information can be set for each node on the drilling path according to the business requirements, the visualization performance of the drilling result is improved, and a user can check the data drilling result more efficiently and conveniently through a visualization mode.

Description

technical field [0001] The invention relates to the technical field of computer applications, in particular to a data drilling method. Background technique [0002] Data drilling has become a basic functional requirement in the field of data visualization and business intelligence. The traditional drilling method based on the data source table or data model currently used usually needs to predefine the dimension drilling path on the data source, so during the drilling execution process, it can only be drilled according to this dimension path. At the same time, because the storage structure of the drill path does not store visualization-oriented description information, such as the type description information of the visualization chart, the data dimension combination description information of the visualization chart, or the style description information of the visualization chart, etc., there is no The drill path saves specific filter conditions, which will result in the i...

AI Technical Summary

Problems solved by technology

[0005] 1. Because there is no chart information stored in the drill path nodes, nodes a, b, c, and d can only be of the same chart type. If the chart created by node a during visualization is a column chart, the other nodes are all columns picture;

[0006] 2. Because the drill path node does not store chart data dimension combination information, nodes a, b, c, and d, except the dimensions specified on the drill path can be changed with the drill, other dimensions will remain unchanged;

[0007] 3. Because there is no specific filter condition stored in the drill path node, a node among nodes a, b, c, and d cannot add a specific filter. For example, in node b, if the sales director only cares about the data of low and peak seasons, But node c wants to see the data of the whole year, so this demand will not be met

Images