CN104361134A - Relationship level calculating device and relationship level calculating method - Google Patents
Relationship level calculating device and relationship level calculating method Download PDFInfo
- Publication number
- CN104361134A CN104361134A CN201410750224.4A CN201410750224A CN104361134A CN 104361134 A CN104361134 A CN 104361134A CN 201410750224 A CN201410750224 A CN 201410750224A CN 104361134 A CN104361134 A CN 104361134A
- Authority
- CN
- China
- Prior art keywords
- data
- relationship
- business datum
- level
- collecting
- 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.)
- Granted
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/284—Relational databases
- G06F16/288—Entity relationship models
Abstract
The invention provides a relationship level calculating device which comprises a relationship sequence processing unit, a building level unit and a calculating level unit, wherein the relationship sequence processing unit is used for collecting business data of a to-be-triggered operation and sequencing the data relationship of the collected business data according to a predetermined data relationship priority; the building level unit is used for converting a data structure of the sequenced business data into a data structure required by calculating the hierarchical relationship; the calculating level layer is used for calculating the hierarchical relationship of the data based on the converted data structure. The invention further provides a relationship level calculating method. According to the technical scheme, the relationship level of multiple-object type metadata can be calculated by fully using single-object type metadata and document description type metadata based on the existing relationship level calculating mode, so that a universal and uniform calculating concept which is participated by the multiple-object type metadata and is used for calculating the relationship level is established.
Description
Technical field
The present invention relates to technical field of data processing, particularly, relate to a kind of relational hierarchy calculation element and a kind of relational hierarchy computing method.
Background technology
And for ERP system, put the consumption relation of each product in order, interrupting the circulation occurred in relation, calculate various product level, is all the problem of a core.And when building product relational tree, consider the modality between production consumption relation, material, the secondary products amount that every layer of product for products-tree consumes may be huge, and the time of system processes data is long, influential system fluency, the cost of maintenance system also can improve.
At present, traditional level counter, processing mode utilizes tree ergodic algorithm, range or extreme saturation algorithm, carries out the upper each node traffic logic of process tree again according to its overlying relation.And data in enterprise higher-dimension and sparse often, relative to the products-tree of the relation of consumption, relation between product there will be the situation that circulation consumes mutually, at this moment when building products-tree level, the amount of product subordinate consumption material is likely the growth of geometry level, the instantaneous surge of charge capacity of system, cause system process abnormal slow, or internal memory overflows.
Therefore, need a kind of new relational hierarchy computing technique, can on existing relational hierarchy account form basis, make full use of single object genre metadata and document to describe the relational hierarchy that type completes multi-object genre metadata and calculate, set up general, unified calculation thinking that relational hierarchy that multi-object genre metadata participates in calculates.
Summary of the invention
The present invention is just based on the problems referred to above, propose a kind of new relational hierarchy computing technique, can on existing relational hierarchy account form basis, make full use of single object genre metadata and document to describe the relational hierarchy that type completes multi-object genre metadata and calculate, set up general, unified calculation thinking that relational hierarchy that multi-object genre metadata participates in calculates.
In view of this, the present invention proposes a kind of relational hierarchy calculation element, comprising: relation sequential processes unit, for collecting the business datum of operation to be triggered; According to the data relationship priority preset, the data relationship of the business datum of collecting is sorted; Build hierarchy unit, for the data structure by the business datum after sequence, be converted into the data structure needed for computation levels relation; Computation layer sub-cell, for based on the data structure after conversion, calculates the hierarchical relationship of data.In this technical scheme, the level with the many precedence relationships of reticulate texture can be built, promote the processing power of mass data, reduce system response time, improve the accuracy that data export.
In technique scheme, preferably, this relational hierarchy calculation element also comprises: circulation chain rupture unit, for based on the data structure after conversion, processes the situation of the hierarchical relationship appearance circulation of business datum; And described computation layer sub-cell, for based on the data structure after conversion and the result hierarchical relationship of business datum being occurred to the situation of circulation, calculates the hierarchical relationship of data.In this technical scheme, by intelligent chain rupture process, by reticulate texture, carrying out the structure of level according to many precedence relationships, ensureing each node without the need to being replicated in computation process, significantly the optimized amount processing time.
In technique scheme, preferably, described relation sequential processes unit, specifically comprises: business datum collection module, for collecting the business datum of operation to be triggered; Data relationship order module, for according to the data relationship priority preset, sorts to the data relationship of the business datum of collecting.In this technical scheme, support to arrange priority in relation data, namely there is multiple relation data, according to priority minimum data relationship, carry out chain rupture process.
In technique scheme, preferably, the operation of the data relationship priority that described relation sequential processes unit is preset, comprises further: the many precedence relationships level building data based on reticulate texture.In this technical scheme, optimize traditional paper mulberry method, carry out the structure of level according to many precedence relationships, in reticulate texture, just can express the hierarchical relationship of all nodes, significantly optimized for ten million rank data volume processing time.
In technique scheme, preferably, the described operation building many precedence relationships level of data based on reticulate texture, further comprise: the multipriority of configuration sorting data, according to the multipriority of configuration, use quick sort data to be sorted, complete the initialization of data; Adopt tree structure, structure level and circulation chain rupture process are carried out to the data that initialization completes.In this technical scheme, break through traditional paper mulberry, greatly reduce the resource consumption in computation process, solve a large amount of system resource of original conventional computing devices consumption thus the problem of the internal memory caused spilling.
According to a further aspect of the invention, also proposed a kind of relational hierarchy computing method, comprising: step 202: the business datum of collecting operation to be triggered; According to the data relationship priority preset, the data relationship of the business datum of collecting is sorted; Step 204: by the data structure of the business datum after sequence, be converted into the data structure needed for computation levels relation; Step 208: based on the data structure after conversion, calculates the hierarchical relationship of data.In this technical scheme, the level with the many precedence relationships of reticulate texture can be built, promote the processing power of mass data, reduce system response time, improve the accuracy that data export.
In technique scheme, preferably, these relational hierarchy computing method also comprise: step 206: based on the data structure after conversion, and the situation of circulation appears in the hierarchical relationship of process business datum; And, described step 208: based on the data structure after conversion and the result hierarchical relationship of business datum being occurred to the situation of circulation, calculate the hierarchical relationship of data.In this technical scheme, by intelligent chain rupture process, by reticulate texture, carrying out the structure of level according to many precedence relationships, ensureing each node without the need to being replicated in computation process, significantly the optimized amount processing time.
In technique scheme, preferably, described step 202, specifically comprises: step 302: the business datum of collecting operation to be triggered; Step 304: according to the data relationship priority preset, sorts to the data relationship of the business datum of collecting.In this technical scheme, support to arrange priority in relation data, namely there is multiple relation data, according to priority minimum data relationship, carry out chain rupture process.
In technique scheme, preferably, the operation of the data relationship priority that described step 202 is preset, comprises further: the many precedence relationships level building data based on reticulate texture.In this technical scheme, optimize traditional paper mulberry method, carry out the structure of level according to many precedence relationships, in reticulate texture, just can express the hierarchical relationship of all nodes, significantly optimized for ten million rank data volume processing time.
In technique scheme, preferably, the described operation building many precedence relationships level of data based on reticulate texture, further comprise: the multipriority of configuration sorting data, according to the multipriority of configuration, use quick sort data to be sorted, complete the initialization of data; Adopt tree structure, structure level and circulation chain rupture process are carried out to the data that initialization completes.In this technical scheme, break through traditional paper mulberry, greatly reduce the resource consumption in computation process, solve a large amount of system resource of original conventional computing devices consumption thus the problem of the internal memory caused spilling.
By above technical scheme, can on existing relational hierarchy account form basis, make full use of single object genre metadata and document to describe the relational hierarchy that type completes multi-object genre metadata and calculate, set up general, unified calculation thinking that relational hierarchy that multi-object genre metadata participates in calculates.
Accompanying drawing explanation
Fig. 1 shows the block diagram of relational hierarchy calculation element according to an embodiment of the invention;
Fig. 2 shows the process flow diagram of relational hierarchy computing method according to an embodiment of the invention;
Fig. 3 shows the process flow diagram of relation sequential processes unit according to an embodiment of the invention;
Fig. 4 shows according to an embodiment of the invention by setting a kind of device to optimize the schematic diagram building and have the performance of reticulate texture many precedence relationships level;
Fig. 5 shows and builds multiple tree structure according to an embodiment of the invention to calculate the process flow diagram of level;
Fig. 6 shows the process flow diagram of traditional calculations tree hierachy process;
Fig. 7 shows according to an embodiment of the invention according to the hierarchy chart that a kind of precedence relationship exports.
Embodiment
In order to more clearly understand above-mentioned purpose of the present invention, feature and advantage, below in conjunction with the drawings and specific embodiments, the present invention is further described in detail.It should be noted that, when not conflicting, the feature in the embodiment of the application and embodiment can combine mutually.
Set forth a lot of detail in the following description so that fully understand the present invention; but; the present invention can also adopt other to be different from other modes described here and implement, and therefore, protection scope of the present invention is not by the restriction of following public specific embodiment.
Fig. 1 shows the block diagram of relational hierarchy calculation element according to an embodiment of the invention.
As shown in Figure 1, relational hierarchy calculation element 100 according to an embodiment of the invention, comprising: relation sequential processes unit 102, for collecting the business datum of operation to be triggered; According to the data relationship priority preset, the data relationship of the business datum of collecting is sorted; Build hierarchy unit 104, for the data structure by the business datum after sequence, be converted into the data structure needed for computation levels relation; Computation layer sub-cell 108, for based on the data structure after conversion, calculates the hierarchical relationship of data.In this technical scheme, the level with the many precedence relationships of reticulate texture can be built, promote the processing power of mass data, reduce system response time, improve the accuracy that data export.
In technique scheme, preferably, this relational hierarchy calculation element also comprises: circulation chain rupture unit 106, for based on the data structure after conversion, processes the situation of the hierarchical relationship appearance circulation of business datum; And computation layer sub-cell 108, for based on the data structure after conversion and the result hierarchical relationship of business datum being occurred to the situation of circulation, calculates the hierarchical relationship of data.In this technical scheme, by intelligent chain rupture process, by reticulate texture, carrying out the structure of level according to many precedence relationships, ensureing each node without the need to being replicated in computation process, significantly the optimized amount processing time.
In technique scheme, preferably, relation sequential processes unit 102, specifically comprises: business datum collection module 1022, for collecting the business datum of operation to be triggered; Data relationship order module 1024, for according to the data relationship priority preset, sorts to the data relationship of the business datum of collecting.In this technical scheme, support to arrange priority in relation data, namely there is multiple relation data, according to priority minimum data relationship, carry out chain rupture process.
In technique scheme, preferably, the operation of the data relationship priority that relation sequential processes unit 102 is preset, comprises: the many precedence relationships level building data based on reticulate texture further.In this technical scheme, optimize traditional paper mulberry method, carry out the structure of level according to many precedence relationships, in reticulate texture, just can express the hierarchical relationship of all nodes, significantly optimized for ten million rank data volume processing time.
In technique scheme, preferably, the operation of many precedence relationships level of data is built based on reticulate texture, further comprise: the multipriority of configuration sorting data, according to the multipriority of configuration, use quick sort data to be sorted, complete the initialization of data; Adopt tree structure, structure level and circulation chain rupture process are carried out to the data that initialization completes.In this technical scheme, break through traditional paper mulberry, greatly reduce the resource consumption in computation process, solve a large amount of system resource of original conventional computing devices consumption thus the problem of the internal memory caused spilling.
Fig. 2 shows the process flow diagram of relational hierarchy computing method according to an embodiment of the invention.
As shown in Figure 2, relational hierarchy computing method according to an embodiment of the invention, comprising: step 202: the business datum of collecting operation to be triggered; According to the data relationship priority preset, the data relationship of the business datum of collecting is sorted; Step 204: by the data structure of the business datum after sequence, be converted into the data structure needed for computation levels relation; Step 208: based on the data structure after conversion, calculates the hierarchical relationship of data.In this technical scheme, the level with the many precedence relationships of reticulate texture can be built, promote the processing power of mass data, reduce system response time, improve the accuracy that data export.
In technique scheme, preferably, these relational hierarchy computing method also comprise: step 206: based on the data structure after conversion, and the situation of circulation appears in the hierarchical relationship of process business datum; And, step 208: based on the data structure after conversion and the result hierarchical relationship of business datum being occurred to the situation of circulation, calculate the hierarchical relationship of data.In this technical scheme, by intelligent chain rupture process, by reticulate texture, carrying out the structure of level according to many precedence relationships, ensureing each node without the need to being replicated in computation process, significantly the optimized amount processing time.
In technique scheme, preferably, as shown in Figure 3, step 202, specifically comprises: step 302: the business datum of collecting operation to be triggered; Step 304: according to the data relationship priority preset, sorts to the data relationship of the business datum of collecting.In this technical scheme, support to arrange priority in relation data, namely there is multiple relation data, according to priority minimum data relationship, carry out chain rupture process.
In technique scheme, preferably, the operation of the data relationship priority that step 202 is preset, comprises further: the many precedence relationships level building data based on reticulate texture.In this technical scheme, optimize traditional paper mulberry method, carry out the structure of level according to many precedence relationships, in reticulate texture, just can express the hierarchical relationship of all nodes, significantly optimized for ten million rank data volume processing time.
In technique scheme, preferably, the operation of many precedence relationships level of data is built based on reticulate texture, further comprise: the multipriority of configuration sorting data, according to the multipriority of configuration, use quick sort data to be sorted, complete the initialization of data; Adopt tree structure, structure level and circulation chain rupture process are carried out to the data that initialization completes.In this technical scheme, break through traditional paper mulberry, greatly reduce the resource consumption in computation process, solve a large amount of system resource of original conventional computing devices consumption thus the problem of the internal memory caused spilling.
Technical scheme of the present invention, specifically provides a kind of relational hierarchy counter supporting multipriority based on reticulate texture, is divided into relation sequential processes unit, builds hierarchy unit, circulation chain rupture unit, computation layer sub-cell.According to technical scheme of the present invention, the processing power of mass data can be promoted, reduce system response time, improve the accuracy that data export.
For prior art Problems existing, technical scheme of the present invention, can build the level with the many precedence relationships of reticulate texture.Technical scheme of the present invention, by intelligent chain rupture process, by reticulate texture, carries out the structure of level according to many precedence relationships, ensure each node without the need to being replicated in computation process, significantly the optimized amount processing time.Technical scheme of the present invention simultaneously, also supports to arrange priority in relation data, namely there is multiple relation data, according to priority minimum data relationship, carry out chain rupture process.This is peerless in product known at present or scheme.
According to project checking, the calculation element that original traditional approach realizes, can produce up to ten million data volumes in computation process, the overall calculation time, more than 10 minutes, even causes internal memory to overflow, and cannot calculate.And technical scheme of the present invention is namely with the time in a few second, just the calculating of level is completed, result of calculation is consistent with the result of calculation that traditional approach realizes, but technical scheme of the present invention breaks through traditional paper mulberry, greatly reduce the resource consumption in computation process, solve a large amount of system resource of original conventional computing devices consumption thus the problem of the internal memory caused spilling.
In the inventive solutions, data in enterprise have the mutual consumption relation of circulation often, when building products-tree, can carry out chain rupture process according to precedence relationship, produce many sub-products-trees, the amount of product subordinate consumption material is likely the growth of geometry level, the instantaneous surge of charge capacity of system, cause system process abnormal slow, or internal memory overflows, technical scheme of the present invention mainly solves problems.
The general structure of technical solution of the present invention, as shown in Figure 4, the present invention is by setting a kind of device to optimize the performance building and have reticulate texture many precedence relationships level.Large data paper mulberry device based on precedence relationship is made up of relation sequential processes unit, structure hierarchy unit, circulation chain rupture unit and computation layer sub-cell.Wherein:
Relation sequential processes unit: this element is responsible for the business datum of trigger action to collect, sorts according to the data relationship of the data relationship priority arranged to input.
Build hierarchy unit: this element is responsible for data structure business datum be converted into needed for computation layer sub-cell.
Circulation chain rupture unit: the situation of circulation appears in the hierarchical relationship of this element process business datum.
Computation layer sub-cell: this element goes out hierarchical relationship according to the Structure Calculation of data.
In the inventive solutions, the technical scheme building many precedence relationships level based on reticulate texture realizes principle:
First, to the multipriority of technical solution of the present invention configuration sorting data, according to this priority, technical scheme of the present invention can use quick sort data to be sorted, and now completes the initialization of data.
Secondly, the data after process are carried out structure level and circulation chain rupture process.Because tree structure has well-bedded characteristic, there will not be the hierarchical relationship of circulation between each node, this just considers how to cut off between node have circulation hierarchical relationship, and technical scheme of the present invention is optimized process to calculating level.
When building the every node layer of tree, first consider whether the node (such as: B) that will hang over this layer has father node, if there is father node (such as: D), then judge whether satisfied two conditions: 1. D is that in the path of leaf node, all nodes comprise B; 2. with B be all child nodes of father node comprise with D be leaf node path in all nodes.If met, prove that B and D exists recurrence relation, Node B of now breaking, if do not met, the direct father node that will hang over this node layer points to B, and this just ensures have in structural drawing and only have unique node.
Finally, technical scheme of the present invention can carry out the calculating of level according to many precedence relationships according to the data triggered.
Illustrating of technical solution of the present invention:
Existing node A, B, C, D, E, F, G, H, the relation between known node is as follows:
A->B、B->D、A->C、E->C、E->D、C->D、D->F、F->E、B->G、G->D、D->H、H->F、A->D、H->B。
Assuming that node A is root node, first the relation of A->B is built, for Node B, be that in the path of leaf node, all nodes only have node A with Node B, do not comprise Node B, then in traverse tree, each node judges whether containing Node B, does not knownly comprise B, and so B just can be suspended in tree as the child node of A.The like, according to the difference of many precedence relationships, multiple tree structure can be built to calculate level, now enumerate a kind of tree structure of relation preference, see Fig. 5.
Fig. 6 is traditional calculations tree hierachy procedure chart.
Traditionally paper mulberry carrys out computation levels relation, and compare reduction for recurrence relation and the processing power with multipriority, when calculating level, data can be carried out massive duplication, causing charge capacity to increase sharply, CPU is close to full load and runs, internal memory spilling.
Compared with prior art, technical scheme of the present invention is by intelligent chain rupture process, optimize traditional paper mulberry method, the structure of level is carried out according to many precedence relationships, in reticulate texture, just can express the hierarchical relationship of all nodes, significantly optimized for ten million rank data volume processing time, traditional paper mulberry time is significantly shortened, efficiency promotes greatly, and the accuracy of output also can improve.Fig. 7 is the hierarchy chart exported according to a kind of precedence relationship.
The present invention effectively can optimize and has the traffic handing capacity that precedence relationship builds large data, for the service logic establishing and arrive set membership complexity in the large data calculated, the present invention improves traditional calculations level thought, just determine to have the node of mutual consumption relation of circulating before building tree again, thus avoid consuming a large amount of internal memory when carrying out chain rupture process, effective elevator system runnability.
By intelligent chain rupture process, optimize traditional paper mulberry method, carry out the structure of level according to many precedence relationships, in one tree, just can express the hierarchical relationship of all nodes, significantly optimized for ten million rank data volume processing time.
More than be described with reference to the accompanying drawings technical scheme of the present invention, considered in correlation technique there is no easy, the unified solution calculated for complicated type metadata.Existing relational hierarchy calculates the relational hierarchy computation process that cannot complete complicated type and participate in.Therefore, the present invention proposes a kind of relational hierarchy calculation element and a kind of relational hierarchy computing method, can on existing relational hierarchy account form basis, make full use of single object genre metadata and document to describe the relational hierarchy that type completes multi-object genre metadata and calculate, set up general, unified calculation thinking that relational hierarchy that multi-object genre metadata participates in calculates.
The foregoing is only the preferred embodiments of the present invention, be not limited to the present invention, for a person skilled in the art, the present invention can have various modifications and variations.Within the spirit and principles in the present invention all, any amendment done, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (10)
1. a relational hierarchy calculation element, is characterized in that, comprising:
Relation sequential processes unit, for collecting the business datum of operation to be triggered; According to the data relationship priority preset, the data relationship of the business datum of collecting is sorted;
Build hierarchy unit, for the data structure by the business datum after sequence, be converted into the data structure needed for computation levels relation;
Computation layer sub-cell, for based on the data structure after conversion, calculates the hierarchical relationship of data.
2. relational hierarchy calculation element according to claim 1, is characterized in that, this relational hierarchy calculation element also comprises:
Circulation chain rupture unit, for based on the data structure after conversion, processes the situation of the hierarchical relationship appearance circulation of business datum; And,
Described computation layer sub-cell, for based on the data structure after conversion and the result hierarchical relationship of business datum being occurred to the situation of circulation, calculates the hierarchical relationship of data.
3. relational hierarchy calculation element according to claim 1 and 2, is characterized in that, described relation sequential processes unit, specifically comprises:
Business datum collection module, for collecting the business datum of operation to be triggered;
Data relationship order module, for according to the data relationship priority preset, sorts to the data relationship of the business datum of collecting.
4. relational hierarchy calculation element according to claim 2, is characterized in that, the operation of the data relationship priority that described relation sequential processes unit is preset, comprises further:
Many precedence relationships level of data is built based on reticulate texture.
5. relational hierarchy calculation element according to claim 4, is characterized in that, the described operation building many precedence relationships level of data based on reticulate texture, further comprises:
The multipriority of configuration sorting data, according to the multipriority of configuration, uses quick sort data to be sorted, completes the initialization of data;
Adopt tree structure, structure level and circulation chain rupture process are carried out to the data that initialization completes.
6. relational hierarchy computing method, is characterized in that, comprising:
Step 202: the business datum of collecting operation to be triggered; According to the data relationship priority preset, the data relationship of the business datum of collecting is sorted;
Step 204: by the data structure of the business datum after sequence, be converted into the data structure needed for computation levels relation;
Step 208: based on the data structure after conversion, calculates the hierarchical relationship of data.
7. relational hierarchy computing method according to claim 6, is characterized in that, these relational hierarchy computing method also comprise:
Step 206: based on the data structure after conversion, there is the situation of circulation in the hierarchical relationship of process business datum; And,
Described step 208: based on the data structure after conversion and the result hierarchical relationship of business datum being occurred to the situation of circulation, calculate the hierarchical relationship of data.
8. the relational hierarchy computing method according to claim 6 or 7, is characterized in that, described step 202, specifically comprises:
Step 302: the business datum of collecting operation to be triggered;
Step 304: according to the data relationship priority preset, sorts to the data relationship of the business datum of collecting.
9. relational hierarchy computing method according to claim 7, is characterized in that, the operation of the data relationship priority that described step 202 is preset, comprises further:
Many precedence relationships level of data is built based on reticulate texture.
10. relational hierarchy computing method according to claim 9, is characterized in that, the described operation building many precedence relationships level of data based on reticulate texture, further comprises:
The multipriority of configuration sorting data, according to the multipriority of configuration, uses quick sort data to be sorted, completes the initialization of data;
Adopt tree structure, structure level and circulation chain rupture process are carried out to the data that initialization completes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410750224.4A CN104361134B (en) | 2014-12-10 | 2014-12-10 | Relational hierarchy computing device and method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410750224.4A CN104361134B (en) | 2014-12-10 | 2014-12-10 | Relational hierarchy computing device and method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104361134A true CN104361134A (en) | 2015-02-18 |
| CN104361134B CN104361134B (en) | 2018-10-19 |
Family
ID=52528394
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410750224.4A Active CN104361134B (en) | 2014-12-10 | 2014-12-10 | Relational hierarchy computing device and method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104361134B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6633886B1 (en) * | 1998-03-06 | 2003-10-14 | Kah Yuen John Francis Chong | Method of implementing an acyclic directed graph structure using a relational data-base |
| CN102207869A (en) * | 2011-06-03 | 2011-10-05 | 用友软件股份有限公司 | Strategy matching device and strategy matching method |
| CN102254246A (en) * | 2011-06-17 | 2011-11-23 | 中国建设银行股份有限公司 | Workflow managing method and system |
| CN102385629A (en) * | 2011-11-21 | 2012-03-21 | 山东浪潮金融信息系统有限公司 | Application method of extending father and son model to network model in data warehouse |
-
2014
- 2014-12-10 CN CN201410750224.4A patent/CN104361134B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6633886B1 (en) * | 1998-03-06 | 2003-10-14 | Kah Yuen John Francis Chong | Method of implementing an acyclic directed graph structure using a relational data-base |
| CN102207869A (en) * | 2011-06-03 | 2011-10-05 | 用友软件股份有限公司 | Strategy matching device and strategy matching method |
| CN102254246A (en) * | 2011-06-17 | 2011-11-23 | 中国建设银行股份有限公司 | Workflow managing method and system |
| CN102385629A (en) * | 2011-11-21 | 2012-03-21 | 山东浪潮金融信息系统有限公司 | Application method of extending father and son model to network model in data warehouse |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104361134B (en) | 2018-10-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10169720B2 (en) | Systems and methods for machine learning using classifying, clustering, and grouping time series data | |
| WO2016165378A1 (en) | Energy storage power station mass data cleaning method and system | |
| CN104346143A (en) | Data conversion method from EBOM (Engineering Bill of Material) to MBOM (Maintenance Bill of Material) | |
| CN103942108B (en) | Resource parameters optimization method under Hadoop isomorphism cluster | |
| CN102802163B (en) | A kind of wireless sense network topological construction method based on mixed integer programming | |
| Ma et al. | Design and implementation of smart city big data processing platform based on distributed architecture | |
| CN111177128B (en) | Metering big data batch processing method and system based on improved outlier detection algorithm | |
| CN106250566A (en) | A kind of distributed data base and the management method of data operation thereof | |
| CN107341210A (en) | C DBSCAN K clustering algorithms under Hadoop platform | |
| CN103294799B (en) | A kind of data parallel batch imports the method and system of read-only inquiry system | |
| Diao et al. | A big data online cleaning algorithm based on dynamic outlier detection | |
| CN106407379A (en) | Hadoop platform based movie recommendation method | |
| CN106294805A (en) | Data processing method and device | |
| Khan et al. | Occupancy prediction in buildings: An approach leveraging lstm and federated learning | |
| Wang et al. | Sublinear algorithms for big data applications | |
| CN104361134A (en) | Relationship level calculating device and relationship level calculating method | |
| Liu et al. | A method for electric load data verification and repair in home environment | |
| CN107862073A (en) | A kind of Web community division methods based on pitch point importance and separating degree | |
| CN106504169A (en) | A kind of waterlogging data handling system and its processing method based on stream process | |
| Cai et al. | Big data mining analysis method based on cloud computing | |
| CN102142000A (en) | Multi-scale triangulated irregular network (TIN) library coupled storage method | |
| CN102141999B (en) | Method for storing TIN (Titanium Nitride)-DEM (Digital Elevation Model) based on virtual nodes | |
| Zhang et al. | Complex network-based growth and evolution model for Internet of Things | |
| CN104462205A (en) | Self-adaptive manufacturing system organizing method based on dynamic knowledge network | |
| Zhu et al. | Computing the Split Points for Learning Decision Tree in MapReduce |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: 100094 Beijing city Haidian District North Road No. 68, UFIDA Software Park Applicant after: Yonyou Network Technology Co., Ltd. Address before: 100094 Beijing city Haidian District North Road No. 68, UFIDA Software Park Applicant before: UFIDA Software Co., Ltd. |
|
| COR | Change of bibliographic data | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |