CN108009193A - Data analysing method and device, storage medium, electronic equipment - Google Patents
Data analysing method and device, storage medium, electronic equipment Download PDFInfo
- Publication number
- CN108009193A CN108009193A CN201710980654.9A CN201710980654A CN108009193A CN 108009193 A CN108009193 A CN 108009193A CN 201710980654 A CN201710980654 A CN 201710980654A CN 108009193 A CN108009193 A CN 108009193A
- Authority
- CN
- China
- Prior art keywords
- node
- list
- tree
- dimension
- polymerization
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/283—Multi-dimensional databases or data warehouses, e.g. MOLAP or ROLAP
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2246—Trees, e.g. B+trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2264—Multidimensional index structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
- G06F16/24553—Query execution of query operations
- G06F16/24554—Unary operations; Data partitioning operations
- G06F16/24556—Aggregation; Duplicate elimination
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
This disclosure relates to a kind of data analysing method and device, storage medium, electronic equipment.The described method includes：Obtain the dimensional information of multidimensional data list；According to the dimensional information, polymerization processing is carried out to the multidimensional data list, generate the corresponding tree of the multidimensional data list, the leaf node in the tree is list after polymerization, and the dimension number of list is successively successively decreased from root node to leaf node direction after the polymerization；Data analysis is carried out for the node in the tree, obtains data results.Such scheme, helps quickly to carry out multi-dimensional data analysis.
Description
Technical field
This disclosure relates to data processing field, and in particular, to a kind of data analysing method and device, computer-readable deposit
Storage media, electronic equipment.
Background technology
At present, OLAP (English is passed through mostly：Online Analytical Processing, Chinese：At on-line analysis
Reason) multi-dimensional data analysis is carried out, according to the difference of data storage method, OLAP can be divided into ROLAP (English：
Relational OLAP, Chinese：Relation on-line analytical processing), MOLAP (English：Multidimensional OLAP, Chinese：
Multi-dimension on-line analytical process).
Wherein, the multidimensional data of analysis is stored in relational database by ROLAP, and needs selection according to application
The a collection of real-time coupling of definition also be stored in as table in relational database.MOLAP is by the multidimensional data thing used in olap analysis
The form of Multidimensional numerical is stored as in reason, forms the structure of " cube ", the property value of dimension is mapped under Multidimensional numerical
Scale value or lower target scope, and summary data is stored in the unit of array as the value of Multidimensional numerical.
In actual application, with exponential other growth of the increase of data analysis dimension, and data volume, on
State two kinds of data analysis modes and occur problems with respectively：
Inquiry is required for carrying out data polymerization calculating ROLAP every time, and inquiry will travel through whole table every time, it is assumed that has
5 tables, five traversal lists certainly will cause calculating speed very slow.
The shortcomings that MOLAP is that data volume is not easily controlled, when dimension is excessive, it is possible that dimension explosion is asked
Topic.
The content of the invention
The purpose of the disclosure is to provide a kind of data analysing method and device, computer-readable recording medium and electronics and sets
It is standby, help quickly to carry out multi-dimensional data analysis.
To achieve these goals, in a first aspect, the disclosure provides a kind of data analysing method, including：
Obtain the dimensional information of multidimensional data list；
According to the dimensional information, polymerization processing is carried out to the multidimensional data list, generates the multidimensional data list
Corresponding tree, the leaf node in the tree are list after polymerization, and after the polymerization list number of dimensions
Mesh successively successively decreases from root node to leaf node direction；
Data analysis is carried out for the node in the tree, obtains data results.
Alternatively, it is described according to the dimensional information, polymerization processing is carried out to the multidimensional data list, generation is described more
The corresponding tree of dimension data list, including：
The multidimensional data list is determined as to the root node of the tree；
The leaf node in the tree is obtained in the following way：
The dimensional information of this grade of node is determined according to the dimensional information of superior node, and the list of superior node is gathered
Conjunction is handled, and obtains list after the polymerization of this grade of node, the dimensional information of the bottom leaf node of the tree is 0 dimension
Degree.
Alternatively, the dimensional information of the superior node is N number of dimension, and the dimensional information according to superior node determines
The dimensional information of this grade of node, and polymerization processing is carried out to the list of superior node, list after the polymerization of this grade of node is obtained, is wrapped
Include：
Higher level's present node is determined from the superior node, N number of dimension of higher level's present node is believed
Breath carries out dimension-reduction treatment, obtains the dimensional information of this grade of node, and the dimensional information of described level node is (N-1) a dimension
Degree；
A this grade of present node is determined from described level node, judges whether to include in the tree described
List after the polymerization of this grade of present node；
If the tree includes list after the polymerization of described level present node, judge described in (N-1) it is a
Whether dimension is 0 dimension；
If (N-1) a dimension is 0 dimension, recall from described level node to the root node direction, until
Traversal is obtained in the tree after the polymerization of all leaf nodes untill list.
Alternatively, the method further includes：
It is current to the higher level if not including list after the polymerization of described level present node in the tree
The list of node carries out polymerization processing, obtains list after the polymerization of described level present node, then performs (N- described in the judgement
1) the step of whether a dimension is 0 dimension.
Alternatively, the method further includes：
If (N-1) a dimension is not 0 dimension, to (N-1) a dimensional information of described level present node into
Row dimension-reduction treatment, obtains the dimensional information of downstream site, and the dimensional information of the downstream site is (N-2) a dimension；
Subordinate's present node is determined from the downstream site, judges whether to include in the tree described
List after the polymerization of subordinate's present node；
If the tree includes list after the polymerization of subordinate's present node, judge described in (N-2) it is a
Whether dimension is 0 dimension；
If (N-2) a dimension is 0 dimension, recall from the downstream site to the root node direction, until
Traversal is obtained in the tree after the polymerization of all leaf nodes untill list.
Alternatively, the method further includes：
According to the dimensional information of incremental data list, polymerization processing is carried out to the incremental data list, generates the increasing
Measure the corresponding tree of data form；
To in the corresponding tree of multidimensional data list tree corresponding with the incremental data list
Same node point, carries out list merging, obtains new tree；
Then the node being directed in the tree carries out data analysis, obtains data results, including：
Data analysis is carried out for the node in the new tree, obtains new data results.
Second aspect, the disclosure provide a kind of data analysis set-up, and described device includes：
Dimensional information acquisition module, for obtaining the dimensional information of multidimensional data list；
Tree generation module, for according to the dimensional information, polymerization processing to be carried out to the multidimensional data list,
Generate the corresponding tree of the multidimensional data list, the leaf node in the tree is list after polymerization, and institute
The dimension number for stating list after polymerizeing successively is successively decreased from root node to leaf node direction；
Data analysis module, for carrying out data analysis for the node in the tree, obtains data analysis knot
Fruit.
Alternatively, the tree generation module includes：
Root node determining module, for the multidimensional data list to be determined as to the root node of the tree；
Leaf node obtains module, for obtaining the leaf node in the tree in the following way：According to upper
The dimensional information of level node determines the dimensional information of this grade of node, and carries out polymerization processing to the list of superior node, obtains this
List after the polymerization of level node, the dimensional information of the bottom leaf node of the tree is 0 dimension.
Alternatively, the dimensional information of the superior node is N number of dimension, and the leaf node, which obtains module, to be included：
Dimension-reduction treatment module, for determining higher level's present node from the superior node, works as the higher level
N number of dimensional information of front nodal point carries out dimension-reduction treatment, obtains the dimensional information of this grade of node, and the dimension letter of described level node
Breath is (N-1) a dimension；
First judgment module, for determining this grade of present node from described level node, judges described tree-shaped
Whether the polymerization of described level present node after list is included in structure；
Second judgment module, after the polymerization for including described level present node in the tree during list,
Whether (N-1) a dimension described in judgement is 0 dimension；
Backtracking module, for when (N-1) a dimension is 0 dimension, from described level node to the root node side
To backtracking, obtained until traversal in the tree after the polymerization of all leaf nodes untill list.
Alternatively, the leaf node obtains module and further includes：
It polymerize processing module, list after the polymerization for not including described level present node in the tree
When, polymerization processing is carried out to the list of higher level's present node, obtains list after the polymerization of described level present node, then lead to
Know whether (N-1) a dimension described in the second judgment module judgement is 0 dimension.
Alternatively, the dimension-reduction treatment module, is additionally operable to when (N-1) a dimension is not 0 dimension, to described level
(N-1) of present node a dimensional information carries out dimension-reduction treatment, obtains the dimensional information of downstream site, and the downstream site
Dimensional information is (N-2) a dimension；
First judgment module, is additionally operable to determine subordinate's present node from the downstream site, judges institute
State in tree list after the polymerization for whether including subordinate's present node；
Second judgment module, list after the polymerization for including subordinate's present node in the tree
When, whether (N-2) a dimension described in judgement is 0 dimension；
The backtracking module, is additionally operable to when (N-2) a dimension is 0 dimension, from the downstream site to described
Node direction is recalled, and is obtained until traveling through in the tree after the polymerization of all leaf nodes untill list.
Alternatively, described device further includes：
Increment tree generation module, for the dimensional information according to incremental data list, to the incremental data table
Polymerization processing is singly carried out, generates the corresponding tree of the incremental data list；
List merging module, for the corresponding tree of the multidimensional data list and the incremental data list pair
Same node point in the tree answered, carries out list merging, obtains new tree；
The then data analysis module, for carrying out data analysis for the node in the new tree, obtains
New data results.
The third aspect, the disclosure provide a kind of computer-readable recording medium, are stored thereon with computer program, the program
The step of method any one of first aspect is realized when being executed by processor.
Fourth aspect, the disclosure provide a kind of electronic equipment, including：
Computer-readable recording medium described in the third aspect；And
One or more processor, for performing the program in the computer-readable recording medium.
Disclosure scheme, can be handled based on the dimensional information that multidimensional data list has, is generated more dimensions by polymerization
According to the corresponding tree of list, by the node in tree, the form data that different dimensions combine is represented.In this way, needing
When wanting, the list of respective nodes expression can be directly acquired, carries out data analysis.On the one hand, without such as ROLAP each data point
Analysis will travel through whole table, help to lift data analyzing speed；On the other hand, data analysis dimension increase, can be presented as
The problem of level of tree, the change of node are not in the explosion of MOLAP dimensions.
Other feature and advantage of the disclosure will be described in detail in subsequent specific embodiment part.
Brief description of the drawings
Attached drawing is for providing further understanding of the disclosure, and a part for constitution instruction, with following tool
Body embodiment is used to explain the disclosure together, but does not form the limitation to the disclosure.In the accompanying drawings：
Fig. 1 is the flow diagram of disclosure data analysing method；
Fig. 2 is a kind of schematic diagram of tree in the disclosure；
Fig. 3 is the flow diagram that tree is built in the disclosure；
Fig. 4 is another schematic diagram of tree in the disclosure；
Fig. 5 is the structure diagram of disclosure data analysis set-up；
Fig. 6 is the structure diagram for the electronic equipment that the disclosure is used for data analysis.
Embodiment
The embodiment of the disclosure is described in detail below in conjunction with attached drawing.It should be appreciated that this place is retouched
The embodiment stated is only used for describing and explaining the disclosure, is not limited to the disclosure.
Referring to Fig. 1, the flow diagram of disclosure data analysing method is shown.This method may comprise steps of：
Step 101, the dimensional information of multidimensional data list is obtained.
Step 102, according to the dimensional information, polymerization processing is carried out to the multidimensional data list, generates the multidimensional
The corresponding tree of data form, the leaf node in the tree are list after polymerization, and list after the polymerization
Dimension number successively successively decrease from root node to leaf node direction.
Step 103, data analysis is carried out for the node in the tree, obtains data results.
When disclosure scheme carries out multidimensional data analysis, it can be generated based on the dimensional information that multidimensional data list has
Tree, by the node in tree, represents the form data under different dimensions, in this way, actual number can be combined
According to analysis demand, corresponding node is determined in tree, and data analysis is carried out to the form data that node represents, is obtained
To corresponding data results.Disclosure scheme, on the one hand, whole table will be traveled through without each data analyses of such as ROLAP,
Help to lift data analyzing speed；On the other hand, data analysis dimension increase, can be presented as level, the section of tree
The problem of change of point is not in the explosion of MOLAP dimensions.
For example, multidimensional data list is 4 dimension sales volume tables, can include 4 company, area, product, month dimension letters
Breath.With reference to disclosure scheme, the tree of the layering of dimension shown in Fig. 2 can be constructed for the multidimensional data list.By Fig. 2
Understand, root node can represent multidimensional data list, and each leaf node represents list after a polymerization, brother of node table respectively
Single dimension number is identical, and from root node to leaf node direction, the dimension number of node lists at different levels is successively successively decreased, such as
This, by the tree, can cover all possible dimension combination of multidimensional data list.When need carry out data analysis
When, the list of respective nodes expression can be obtained, data analysis is carried out, for example, it is desired to when analyzing 4 dimension sales volume table, can read
The corresponding list of root node carries out data analysis；Or, it is necessary to when analyzing the 3-dimensional list of company's area product, can be read
The corresponding list of one layer of leftmost leaf node carries out data analysis.Data analysis process can be found in correlation technique, herein not
It is described in detail.
As a kind of example, disclosure scheme can generate the corresponding tree of multidimensional data list in the following manner：Will
The multidimensional data list is determined as the root node of the tree；The leaf in the tree is obtained in the following way
Child node：The dimensional information of this grade of node is determined according to the dimensional information of superior node, and the list of superior node is gathered
Conjunction is handled, and obtains list after the polymerization of this grade of node, the dimensional information of the bottom leaf node of the tree is 0 dimension
Degree.
That is, disclosure scheme can be handled by polymerization, obtain subtracting the list after dimension, and correspond to tree-shaped knot
Leaf node in structure, polymerize processing realizes that process can be found in correlation technique, is not detailed herein.Still tieed up with act 4 above
Exemplified by sales volume table, after polymerization obtains the 3-dimensional list in regional product month, the list can be corresponded to tree first layer most
The leaf node on the right.
As a kind of example, the list mentioned above to superior node carries out polymerization processing, it is possible to understand that ground, if on
Level node is root node, then can carry out polymerization processing to multidimensional data list, obtain list after the polymerization of this grade of node；On if
Level node is leaf node, then can carry out polymerization processing to list after the polymerization of the leaf node, obtain the polymerization of this grade of node
List afterwards.
It is to be appreciated that the tree in disclosure scheme, except root node needs to carry out data point according to list details
Outside analysis, the leaf node of remaining level, can polymerize to obtain the list of this grade of node by the list of superior node, relatively logical
The list that list details calculate this grade of node is crossed, calculation amount can be greatly decreased in disclosure scheme, help to improve data analysis speed
Degree.
In addition, understanding as shown in Figure 2, for some leaf node, can polymerize to obtain by multiple superior nodes, it is right
In order to further reduce calculation amount, data analyzing speed should be improved, for the node of list after having been polymerize, sheet in this
Open scheme can be not repeated to calculate.For example, be directed to the leftmost leaf node of the second layer, i.e. the 2 dimension table lists in company area
For, 3-dimensional list, the 3-dimensional list in company's regional month that can be by company's area product, obtain after carrying out polymerization processing, if
It has polymerize to obtain the 2 dimension table lists in company area by the 3-dimensional list of company's area product, then can not have recycled company's regional month
3-dimensional list compute repeatedly the 2 dimension table lists in company area.
Below to the process of generation tree in disclosure scheme, it is explained.
As a kind of example, the corresponding tree of multidimensional data list can be successively built.Sales volume is tieed up with act 4 above
Exemplified by table, it can include：
(1) 4 dimension sales volume tables are determined as to the root node of tree.
(2) dimension-reduction treatment is carried out to the dimensional information of root node, the dimensional information of first layer leaf node can be obtained, from
The dimensional information of each leaf node of from left to right is followed successively by：Company's area product, company's regional month, Products month, area
Product month；Then polymerization processing is carried out to 4 dimension sales volume tables of root node, 4 leaf nodes of first layer can be obtained each
List after corresponding polymerization.
(3) on the basis of first layer leaf node, the dimension of second layer leaf node can be obtained by dimension-reduction treatment
Information, from left to right the dimensional information of each leaf node be followed successively by：Company area, Products, regional product, company's month,
Regional month, product month；Then polymerization processing is carried out to first layer leaf node, 6 leaf sections of the second layer can be obtained
List after the corresponding polymerization of point.For example, can be to the 3-dimensional of the 3-dimensional list of company's area product or company's regional month
List carries out polymerization processing, obtains the 2 dimension table lists in company area, is no longer lifted herein for other leaf nodes of the second layer
Example explanation.
(4) according to introduction made above, can also successively build tree third layer and the 4th layer, until obtaining the
After the corresponding polymerization of leaf node of four layer of 0 dimension untill list.Detailed process can refer to introduction made above, no longer lift herein
Example explanation.
So far, the corresponding tree of 4 dimension sales volume tables can be generated, and obtains the corresponding table of each node in tree
It is single.
As a kind of example, it is corresponding tree-shaped that multidimensional data list can also be built by way of depth-first traversal
Structure.Referring to Fig. 3, show the flow diagram that tree is built in the disclosure, may comprise steps of：
Step 201, higher level's present node is determined from the superior node, to the N of higher level's present node
A dimensional information carries out dimension-reduction treatment, obtains the dimensional information of this grade of node, and the dimensional information of described level node is (N-
1) a dimension.
Step 202, this grade of present node is determined from described level node, judge in the tree whether
List after polymerization including described level present node.
Step 203, if the tree includes list after the polymerization of described level present node, judge described in
(N-1) whether a dimension is 0 dimension.
Step 204, if (N-1) a dimension is 0 dimension, returned from described level node to the root node direction
Trace back, obtained until traversal in the tree after the polymerization of all leaf nodes untill list.
By taking sales volume table is tieed up in act 4 above as an example, in order to simplify description, company can be expressed as to A, area is expressed as B, production
Product are expressed as C, month is expressed as D, form tree shown in Fig. 4.If obtained successively by depth-first traversal mode
BCD nodes, CD nodes, D nodes polymerization after list, at this time to continue extreme saturation, i.e. higher level's present node is D
Node, the node have 1 dimensional information, after carrying out dimension-reduction treatment, it may be determined that go out leaf of this grade of node for 10 dimension
Node, if having calculated list after the polymerization of the leaf node of 0 dimension before, no longer needs to repeat polymerization to calculate.
The leaf node of 0 dimension is traversed, shows that the path of the tree rightmost side has stepped through the leaf node of the bottom, subsequently
It can recall from the leaf node of 0 dimension to root node direction, until having traveled through all leaf nodes in tree, to obtain the final product
Untill list after the corresponding polymerization of each leaf node.It is to be appreciated that in this example, can be from the leaf node of 0 dimension
C nodes are traced back to, and after list after obtaining the corresponding polymerization of C nodes, continues up and dates back BC nodes or BD nodes,
Detailed process, which can be found in, hereafter to be introduced, and wouldn't be described in detail herein.
As a kind of example, if step 202 judges not include in the tree the poly- of described level present node
List after conjunction, then can carry out polymerization processing to the list of higher level's present node, obtain the polymerization of described level present node
List afterwards, then perform (N-1) a dimension the step of whether being 0 dimension described in judgement.
In disclosure scheme, list after the polymerization of this grade of present node is not included in tree, it can be understood as, also not
List after the polymerization of this grade of present node is calculated.With reference to examples cited above, i.e., do not obtain 0 dimension leaf node it is poly-
List after conjunction, corresponding to this, can carry out polymerization processing using list after the polymerization of D nodes, obtain the leaf node of 0 dimension
List after polymerization, then recalls, detailed process, which also can be found in hereafter to do, to be situated between from the leaf node of 0 dimension to root node direction again
Continue, wouldn't be described in detail herein.
As a kind of example, if step 203 judges that described (N-1) a dimension is not 0 dimension, can continue to save to subordinate
Point carries out depth-first traversal, and detailed process can be presented as：
Dimension-reduction treatment is carried out to (N-1) a dimensional information of described level present node, obtains the dimension letter of downstream site
Breath, and the dimensional information of the downstream site is (N-2) a dimension；Determine that a subordinate is current from the downstream site
Node, judges in the tree whether to include list after the polymerization of subordinate's present node；If the tree
Include list after the polymerization of subordinate's present node, then judge described in (N-2) a dimension whether be 0 dimension；It is if described
(N-2) a dimension is 0 dimension, then recalls from the downstream site to the root node direction, until traversal obtain it is described tree-shaped
In structure after the polymerization of all leaf nodes untill list.
That is, if this grade of node is not the leaf node of the tree bottom, can continue to carry out downwards
Depth-first traversal, is returned after traversing the leaf node of the bottom, then from the leaf node of the bottom to root node direction
Trace back.
By taking sales volume table is tieed up in act 4 above as an example, the process of tree shown in disclosure scheme constructs Fig. 4 is carried out below
Illustrate.
(1) ABCD nodes are determined as to the root node of tree, and ABCD nodes correspond to 4 dimension sales volume tables.
(2) root node is determined as higher level's present node, dimension-reduction treatment is carried out to the dimensional information of root node, can be obtained
The dimensional information of this grade of node, i.e. first layer leaf node, from left to right the dimensional information of each leaf node be followed successively by：ABC、
ABD、ACD、BCD。
(3) a kind of example is used as, BCD nodes can be determined as to this grade of present node, if it is determined that not obtaining BCD also at this time
List after the polymerization of node, then can carry out polymerization processing to 4 dimension sales volume tables of ABCD nodes, obtain table after the polymerization of BCD nodes
It is single.
(4) through judging, BCD nodes are not belonging to the leaf node of 0 dimension, i.e., are not the bottom leaf sections of tree
Point, therefore dimension-reduction treatment can be carried out to the dimensional information of BCD nodes, obtain the dimension letter of downstream site, i.e. second layer leaf node
Breath, the dimensional information of each leaf node is followed successively by from left to right：BC、BD、CD.
(5) a kind of example is used as, CD nodes can be determined as to subordinate's present node, if it is determined that not obtaining CD sections also at this time
List after the polymerization of point, then can carry out polymerization processing by list after the polymerization to BCD nodes, obtain list after the polymerization of CD nodes.
(6) through judging, CD nodes are also not belonging to the leaf node of 0 dimension, therefore the dimensional information of CD nodes can be dropped
Dimension processing, obtains the dimensional information of third layer leaf node, the dimensional information of each leaf node is followed successively by from left to right：C、D.
(7) a kind of example is used as, D nodes can be determined as to the present node of third layer, if it is determined that not obtaining D also at this time
List after the polymerization of node, then can carry out polymerization processing by list after the polymerization to CD nodes, obtain list after the polymerization of D nodes.
(8) through judging, D nodes are also not belonging to the leaf node of 0 dimension, therefore can carry out dimensionality reduction to the dimensional information of D nodes
Processing, obtains the dimensional information of the 4th layer of leaf node.In this example, the 4th layer of leaf node is the leaf of the tree bottom
The leaf node of child node, i.e. 0 dimension.
(9) a kind of example is used as, the leaf node of 0 dimension can be determined as to the 4th layer of present node, if it is determined that this
When do not obtain 0 dimension also leaf node polymerization after list, then can carry out polymerization processing by list after the polymerization to D nodes, obtain
List after to the polymerization of the leaf node of 0 dimension.
(10) through above-mentioned steps, for the individual path of the rightmost side, the leaf of the tree bottom is had stepped through
Child node, at this point it is possible to successively recall upwards since the leaf node of 0 dimension.In this example, third layer can be first traced back to
Leaf node, i.e. C nodes, then can list after the polymerization to CD nodes if it is determined that do not obtain list after the polymerizations of C nodes also at this time
Polymerization processing is carried out, obtains list after the polymerization of C nodes.So far, the third layer leaf node determined by CD nodes is time
Go through and finish, backtracking can be continued up.
(11) in this example, second layer leaf node can be traced back to, at this time, the second layer leaf determined by BCD nodes
In child node, there are BC nodes and BD nodes not to traverse, can therefrom select one at random as the node recalled upwards, example
It such as may be selected to trace back to BD nodes.If it is determined that do not obtain list after the polymerizations of BD nodes also at this time, then can be to the polymerization of BCD nodes
List carries out polymerization processing afterwards, obtains list after the polymerization of BD nodes.
(12) in this example, follow-up ergodic process can have various ways, below in two ways exemplified by illustrate
Explanation.
Mode one
Dimension-reduction treatment is carried out to the dimensional information of BD nodes, obtains subordinate's leaf node with following dimensional information：B、
D.For D nodes, list after the polymerization of D nodes has been calculated above, therefore can be not repeated to calculate；Come for B node
Say, polymerization processing can be carried out by list after the polymerization to BD nodes, obtain list after the polymerization of B node.In view of under B node
Level leaf node be 0 dimension leaf node, and above calculated 0 dimension leaf node polymerization after list, therefore
It can stop traveling through downwards for B node, but trace back to the BC nodes in second layer leaf node.In this example, tree-shaped knot
Do not include list after the polymerization of BC nodes in structure also, therefore polymerization processing can be carried out by list after the polymerization to BCD nodes, obtain BC sections
List after the polymerization of point.It is B node and C nodes in view of the downstream site obtained according to the dimensional information of BC nodes, and above
List after the polymerization of the two nodes has been calculated respectively, therefore can also stop traveling through downwards for BC nodes.
Mode two
For second layer leaf node, if it is determined that not obtaining list after the polymerizations of BC nodes also at this time, first BCD can be saved
List carries out polymerization processing after the polymerization of point, obtains list after the polymerization of BC nodes.Then the dimension based on BD nodes, BC nodes again
Information is spent, the B node, C nodes, D nodes of subordinate is determined, for D nodes, has calculated the polymerization of D nodes above
List afterwards, therefore can be not repeated to calculate；For B node, list it can carry out after the polymerization to BD nodes or BC nodes
Polymerization is handled, and obtains list after the polymerization of B node；For C nodes, list it can polymerize after the polymerization to BC nodes
Processing, obtains list after the polymerization of C nodes.For B node, C nodes, the subordinate's leaf node of the two is 0
The leaf node of dimension, due to list after the polymerization for the leaf node for having calculated 0 dimension above, therefore is saved for B node, C
Point can stop traveling through downwards.
In conclusion though which kind of mode is follow-up ergodic process use, according to the depth-first traversal mode of the disclosure,
Through a series of processing above, it is only necessary to load the list of BCD nodes, BC nodes, BD nodes, CD nodes, B sections can be calculated
List after point, C nodes, D nodes, the corresponding polymerization of the leaf node of 0 dimension.
(13) in this example, in the first layer leaf node determined by ABCD nodes, also have ABC nodes, ABD nodes and
ACD nodes do not traverse, can therefrom select a node to carry out depth-first traversal at random, and then calculate in tree
List after the corresponding polymerization of other leaf nodes.
For example, ACD nodes can be selected to carry out depth-first traversal, that is to say, that tie up sales volume to the 4 of ABCD nodes
Table carries out polymerization processing, obtains after the polymerization of ACD nodes after list, according still further to introduction made above, calculating based on ACD nodes
List after to AC nodes, AD nodes, the corresponding polymerization of A nodes.
For example, it is also an option that ABD nodes carry out depth-first traversal, that is to say, that 4 dimensions of ABCD nodes are sold
Scale carries out polymerization processing, obtains after the polymerization of ABD nodes after list, according still further to introduction made above, is calculated based on ABD nodes
Obtain list after the corresponding polymerization of AB nodes.
For example, it is also an option that ABC nodes carry out depth-first traversal, that is to say, that can be to the 4 of ABCD nodes
Dimension sales volume table carries out polymerization processing, obtains list after the polymerization of ABC nodes.
Above-mentioned one node progress depth-first traversal of random selection realizes process, can refer to introduction made above, this
Place repeats no more, it is possible to understand that ground, for the node of list after having been polymerize, can be not repeated to calculate.
So far, the corresponding tree of 4 dimension sales volume tables can be generated, and obtains the corresponding table of each node in tree
It is single.
As a kind of example, after the corresponding tree of disclosure schemes generation multidimensional data list, if desired more
, that is, there is incremental data, then can obtain the dimensional information of incremental data list in new multidimensional data list, and according to incremental data table
Single dimensional information, carries out polymerization processing to the incremental data list, generates the corresponding tree-shaped knot of the incremental data list
Structure；Then, to the phase in the corresponding tree of the multidimensional data list, the corresponding tree of the incremental data list
Same node, carries out list merging, obtains new tree.After obtaining new tree, when needing to carry out data analysis,
The list of respective nodes expression can be obtained from new tree, analysis obtains new data results.
The process of the corresponding tree of incremental data list is generated, is referred to introduction made above, it is no longer superfluous herein
State.It is to be appreciated that the dimensional information of incremental data list, the dimensional information of multidimensional data list, the two can be all identical,
Can also part it is identical, disclosure scheme can be not specifically limited this, can be by practical application request depending on.No matter the two has
Several identical dimensional informations, when merging processing, find same node point in two trees, that is,
Say, data merging can be carried out between the list with identical dimensional combination.Such incremental data processing scheme, not only facilitates
Data analyzing speed is improved, also contributes to the accuracy of data analysis.
Referring to Fig. 5, the structure diagram of disclosure data analysis set-up is shown.Described device includes：
Dimensional information acquisition module 301, for obtaining the dimensional information of multidimensional data list；
Tree generation module 302, for according to the dimensional information, being carried out to the multidimensional data list at polymerization
Reason, generates the corresponding tree of the multidimensional data list, and the leaf node in the tree is list after polymerization, and
The dimension number of list is successively successively decreased from root node to leaf node direction after the polymerization；
Data analysis module 303, for carrying out data analysis for the node in the tree, obtains data analysis
As a result.
Alternatively, the tree generation module includes：
Root node determining module, for the multidimensional data list to be determined as to the root node of the tree；
Leaf node obtains module, for obtaining the leaf node in the tree in the following way：According to upper
The dimensional information of level node determines the dimensional information of this grade of node, and carries out polymerization processing to the list of superior node, obtains this
List after the polymerization of level node, the dimensional information of the bottom leaf node of the tree is 0 dimension.
Alternatively, the dimensional information of the superior node is N number of dimension, and the leaf node, which obtains module, to be included：
Dimension-reduction treatment module, for determining higher level's present node from the superior node, works as the higher level
N number of dimensional information of front nodal point carries out dimension-reduction treatment, obtains the dimensional information of this grade of node, and the dimension letter of described level node
Breath is (N-1) a dimension；
First judgment module, for determining this grade of present node from described level node, judges described tree-shaped
Whether the polymerization of described level present node after list is included in structure；
Second judgment module, after the polymerization for including described level present node in the tree during list,
Whether (N-1) a dimension described in judgement is 0 dimension；
Backtracking module, for when (N-1) a dimension is 0 dimension, from described level node to the root node side
To backtracking, obtained until traversal in the tree after the polymerization of all leaf nodes untill list.
Alternatively, the leaf node obtains module and further includes：
It polymerize processing module, list after the polymerization for not including described level present node in the tree
When, polymerization processing is carried out to the list of higher level's present node, obtains list after the polymerization of described level present node, then lead to
Know whether (N-1) a dimension described in the second judgment module judgement is 0 dimension.
Alternatively, the dimension-reduction treatment module, is additionally operable to when (N-1) a dimension is not 0 dimension, to described level
(N-1) of present node a dimensional information carries out dimension-reduction treatment, obtains the dimensional information of downstream site, and the downstream site
Dimensional information is (N-2) a dimension；
First judgment module, is additionally operable to determine subordinate's present node from the downstream site, judges institute
State in tree list after the polymerization for whether including subordinate's present node；
Second judgment module, list after the polymerization for including subordinate's present node in the tree
When, whether (N-2) a dimension described in judgement is 0 dimension；
The backtracking module, is additionally operable to when (N-2) a dimension is 0 dimension, from the downstream site to described
Node direction is recalled, and is obtained until traveling through in the tree after the polymerization of all leaf nodes untill list.
Alternatively, described device further includes：
Increment tree generation module, for the dimensional information according to incremental data list, to the incremental data table
Polymerization processing is singly carried out, generates the corresponding tree of the incremental data list；
List merging module, for the corresponding tree of the multidimensional data list and the incremental data list pair
Same node point in the tree answered, carries out list merging, obtains new tree；
The then data analysis module, for carrying out data analysis for the node in the new tree, obtains
New data results.
On the device in above-described embodiment, wherein modules perform the concrete mode of operation in related this method
Embodiment in be described in detail, explanation will be not set forth in detail herein.
Fig. 6 is the block diagram of a kind of electronic equipment 400 according to an exemplary embodiment, which is used for
Realize data analysis.As shown in fig. 6, the electronic equipment 400 can include：Processor 401, memory 402, multimedia component
403, input/output (I/O) interface 404, and communication component 405.
Wherein, processor 401 is used for the integrated operation for controlling the electronic equipment 400, to complete above-mentioned data analysis side
All or part of step in method.Memory 402 is used to store various types of data to support the behaviour in the electronic equipment 400
To make, these data can for example include the instruction of any application program or method for being operated on the electronic equipment 400, with
And the relevant data of application program, such as contact data, the message of transmitting-receiving, picture, audio, video etc..The memory 402
It can be realized by any kind of volatibility or non-volatile memory device or combinations thereof, such as static random-access is deposited
Reservoir (Static Random Access Memory, abbreviation SRAM), electrically erasable programmable read-only memory
(Electrically Erasable Programmable Read-Only Memory, abbreviation EEPROM), erasable programmable
Read-only storage (Erasable Programmable Read-Only Memory, abbreviation EPROM), programmable read only memory
(Programmable Read-Only Memory, abbreviation PROM), and read-only storage (Read-Only Memory, referred to as
ROM), magnetic memory, flash memory, disk or CD.Multimedia component 403 can include screen and audio component.Wherein
Screen for example can be touch-screen, and audio component is used to export and/or input audio signal.For example, audio component can include
One microphone, microphone are used to receive external audio signal.The received audio signal can be further stored in storage
Device 402 is sent by communication component 405.Audio component further includes at least one loudspeaker, for exports audio signal.I/O
Interface 404 provides interface between processor 401 and other interface modules, other above-mentioned interface modules can be keyboard, mouse,
Button etc..These buttons can be virtual push button or entity button.Communication component 405 is used for the electronic equipment 400 and other
Wired or wireless communication is carried out between equipment.Wireless communication, such as Wi-Fi, bluetooth, near-field communication (Near Field
Communication, abbreviation NFC), 2G, 3G or 4G, or one or more of combinations in them, therefore the corresponding communication
Component 405 can include：Wi-Fi module, bluetooth module, NFC module.
In one exemplary embodiment, electronic equipment 400 can be by one or more application application-specific integrated circuit
(Application Specific Integrated Circuit, abbreviation ASIC), digital signal processor (Digital
Signal Processor, abbreviation DSP), digital signal processing appts (Digital Signal Processing Device,
Abbreviation DSPD), programmable logic device (Programmable Logic Device, abbreviation PLD), field programmable gate array
(Field Programmable Gate Array, abbreviation FPGA), controller, microcontroller, microprocessor or other electronics member
Part is realized, for performing above-mentioned data analysing method.
In a further exemplary embodiment, a kind of computer-readable recording medium including programmed instruction, example are additionally provided
Such as include the memory 402 of programmed instruction, above procedure instruction can be performed with completion by the processor 401 of electronic equipment 400
The data analysing method stated.
The preferred embodiment of the disclosure is described in detail above in association with attached drawing, still, the disclosure is not limited to above-mentioned reality
The detail in mode is applied, in the range of the technology design of the disclosure, a variety of letters can be carried out to the technical solution of the disclosure
Monotropic type, these simple variants belong to the protection domain of the disclosure.
It is further to note that each particular technique feature described in above-mentioned embodiment, in not lance
In the case of shield, can be combined by any suitable means, in order to avoid unnecessary repetition, the disclosure to it is various can
The combination of energy no longer separately illustrates.
In addition, it can also be combined between a variety of embodiments of the disclosure, as long as it is without prejudice to originally
Disclosed thought, it should equally be considered as disclosure disclosure of that.
Claims (10)
- A kind of 1. data analysing method, it is characterised in that including：Obtain the dimensional information of multidimensional data list；According to the dimensional information, polymerization processing is carried out to the multidimensional data list, the multidimensional data list is generated and corresponds to Tree, the leaf node in the tree is list after polymerization, and after the polymerization list dimension number from Root node successively successively decreases to leaf node direction；Data analysis is carried out for the node in the tree, obtains data results.
- 2. according to the method described in claim 1, it is characterized in that, described according to the dimensional information, to the multidimensional data List carries out polymerization processing, generates the corresponding tree of the multidimensional data list, including：The multidimensional data list is determined as to the root node of the tree；The leaf node in the tree is obtained in the following way：The dimensional information of this grade of node is determined according to the dimensional information of superior node, and the list of superior node is carried out at polymerization Reason, obtains list after the polymerization of this grade of node, the dimensional information of the bottom leaf node of the tree is 0 dimension.
- It is 3. described according to the method described in claim 2, it is characterized in that, the dimensional information of the superior node is N number of dimension The dimensional information of this grade of node is determined according to the dimensional information of superior node, and polymerization processing is carried out to the list of superior node, List after the polymerization of this grade of node is obtained, including：Higher level's present node is determined from the superior node, to N number of dimensional information of higher level's present node into Row dimension-reduction treatment, obtains the dimensional information of this grade of node, and the dimensional information of described level node is (N-1) a dimension；A this grade of present node is determined from described level node, judges whether include described level in the tree List after the polymerization of present node；If the tree includes list after the polymerization of described level present node, judge described in (N-1) a dimension Whether it is 0 dimension；If (N-1) a dimension is 0 dimension, recall from described level node to the root node direction, until traversal Obtain in the tree after the polymerization of all leaf nodes untill list.
- 4. according to the method described in claim 3, it is characterized in that, the method further includes：If do not include list after the polymerization of described level present node in the tree, to higher level's present node List carry out polymerization processing, obtain list after the polymerization of described level present node, then perform a described in the judgement (N-1) The step of whether dimension is 0 dimension.
- 5. according to the method described in claim 3, it is characterized in that, the method further includes：If (N-1) a dimension is not 0 dimension, (N-1) a dimensional information of described level present node is dropped Dimension processing, obtains the dimensional information of downstream site, and the dimensional information of the downstream site is (N-2) a dimension；Subordinate's present node is determined from the downstream site, judges whether include the subordinate in the tree List after the polymerization of present node；If the tree includes list after the polymerization of subordinate's present node, judge described in (N-2) a dimension Whether it is 0 dimension；If (N-2) a dimension is 0 dimension, recall from the downstream site to the root node direction, until traversal Obtain in the tree after the polymerization of all leaf nodes untill list.
- 6. method according to any one of claims 1 to 5, it is characterised in that the method further includes：According to the dimensional information of incremental data list, polymerization processing is carried out to the incremental data list, generates the incremental number According to the corresponding tree of list；To identical in the corresponding tree of multidimensional data list tree corresponding with the incremental data list Node, carries out list merging, obtains new tree；Then the node being directed in the tree carries out data analysis, obtains data results, including：Data analysis is carried out for the node in the new tree, obtains new data results.
- 7. a kind of data analysis set-up, it is characterised in that described device includes：Dimensional information acquisition module, for obtaining the dimensional information of multidimensional data list；Tree generation module, for according to the dimensional information, carrying out polymerization processing to the multidimensional data list, generating The corresponding tree of the multidimensional data list, the leaf node in the tree is list after polymerization, and described poly- The dimension number of list is successively successively decreased from root node to leaf node direction after conjunction；Data analysis module, for carrying out data analysis for the node in the tree, obtains data results.
- 8. device according to claim 7, it is characterised in that the tree generation module includes：Root node determining module, for the multidimensional data list to be determined as to the root node of the tree；Leaf node obtains module, for obtaining the leaf node in the tree in the following way：Saved according to higher level The dimensional information of point determines the dimensional information of this grade of node, and carries out polymerization processing to the list of superior node, obtains this grade of section List after the polymerization of point, the dimensional information of the bottom leaf node of the tree is 0 dimension.
- 9. a kind of computer-readable recording medium, is stored thereon with computer program, it is characterised in that the program is held by processor The step of any one of claim 1 to 6 the method is realized during row.
- 10. a kind of electronic equipment, it is characterised in that including：Computer-readable recording medium described in claim 9；AndOne or more processor, for performing the program in the computer-readable recording medium.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710980654.9A CN108009193A (en) | 2017-10-19 | 2017-10-19 | Data analysing method and device, storage medium, electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710980654.9A CN108009193A (en) | 2017-10-19 | 2017-10-19 | Data analysing method and device, storage medium, electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108009193A true CN108009193A (en) | 2018-05-08 |
Family
ID=62051018
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710980654.9A Pending CN108009193A (en) | 2017-10-19 | 2017-10-19 | Data analysing method and device, storage medium, electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108009193A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110309496A (en) * | 2019-06-24 | 2019-10-08 | 招商局金融科技有限公司 | Data summarization method, electronic device and computer readable storage medium |
| CN110399534A (en) * | 2019-07-31 | 2019-11-01 | 京信通信系统（中国）有限公司 | Terminal capabilities report form generation method, device, equipment and storage medium |
| CN110781188A (en) * | 2019-10-23 | 2020-02-11 | 泰康保险集团股份有限公司 | Form information processing method and device, electronic equipment and storage medium |
| CN111274243A (en) * | 2020-01-07 | 2020-06-12 | 北京唐颐惠康生物医学技术有限公司 | Information processing method and system based on multi-dimensional model form |
| CN111782658A (en) * | 2020-07-08 | 2020-10-16 | 支付宝(杭州)信息技术有限公司 | Cross table processing method, cross table processing device, electronic equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030126143A1 (en) * | 2001-06-12 | 2003-07-03 | Nicholas Roussopoulos | Dwarf cube architecture for reducing storage sizes of multidimensional data |
| CN105183917A (en) * | 2015-10-15 | 2015-12-23 | 国家电网公司 | Multi-dimensional analysis method for multi-level storage data |
| US20160048572A1 (en) * | 2014-08-14 | 2016-02-18 | Intellicus Technologies Pvt. Ltd. | Building a Distributed Dwarf Cube using Mapreduce Technique |
| CN106372114A (en) * | 2016-08-23 | 2017-02-01 | 电子科技大学 | Big data-based online analytical processing system and method |
-
2017
- 2017-10-19 CN CN201710980654.9A patent/CN108009193A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030126143A1 (en) * | 2001-06-12 | 2003-07-03 | Nicholas Roussopoulos | Dwarf cube architecture for reducing storage sizes of multidimensional data |
| US20160048572A1 (en) * | 2014-08-14 | 2016-02-18 | Intellicus Technologies Pvt. Ltd. | Building a Distributed Dwarf Cube using Mapreduce Technique |
| CN105183917A (en) * | 2015-10-15 | 2015-12-23 | 国家电网公司 | Multi-dimensional analysis method for multi-level storage data |
| CN106372114A (en) * | 2016-08-23 | 2017-02-01 | 电子科技大学 | Big data-based online analytical processing system and method |
Non-Patent Citations (1)
| Title |
|---|
| 赵艳艳: "基于Hadoop的联机分析处理系统关键技术研究", 《万方数据知识服务平台》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110309496A (en) * | 2019-06-24 | 2019-10-08 | 招商局金融科技有限公司 | Data summarization method, electronic device and computer readable storage medium |
| CN110309496B (en) * | 2019-06-24 | 2023-08-22 | 招商局金融科技有限公司 | Data summarizing method, electronic device and computer readable storage medium |
| CN110399534A (en) * | 2019-07-31 | 2019-11-01 | 京信通信系统（中国）有限公司 | Terminal capabilities report form generation method, device, equipment and storage medium |
| CN110399534B (en) * | 2019-07-31 | 2022-03-25 | 京信网络系统股份有限公司 | Terminal performance report generation method, device, equipment and storage medium |
| CN110781188A (en) * | 2019-10-23 | 2020-02-11 | 泰康保险集团股份有限公司 | Form information processing method and device, electronic equipment and storage medium |
| CN110781188B (en) * | 2019-10-23 | 2022-09-02 | 泰康保险集团股份有限公司 | Form information processing method and device, electronic equipment and storage medium |
| CN111274243A (en) * | 2020-01-07 | 2020-06-12 | 北京唐颐惠康生物医学技术有限公司 | Information processing method and system based on multi-dimensional model form |
| CN111274243B (en) * | 2020-01-07 | 2023-05-23 | 北京唐颐惠康生物医学技术有限公司 | Information processing method and system based on multidimensional model form |
| CN111782658A (en) * | 2020-07-08 | 2020-10-16 | 支付宝(杭州)信息技术有限公司 | Cross table processing method, cross table processing device, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108009193A (en) | Data analysing method and device, storage medium, electronic equipment | |
| CN108364085B (en) | Takeout delivery time prediction method and device | |
| US20170300546A1 (en) | Method and Apparatus for Data Processing in Data Modeling | |
| Manera et al. | Large-scale bias and the inaccuracy of the peak-background split | |
| CN104050972B (en) | Voice signal analytical equipment and voice signal analysis method and program | |
| EP2273431B1 (en) | Model determination system | |
| US20020128805A1 (en) | Model predictive control (MPC) system using DOE based model | |
| CN107357812A (en) | A kind of data query method and device | |
| CN107451894A (en) | Data processing method, device and computer-readable recording medium | |
| CN101556666A (en) | Method, device and auditing system for establishing auditing model | |
| CN110390561B (en) | User-financial product selection tendency high-speed prediction method and device based on momentum acceleration random gradient decline | |
| CN107609201A (en) | A kind of recommended models generation method and relevant apparatus based on commending system | |
| CN105468628B (en) | A kind of sort method and device | |
| CN108805338A (en) | A kind of stable variable determines method, apparatus, server and storage medium | |
| WO2017161646A1 (en) | Method for dynamically selecting optimal model by three-layer association for large data volume prediction | |
| CN110177122A (en) | A kind of method for establishing model and device identifying network security risk | |
| CN107291840A (en) | A kind of user property forecast model construction method and device | |
| CN109919312A (en) | Operation method, device and the DPU of convolutional neural networks | |
| CN103955580B (en) | Parametric Yield of VLSI IC method of estimation based on reliability rule base reasoning | |
| CN108985899A (en) | Recommended method, system and storage medium based on CNN-LFM model | |
| CN109117433A (en) | Index tree object creation method and index method and related device thereof | |
| CN109308303A (en) | A kind of multi-table join Online aggregate method based on Markov chain | |
| CN109543247A (en) | Parameters of Analog Integrated Circuit optimum design method and device based on NSGA- II | |
| CN104915440A (en) | Commodity de-duplication method and system | |
| CN115730738A (en) | Process parameter determination method, device, computer equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180508 |
|
| RJ01 | Rejection of invention patent application after publication |