CN105721527A - Data processing method and server - Google Patents
Data processing method and server Download PDFInfo
- Publication number
- CN105721527A CN105721527A CN201410733900.7A CN201410733900A CN105721527A CN 105721527 A CN105721527 A CN 105721527A CN 201410733900 A CN201410733900 A CN 201410733900A CN 105721527 A CN105721527 A CN 105721527A
- Authority
- CN
- China
- Prior art keywords
- node
- server
- determines
- data
- module
- 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
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the invention discloses a data processing method, and the method is used for solving a problem of multi-organization data. The method comprises the steps that a server receives a data obtaining request; the server determines selected nodes corresponding to the data obtaining request; the server judges whether the number of the selected nodes is greater than one or not; the server obtains the upper node corresponding to each selected node if the number of the selected nodes is greater than one, and stores the upper nodes to the corresponding first sets, thereby forming a plurality of first sets; the server determines a target node according to the plurality of first sets; and the server obtains the fundament data of the target node as the public fundament data. According to the embodiment of the invention, the method can determine the public upper node of the lowest selected node as the target node according to the plurality of first sets, and the server enables the fundament data of the target node to serve as the public fundament data, thereby reducing the number of modification times of the public fundament data, and reducing the possibility of data errors or leakage.
Description
Technical field
The present invention relates to the communications field, particularly relate to a kind of data processing method and server.
Background technology
Development along with Internet technology, electronic office is more and more general, enterprises is respectively organized by server admin, interdepartmental affairs and data, a department in node on behalf in enterprise management system enterprise or tissue, would be likely to occur the situation of common sparing basic data between multiple tissues, sometimes enterprise it needs to be determined that between multiple tissue share basic data.
The defining method of existing a kind of lower data of many tissues are mainly with first node, or appointment node is datum node, namely using the basic data of this datum node as common base data.
But in this existing scheme, if the non-immediate subordinate that multiple selected nodes are this datum node, then would be likely to occur multiple common superior node between the plurality of selected node and this datum node, so owing to the plurality of common superior node is likely to the common base data of multiple selected nodes were carried out amendment, add the number of times that these common base data are modified, therefore add the probability of this common base corrupt data or omission.
Summary of the invention
Embodiments provide a kind of data processing method, for solving the determination problem of the lower data of many tissues.
In view of this, first aspect present invention provides a kind of data processing method, including:
Server receives data acquisition request；
Described server determines the selected node that described data acquisition request is corresponding；
Described server judges whether described selected node is multiple node；
If so, then described server obtains the superior node that each selected node is corresponding respectively, and is stored by described superior node in the first set of correspondence, forms multiple first set；
Described server determines destination node according to the plurality of first set；
Described server obtains the basic data of described destination node as common base data.
Alternatively:
Described server determines that selected node corresponding to described data acquisition request includes:
Described server obtains the selected nodal information that described data acquisition request is carried；
Described server determines, according to described selected nodal information, the selected node that described data acquisition request is corresponding.
Alternatively:
Described selected nodal information is organization number, sets up the time or organizational member number.
Alternatively:
Described server obtains the superior node that each selected node is corresponding, and is stored by described superior node in the first set of correspondence, forms multiple first set and includes:
For each selected node, described server using described selected node as decision node
1) described decision node is stored in the first set of correspondence by described server；
2) described server obtains the immediate superior node of described decision node；
3) described server judges whether described immediate superior node is root node；
If so, then described root node is stored in described first set；
If it is not, then described immediate superior node is re-executed step 1 as described decision node), 2) and 3) till getting root node.
Alternatively:
According to the plurality of first set, described server determines that destination node includes:
Described server obtains the plurality of first intersection of sets collection as objective result collection；
Described server determines described destination node according to described objective result collection.
Alternatively:
Described server determine described destination node according to described objective result collection particularly as follows:
Described server travels through described objective result collection, and described objective result is concentrated the node of most subordinate as destination node.
Alternatively:
Described method also includes:
If described selected node is not multiple node, then described server is using described selected node as destination node, triggers described server and obtains the basic data step as common base data of described destination node.
Embodiment of the present invention second aspect provides a kind of server, including:
Receiver module, is used for receiving data acquisition request；
First determines module, the selected node corresponding for determining described data acquisition request that described receiver module receives；
Judge module, for judging described to determine whether the described selected node that module is determined is multiple node；
Obtain memory module, for when described judge module determines that described selected node is multiple node, obtaining the superior node that each selected node is corresponding respectively, and stored by described superior node in the first set of correspondence, form multiple first set；
Second determines module, determines destination node for the plurality of first set obtained according to described acquisition memory module；
For obtaining described second, acquisition module, determines that the basic data of described destination node that module determines is as common base data.
Alternatively:
Described first determines that module includes:
First acquiring unit, for obtaining the selected nodal information that described data acquisition request is carried；
First determines unit, for determining, according to described selected nodal information, the selected node that described data acquisition request is corresponding.
Alternatively:
Described acquisition memory module includes:
First processing unit, for for each selected node, using described selected node as decision node
First memory element, is used for storing described decision node, and triggers second acquisition unit；
Second acquisition unit, for obtaining the immediate superior node of described decision node, and triggers judging unit；
Judging unit, is used for judging whether described immediate superior node is root node, if so, then triggers described second memory element, if it is not, then trigger the second processing unit；
Second processing unit, is used for described immediate superior node as decision node, and triggers the first memory element；
Second memory element, is used for storing described root node.
Alternatively:
Described second determines that module includes:
3rd acquiring unit, is used for obtaining the plurality of first intersection of sets collection as objective result collection；
Second determines unit, for determining described destination node according to described objective result collection.
Alternatively:
Described second determines that unit is specifically for traveling through described objective result collection, and described objective result is concentrated the node of most subordinate as destination node.
As can be seen from the above technical solutions, the embodiment of the present invention has the advantage that
Server can get whole superior nodes corresponding to selected node and form higher level's set, when there is multiple selected node, server can get multiple first set, and determine that according to multiple first set the public superior node of most subordinate of multiple selected node is as destination node, server is using the basic data of this destination node common base data as multiple selected nodes, owing to this destination node is the public superior node of the most subordinate of multiple selected node, the i.e. minimum public superior node of multiple selected nodes, so these common base data are can meet multiple selected node demand and revise the basic data of least number of times, therefore the probability of corrupt data or omission is reduced.
Accompanying drawing explanation
Fig. 1 is an embodiment flow chart of data processing method in the embodiment of the present invention；
Fig. 2 is another embodiment flow chart of data processing method in the embodiment of the present invention；
Fig. 3 is another embodiment flow chart of data processing method in the embodiment of the present invention；
Fig. 4 is another embodiment flow chart of data processing method in the embodiment of the present invention；
Fig. 5 is an embodiment schematic diagram of server in the embodiment of the present invention；
Fig. 6 is another embodiment schematic diagram of server in the embodiment of the present invention；
Fig. 7 is another embodiment schematic diagram of server in the embodiment of the present invention；
Fig. 8 is another embodiment schematic diagram of server in the embodiment of the present invention；
Fig. 9 is tissue system node topology figure.
Detailed description of the invention
Embodiments provide a kind of data processing method, for solving the determination problem of the lower data of many tissues.
In order to make those skilled in the art be more fully understood that the present invention program, below in conjunction with the accompanying drawing in the embodiment of the present invention, technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is only the embodiment of a present invention part, rather than whole embodiments.Based on the embodiment in the present invention, the every other embodiment that those of ordinary skill in the art obtain under not making creative work premise, all should belong to the scope of protection of the invention.
Term " first " in description and claims of this specification and above-mentioned accompanying drawing, " second ", " the 3rd " " the 4th " etc. (if existence) are for distinguishing similar object, without being used for describing specific order or precedence.Should be appreciated that the data of so use can be exchanged in the appropriate case, in order to the embodiments described herein can be implemented with the order except the content of here diagram or description.In addition, term " includes " and " having " and their any deformation, it is intended to cover non-exclusive comprising, such as, contain series of steps or the process of unit, method, system, product or equipment be not necessarily limited to those steps or the unit clearly listed, but can include clearly not listing or for intrinsic other step of these processes, method, product or equipment or unit.
Referring to Fig. 1, in the embodiment of the present invention, an embodiment of data processing method includes:
101, server receives data acquisition request；
When user requires over server acquisition data, server will receive Client-initiated data acquisition request.
102, server determines the selected node that this data acquisition request is corresponding；
After server receives data acquisition request, it is possible to determine, by various modes, the selected node that this data acquisition request is corresponding.
103, server judges whether described selected node is multiple node, if so, then performs step 104；
After server determines the selected node that this data acquisition request is corresponding, server judges whether this selected node is multiple node, if so, then performs step 104.
104, server obtains the superior node that each selected node is corresponding respectively, and is stored by this superior node in the first set of correspondence, forms multiple first set；
When server determines that selected node corresponding to this data acquisition request is multiple node, server obtains the superior node that each selected node is corresponding respectively, and this superior node is stored in the first set of correspondence, i.e. corresponding one first set of each selected node, thus forming multiple first set..
105, server determines destination node according to the plurality of first set；
When server gets the superior node that each selected node is corresponding respectively, and being stored by this superior node in the first set of correspondence, after forming multiple first set, server determines destination node according to the plurality of first set.
106, server obtains the basic data of this destination node as common base data.
After server determines destination node according to the plurality of first set, server obtains the basic data of this destination node as common base data.
In the embodiment of the present invention, server can get whole superior nodes corresponding to selected node and form higher level's set, when there is multiple selected node, server can get multiple first set, and determine that according to multiple first set the public superior node of most subordinate of multiple selected node is as destination node, server is using the basic data of this destination node common base data as multiple selected nodes, owing to this destination node is the public superior node of the most subordinate of multiple selected node, the i.e. minimum public superior node of multiple selected nodes, so these common base data are can meet multiple selected node demand and revise the basic data of least number of times, therefore the probability of corrupt data or omission is reduced.
In actual applications, the selected nodal information that server can pass through to carry in data acquisition request determines the selected node that this data acquisition request is corresponding, is further explained below:
Referring to Fig. 2, in the embodiment of the present invention, another embodiment of data processing method includes:
201, server receives data acquisition request；
When user requires over server acquisition data, server will receive Client-initiated data acquisition request.
202, server obtains the selected nodal information carried in this data acquisition request；
After server receives data acquisition request, by resolving this data acquisition request, obtain the selected nodal information carried in this data acquisition request.
It should be noted that this selected nodal information specifically may is that organization number, sets up the time or organizational member number, it is to be understood that in actual applications, this selected nodal information can also be other information, does not specifically limit herein.
It is understood that in actual applications, server can also get in this data acquisition request the selected nodal information carried by other means, does not specifically limit herein.
203, server determines, according to this selected nodal information, the selected node that this data acquisition request is corresponding；
After server gets the selected nodal information carried in this data acquisition request, server determines, according to this selected nodal information, the selected node that this data acquisition request is corresponding.
204, server judges whether described selected node is multiple node, if so, then performs step 205, if it is not, then perform step 207；
After server determines the selected node that this data acquisition request is corresponding, server judges whether this selected node is multiple node, if so, then performs step 205, if it is not, then perform step 207.
205, server obtains the superior node that each selected node is corresponding respectively, and is stored by this superior node in the first set of correspondence, forms multiple first set；
When server determines that selected node corresponding to this data acquisition request is multiple node, server obtains the superior node that each selected node is corresponding respectively, and is stored by this superior node in the first set of correspondence, forms multiple first set.
206, server determines destination node according to the plurality of first set, performs step 208；
When server gets the superior node that each selected node is corresponding respectively, and being stored by this superior node in the first set of correspondence, after forming multiple first set, server determines destination node according to the plurality of first set, performs step 208.
207, server is using this selected node as destination node, performs step 208；
When server determines that selected node corresponding to this data acquisition request is not multiple node, this selected node as destination node, is performed step 208 by server.
208, server obtains the basic data of this destination node as common base data.
After server determines destination node, server obtains the basic data of this destination node as common base data.
In the embodiment of the present invention, server can get whole superior nodes corresponding to selected node and form higher level's set, when there is multiple selected node, server can get multiple first set, and determine that according to multiple first set the public superior node of most subordinate of multiple selected node is as destination node, server is using the basic data of this destination node common base data as multiple selected nodes, owing to this destination node is the public superior node of the most subordinate of multiple selected node, the i.e. minimum public superior node of multiple selected nodes, so these common base data are can meet multiple selected node demand and revise the basic data of least number of times, therefore the probability of corrupt data or omission is reduced.
Secondly, present embodiments providing a kind of server and determine the mode of selected node, namely the selected nodal information by carrying in data acquisition request is determined, adds the alternative of scheme.
It should be noted that in the above-described embodiments, step 207 is optional step, and when server determines that selected node corresponding to this data acquisition request is not multiple node, server can also carry out other according to prior art and process, and does not specifically limit herein.
In actual applications, server obtains the superior node that each selected node is corresponding respectively, and is stored by this superior node in the first set of correspondence, and the specific implementation forming multiple first set may is that
Referring to Fig. 3, in the embodiment of the present invention, another embodiment of data processing method includes:
301, server receives data acquisition request；
When user requires over server acquisition data, server will receive Client-initiated data acquisition request.
302, server determines the selected node that this data acquisition request is corresponding；
After server receives data acquisition request, it is possible to determined the selected node of correspondence by the selected nodal information carried in this data acquisition request, specific implementation can be similar to the embodiment shown in Fig. 2, repeats no more herein.
It should be noted that server can also determine the selected node that this data acquisition request is corresponding by other means, specifically do not limit herein.
303, server judges whether described selected node is multiple node, if so, then performs step 304, if it is not, then perform step 311；
After server determines the selected node that this data acquisition request is corresponding, server judges whether this selected node is multiple node, if so, then performs step 304, if it is not, then perform step 311.
304, for each selected node, server using this selected node as decision node；
When server determines that selected node corresponding to data acquisition request is multiple node, for each selected node, server using this selected node as decision node.
305, this decision node is stored in the first set of correspondence by server, performs step 306；
When server using selected node as after decision node, this decision node is stored in the first set of correspondence by server.
306, server obtains the immediate superior node of this decision node, performs step 307；
After server will determine that the first set that node stores correspondence, server obtains the immediate superior node of this decision node.
It should be noted that server can get the immediate superior node of this decision node by various modes, specifically do not limit herein.
307, server judges whether this immediate superior node is root node, if so, then performs step 308, if it is not, then perform step 309；
After server gets the immediate superior node of this decision node, server judges whether this immediate superior node is root node, if so, then performs step 308, if it is not, then perform step 309.
308, this root node is stored in this first set by server, performs step 310；
When server determines that this immediate superior node is root node, this root node is stored in this first set by server, performs step 310.
309, server is using this immediate superior node as decision node, performs step 305；
When server determines that this immediate superior node is not root node, this immediate superior node as decision node, is performed step 305 by server.
310, server determines destination node according to the plurality of first set, performs step 312；
When server gets the superior node that each selected node is corresponding respectively, and being stored by this superior node in the first set of correspondence, after forming multiple first set, server determines destination node according to the plurality of first set.
311, server is using this selected node as destination node, performs step 312；
When server determines that selected node corresponding to this data acquisition request is not multiple node, this selected node as destination node, is performed step 312 by server.
312, server obtains the basic data of this destination node as common base data.
After server determines destination node, server obtains the basic data of this destination node as common base data.
In the embodiment of the present invention, server can get whole superior nodes corresponding to selected node and form higher level's set, when there is multiple selected node, server can get multiple first set, and determine that according to multiple first set the public superior node of most subordinate of multiple selected node is as destination node, server is using the basic data of this destination node common base data as multiple selected nodes, owing to this destination node is the public superior node of the most subordinate of multiple selected node, the i.e. minimum public superior node of multiple selected nodes, so these common base data are can meet multiple selected node demand and revise the basic data of least number of times, therefore the probability of corrupt data or omission is reduced.
Secondly, present embodiments provide a kind of server and obtain the superior node that multiple selected nodes are corresponding respectively, the method forming multiple first set, increase the flesh alternative of scheme.
It should be noted that in the above-described embodiments, step 311 is optional step, and when server determines that selected node corresponding to this data acquisition request is not multiple node, server can also carry out other according to prior art and process, and does not specifically limit herein.
In actual applications, according to multiple first set, server determines that destination node specifically can be determined by the plurality of first intersection of sets collection, be further explained below:
Referring to Fig. 4, in the embodiment of the present invention, another embodiment of data processing method includes:
401, server receives data acquisition request；
When user requires over server acquisition data, server will receive Client-initiated data acquisition request.
402, server determines the selected node that this data acquisition request is corresponding；
After server receives data acquisition request, it is possible to determined the selected node of correspondence by the selected nodal information carried in this data acquisition request, specific implementation can be similar to the embodiment shown in Fig. 2, repeats no more herein.
It should be noted that server can also determine the selected node that this data acquisition request is corresponding by other means, specifically do not limit herein.
403, server judges whether described selected node is multiple node, if so, then performs step 404, if it is not, then perform step 407；
After server determines the selected node that this data acquisition request is corresponding, server judges whether this selected node is multiple node, if so, then performs step 404, if it is not, then perform step 407.
404, server obtains the superior node that each selected node is corresponding respectively, and is stored by this superior node in the first set of correspondence, forms multiple first set；
When server determines that selected node corresponding to this data acquisition request is multiple node, server obtains the superior node that each selected node is corresponding respectively, and this superior node is stored in the first set of correspondence, form multiple first set, concrete methods of realizing can be similar to the embodiment shown in Fig. 3, repeats no more herein.
405, server obtains multiple first intersection of sets collection as objective result collection；
When server obtains the superior node that each selected node is corresponding respectively, and being stored by this superior node in the first set of correspondence, after forming multiple first set, server obtains multiple first intersection of sets collection as objective result collection.
406, server determines destination node according to this objective result collection, performs step 408；
After the server multiple first intersection of sets collection of acquisition are as objective result collection, server determines destination node according to this objective result collection, performs step 408.
It should be noted that, according to this objective result collection, server determines that the mode of destination node may is that server travels through this objective result collection, this objective result is concentrated the node of most subordinate as destination node, it is understandable that, server can also be determined by other means and destination node specifically do not limit herein.
407, server is using this selected node as destination node, performs step 408；
When server determines that selected node corresponding to this data acquisition request is not multiple node, this selected node as destination node, is performed step 407 by server.
408, server obtains the basic data of this destination node as common base data.
After server determines destination node, server obtains the basic data of this destination node as common base data.
In the embodiment of the present invention, server can get whole superior nodes corresponding to selected node and form higher level's set, when there is multiple selected node, server can get multiple first set, and determine that according to multiple first set the public superior node of most subordinate of multiple selected node is as destination node, server is using the basic data of this destination node common base data as multiple selected nodes, owing to this destination node is the public superior node of the most subordinate of multiple selected node, the i.e. minimum public superior node of multiple selected nodes, so these common base data are can meet multiple selected node demand and revise the basic data of least number of times, therefore the probability of corrupt data or omission is reduced.
Secondly, present embodiments provide and a kind of realize method according to what destination node was determined in multiple first set, namely by obtaining multiple first intersection of sets collection, and determine destination node according to this common factor, add the alternative of scheme.
It should be noted that in the above-described embodiments, step 407 is optional step, and when server determines that selected node corresponding to this data acquisition request is not multiple node, server can also carry out other according to prior art and process, and does not specifically limit herein.
For ease of understanding, with a concrete application scenarios, data processing method in the embodiment of the present invention is described in detail below, concrete:
Assuming that the tissue system of certain company is tree-like organizational structure, as shown in Figure 9, its root node is A, A node has two direct downstream site respectively B node and D node, wherein B node has a direct downstream site to be C node, D node has two direct downstream sites respectively E node and F node, and F node has again two direct downstream sites to be G node and H node respectively.
Now due to business demand, it is thus necessary to determine that the common base data of E node and G node.
After server receives data acquisition request, determine that selected node corresponding to this data acquisition request is E node and G node by this data acquisition request is carried selected nodal information, simultaneously server determines that selected node corresponding to this data acquisition request is multiple node, then for E node and G node, server obtains E node and superior node corresponding to G node respectively, and this superior node is stored in the first set of correspondence, form two first set, particularly as follows: the first set [D, A] that E node is corresponding；Higher level's set [F, D, A] that G node is corresponding.
Server is according to two first set, objective result collection is obtained: [D by taking two the first intersection of sets collection, A], server traversal objective result collection [D, A], owing to the tissue of A is superior to D, therefore server using D node as destination node, afterwards, server obtains the basic data common base data as selected node E node and G node of D node.
Above data processing method in the embodiment of the present invention is described, below the server in the embodiment of the present invention is described, concrete:
Referring to Fig. 5, in the embodiment of the present invention, an embodiment of server includes:
Receiver module 501, is used for receiving data acquisition request；
First determines module 502, the selected node corresponding for determining data acquisition request that receiver module 501 receives；
Judge module 503, for judging to determine whether the selected node that module 502 is determined is multiple node；
Obtain memory module 504, for when judge module 503 determines that selected node is multiple node, obtaining the superior node that each selected node is corresponding respectively, and stored by this superior node in the first set of correspondence, form multiple first set；
Second determines module 505, determines destination node for multiple first set obtained according to acquisition memory module 504；
For obtaining second, acquisition module 506, determines that the basic data of destination node that module 505 determines is as common base data.
In the embodiment of the present invention, after receiver module 501 receives data acquisition request, first determines that module 502 can determine the selected node that this data acquisition request is corresponding, judge module 503 can interpolate that whether this selected node is multiple node, if, obtain memory module 504 and can obtain the superior node that each selected node is corresponding respectively, and this superior node is stored in the first set of correspondence, form multiple first set, second determines that module 505 can gather destination node according to multiple first, acquisition module 506 can obtain the basic data of this destination node as common base data, owing to this destination node is the public superior node of the most subordinate of multiple selected node, the i.e. minimum public superior node of multiple selected nodes, so these common base data are can meet multiple selected node demand and revise the basic data of least number of times, therefore the probability of corrupt data or omission is reduced.
Referring to Fig. 6, in the embodiment of the present invention, another embodiment of server includes:
Receiver module 601, is used for receiving data acquisition request；
First determines module 602, the selected node corresponding for determining data acquisition request that receiver module 601 receives；
Judge module 603, for judging to determine whether the selected node that module 602 is determined is multiple node；
Obtain memory module 604, for when judge module 603 determines that selected node is multiple node, obtaining the superior node that each selected node is corresponding respectively, and stored by this superior node in the first set of correspondence, form multiple first set；
Second determines module 605, determines destination node for multiple first set obtained according to acquisition memory module 604；
For obtaining second, acquisition module 606, determines that the basic data of destination node that module 605 determines is as common base data；
Wherein, first determines that module 602 specifically includes:
First acquiring unit 6021, for obtaining the selected nodal information that this data acquisition request is carried；
First determines unit 6022, for determining, according to this selected nodal information, the selected node that this data acquisition request is corresponding.
In the embodiment of the present invention, after receiver module 601 receives data acquisition request, first the first acquiring unit 6021 determined in module 602 can enough get the selected nodal information that this data acquisition request is carried, first determines that unit 6022 can determine, according to this selected nodal information, the selected node that this data acquisition request is corresponding, judge module 603 can interpolate that whether this selected node is multiple node, if, obtain memory module 604 and can obtain the superior node that each selected node is corresponding respectively, and this superior node is stored in the first set of correspondence, form multiple first set, second determines that module 605 can gather destination node according to multiple first, acquisition module 606 can obtain the basic data of this destination node as common base data, owing to this destination node is the public superior node of the most subordinate of multiple selected node, the i.e. minimum public superior node of multiple selected nodes, so these common base data are can meet multiple selected node demand and revise the basic data of least number of times, therefore the probability of corrupt data or omission is reduced.
Referring to Fig. 7, in the embodiment of the present invention, another embodiment of server includes:
Receiver module 701, is used for receiving data acquisition request；
First determines module 702, the selected node corresponding for determining data acquisition request that receiver module 701 receives；
Judge module 703, for judging to determine whether the selected node that module 702 is determined is multiple node；
Obtain memory module 704, for when judge module 703 determines that selected node is multiple node, obtaining the superior node that each selected node is corresponding respectively, and stored by this superior node in the first set of correspondence, form multiple first set；
Second determines module 705, determines destination node for multiple first set obtained according to acquisition memory module 704；
For obtaining second, acquisition module 706, determines that the basic data of destination node that module 705 determines is as common base data；
Wherein, obtain memory module 704 to specifically include:
First processing unit 7041, for for each selected node, using this selected node as decision node
First memory element 7042, is used for storing this decision node, and triggers second acquisition unit 7043；
Second acquisition unit 7043, for obtaining the immediate superior node of this decision node, and triggers judging unit 7044；
Judging unit 7044, is used for judging whether this immediate superior node is root node, if so, then triggers described second memory element 7046, if it is not, then trigger the second processing unit 7045；
Second processing unit 7045, is used for this immediate superior node as decision node, and triggers the first memory element 7042；
Second memory element 7046, is used for storing described root node.
In the embodiment of the present invention, after receiver module 701 receives data acquisition request, first determines that module 702 can determine the selected node that this data acquisition request is corresponding, judge module 703 can interpolate that whether this selected node is multiple node, if, obtain memory module 704 and can obtain the superior node that each selected node is corresponding respectively, and this superior node is stored in the first set of correspondence, form multiple first set, second determines that module 705 can gather destination node according to multiple first, acquisition module 706 can obtain the basic data of this destination node as common base data, owing to this destination node is the public superior node of the most subordinate of multiple selected node, the i.e. minimum public superior node of multiple selected nodes, so these common base data are can meet multiple selected node demand and revise the basic data of least number of times, therefore the probability of corrupt data or omission is reduced.
For ease of understanding, with a concrete application scenarios, the data exchange process between each module of server in the embodiment of the present invention is described in detail below, concrete:
When user requires over server acquisition data, server receiver module 701 will receive Client-initiated data acquisition request.
After receiver module 701 receives data acquisition request, first determines that the selected nodal information that module 702 can pass through to carry in this data acquisition request determines the selected node of correspondence.
It should be noted that first determines that module 702 can also determine the selected node that this data acquisition request is corresponding by other means, specifically do not limit herein.
After determining that module 702 determines the selected node that this data acquisition request is corresponding when first, it is judged that module 703 judges whether this selected node is multiple node, if so, trigger and obtain memory module 704.
When judge module 703 determines that selected node corresponding to data acquisition request is multiple node, for each selected node, obtain in memory module 704 first processing unit 7041 using this selected node as decision node.
When server the first processing unit 7041 using selected node as after decision node, this decision node is stored in the first set of correspondence by the first memory element 7042.
After the first memory element 7042 will determine that the first set that node stores correspondence, second acquisition unit 7043 obtains the immediate superior node of this decision node.
It should be noted that server can get the immediate superior node of this decision node by various modes, specifically do not limit herein.
After second acquisition unit 7043 gets the immediate superior node of this decision node, it is judged that unit 7044 judges whether this immediate superior node is root node, if so, then triggers the second memory element 7046, if it is not, then trigger the second processing unit 7045.
When judging unit 7044 determines that this immediate superior node is root node, this root node is stored in this first set by the second memory element 7046, triggers second and determines module 705.
When judging unit 7044 determines that this immediate superior node is not root node, this immediate superior node as decision node, is triggered the first memory element 7042 by the second processing unit 7045.
Getting, when obtaining memory module 704, the superior node that each selected node is corresponding respectively, and stored by this superior node in the first set of correspondence, after forming multiple first set, second determines that module 705 determines destination node according to the plurality of first set.
After determining that module 705 determines destination node when second, acquisition module 706 obtains the basic data of this destination node as common base data.
In the embodiment of the present invention, server can get whole superior nodes corresponding to selected node and form higher level's set, when there is multiple selected node, server can get multiple first set, and determine that according to multiple first set the public superior node of most subordinate of multiple selected node is as destination node, server is using the basic data of this destination node common base data as multiple selected nodes, owing to this destination node is the public superior node of the most subordinate of multiple selected node, the i.e. minimum public superior node of multiple selected nodes, so these common base data are can meet multiple selected node demand and revise the basic data of least number of times, therefore the probability of corrupt data or omission is reduced.
Referring to Fig. 8, in the embodiment of the present invention, another embodiment of server includes:
Receiver module 801, is used for receiving data acquisition request；
First determines module 802, the selected node corresponding for determining data acquisition request that receiver module 801 receives；
Judge module 803, for judging to determine whether the selected node that module 802 is determined is multiple node；
Obtain memory module 804, for when judge module 803 determines that selected node is multiple node, obtaining the superior node that each selected node is corresponding respectively, and stored by this superior node in the first set of correspondence, form multiple first set；
Second determines module 805, determines destination node for multiple first set obtained according to acquisition memory module 804；
For obtaining second, acquisition module 806, determines that the basic data of destination node that module 805 determines is as common base data；
Wherein, second determines that module 805 specifically includes:
3rd acquiring unit 8051, is used for obtaining multiple first intersection of sets collection as objective result collection；
Second determines unit 8052, for determining destination node according to this objective result collection；
Wherein, second determines that unit 8052 is specifically for traveling through this objective result collection, and this objective result is concentrated the node of most subordinate as destination node.
In the embodiment of the present invention, after receiver module 801 receives data acquisition request, first determines that module 802 can determine the selected node that this data acquisition request is corresponding, judge module 803 can interpolate that whether this selected node is multiple node, if, obtain memory module 804 and can obtain the superior node that each selected node is corresponding respectively, and this superior node is stored in the first set of correspondence, form multiple first set, second determines that module 805 can gather destination node according to multiple first, acquisition module 806 can obtain the basic data of this destination node as common base data, owing to this destination node is the public superior node of the most subordinate of multiple selected node, the i.e. minimum public superior node of multiple selected nodes, so these common base data are can meet multiple selected node demand and revise the basic data of least number of times, therefore the probability of corrupt data or omission is reduced.
Those skilled in the art is it can be understood that arrive, for convenience and simplicity of description, the system of foregoing description, the specific works process of device and unit, it is possible to reference to the corresponding process in preceding method embodiment, do not repeat them here.
In several embodiments provided herein, it should be understood that disclosed system, apparatus and method, it is possible to realize by another way.Such as, device embodiment described above is merely schematic, such as, the division of described unit, being only a kind of logic function to divide, actual can have other dividing mode when realizing, for instance multiple unit or assembly can in conjunction with or be desirably integrated into another system, or some features can ignore, or do not perform.Another point, shown or discussed coupling each other or direct-coupling or communication connection can be through INDIRECT COUPLING or the communication connection of some interfaces, device or unit, it is possible to be electrical, machinery or other form.
The described unit illustrated as separating component can be or may not be physically separate, and the parts shown as unit can be or may not be physical location, namely may be located at a place, or can also be distributed on multiple NE.Some or all of unit therein can be selected according to the actual needs to realize the purpose of the present embodiment scheme.
It addition, each functional unit in each embodiment of the present invention can be integrated in a processing unit, it is also possible to be that unit is individually physically present, it is also possible to two or more unit are integrated in a unit.Above-mentioned integrated unit both can adopt the form of hardware to realize, it would however also be possible to employ the form of SFU software functional unit realizes.
If described integrated unit is using the form realization of SFU software functional unit and as independent production marketing or use, it is possible to be stored in a computer read/write memory medium.Based on such understanding, part or all or part of of this technical scheme that prior art is contributed by technical scheme substantially in other words can embody with the form of software product, this computer software product is stored in a storage medium, including some instructions with so that a computer equipment (can be personal computer, server, or the network equipment etc.) perform all or part of step of method described in each embodiment of the present invention.And aforesaid storage medium includes: USB flash disk, portable hard drive, read only memory (ROM, Read-OnlyMemory), the various media that can store program code such as random access memory (RAM, RandomAccessMemory), magnetic disc or CD.
The above, above example only in order to technical scheme to be described, is not intended to limit；Although the present invention being described in detail with reference to previous embodiment, it will be understood by those within the art that: the technical scheme described in foregoing embodiments still can be modified by it, or wherein portion of techniques feature is carried out equivalent replacement；And these amendments or replacement, do not make the essence of appropriate technical solution depart from the spirit and scope of various embodiments of the present invention technical scheme.
Claims (12)
1. a data processing method, it is characterised in that including:
Server receives data acquisition request；
Described server determines the selected node that described data acquisition request is corresponding；
Described server judges whether described selected node is multiple node；
If so, then described server obtains the superior node that each selected node is corresponding respectively, and is stored by described superior node in the first set of correspondence, forms multiple first set；
Described server determines destination node according to the plurality of first set；
Described server obtains the basic data of described destination node as common base data.
2. data processing method according to claim 1, it is characterised in that described server determines that selected node corresponding to described data acquisition request includes:
Described server obtains the selected nodal information that described data acquisition request is carried；
Described server determines, according to described selected nodal information, the selected node that described data acquisition request is corresponding.
3. data processing method according to claim 2, it is characterised in that described selected nodal information is organization number, sets up the time or organizational member number.
4. data processing method according to claim 1, it is characterised in that described server obtains the superior node that each selected node is corresponding, and is stored by described superior node in the first set of correspondence, forms multiple first set and includes:
For each selected node, described server using described selected node as decision node
1) described decision node is stored in the first set of correspondence by described server；
2) described server obtains the immediate superior node of described decision node；
3) described server judges whether described immediate superior node is root node；
If so, then described root node is stored in described first set；
If it is not, then described immediate superior node is re-executed step 1 as described decision node), 2) and 3) till getting root node.
5. data processing method according to claim 1, it is characterised in that according to the plurality of first set, described server determines that destination node includes:
Described server obtains the plurality of first intersection of sets collection as objective result collection；
Described server determines described destination node according to described objective result collection.
6. data processing method according to claim 5, it is characterised in that described server determine described destination node according to described objective result collection particularly as follows:
Described server travels through described objective result collection, and described objective result is concentrated the node of most subordinate as destination node.
7. data processing method according to any one of claim 1 to 5, it is characterised in that described method also includes:
If described selected node is not multiple node, then described server is using described selected node as destination node, triggers described server and obtains the basic data step as common base data of described destination node.
8. a server, it is characterised in that including:
Receiver module, is used for receiving data acquisition request；
First determines module, the selected node corresponding for determining described data acquisition request that described receiver module receives；
Judge module, for judging described to determine whether the described selected node that module is determined is multiple node；
Obtain memory module, for when described judge module determines that described selected node is multiple node, obtaining the superior node that each selected node is corresponding respectively, and stored by described superior node in the first set of correspondence, form multiple first set；
Second determines module, determines destination node for the plurality of first set obtained according to described acquisition memory module；
For obtaining described second, acquisition module, determines that the basic data of described destination node that module determines is as common base data.
9. server according to claim 8, it is characterised in that described first determines that module includes:
First acquiring unit, for obtaining the selected nodal information that described data acquisition request is carried；
First determines unit, for determining, according to described selected nodal information, the selected node that described data acquisition request is corresponding.
10. server according to claim 8, it is characterised in that described acquisition memory module includes:
First processing unit, for for each selected node, using described selected node as decision node
First memory element, is used for storing described decision node, and triggers second acquisition unit；
Second acquisition unit, for obtaining the immediate superior node of described decision node, and triggers judging unit；
Judging unit, is used for judging whether described immediate superior node is root node, if so, then triggers described second memory element, if it is not, then trigger the second processing unit；
Second processing unit, is used for described immediate superior node as decision node, and triggers the first memory element；
Second memory element, is used for storing described root node.
11. server according to claim 8, it is characterised in that described second determines that module includes:
3rd acquiring unit, is used for obtaining the plurality of first intersection of sets collection as objective result collection；
Second determines unit, for determining described destination node according to described objective result collection.
12. server according to claim 11, it is characterised in that described second determines that unit is specifically for traveling through described objective result collection, described objective result is concentrated the node of most subordinate as destination node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410733900.7A CN105721527B (en) | 2014-12-04 | 2014-12-04 | A kind of data processing method and server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410733900.7A CN105721527B (en) | 2014-12-04 | 2014-12-04 | A kind of data processing method and server |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105721527A true CN105721527A (en) | 2016-06-29 |
| CN105721527B CN105721527B (en) | 2019-03-01 |
Family
ID=56144068
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410733900.7A Active CN105721527B (en) | 2014-12-04 | 2014-12-04 | A kind of data processing method and server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105721527B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109189728A (en) * | 2018-07-18 | 2019-01-11 | 深圳市网心科技有限公司 | Intelligent hardware devices, data in magnetic disk processing method and storage medium |
| CN109327484A (en) * | 2017-07-31 | 2019-02-12 | 北京嘀嘀无限科技发展有限公司 | Acquisition methods, device, server and the storage medium of characteristic value collection |
| CN110008197A (en) * | 2019-04-12 | 2019-07-12 | 苏州浪潮智能科技有限公司 | A kind of data processing method, system and electronic equipment and storage medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1766875A (en) * | 2004-10-29 | 2006-05-03 | 株式会社东芝 | System and method for retrieving structured document |
| CN101146205A (en) * | 2006-09-15 | 2008-03-19 | 中兴通讯股份有限公司 | Content distribution policy processing method for interactive network TV |
| CN101408895A (en) * | 2008-11-03 | 2009-04-15 | 金蝶软件（中国）有限公司 | Method, apparatus and system for constructing node relation tree according to node aggregation |
| CN102035815A (en) * | 2009-09-29 | 2011-04-27 | 华为技术有限公司 | Data acquisition method, access node and data acquisition system |
| CN102307221A (en) * | 2011-03-25 | 2012-01-04 | 国云科技股份有限公司 | Cloud storage system and implementation method thereof |
| CN103279302A (en) * | 2013-05-30 | 2013-09-04 | 华为技术有限公司 | Method and device for displaying stratified data |
| CN103518364A (en) * | 2013-03-19 | 2014-01-15 | 华为技术有限公司 | Data update method for distributed storage system and server |
-
2014
- 2014-12-04 CN CN201410733900.7A patent/CN105721527B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1766875A (en) * | 2004-10-29 | 2006-05-03 | 株式会社东芝 | System and method for retrieving structured document |
| CN101146205A (en) * | 2006-09-15 | 2008-03-19 | 中兴通讯股份有限公司 | Content distribution policy processing method for interactive network TV |
| CN101408895A (en) * | 2008-11-03 | 2009-04-15 | 金蝶软件（中国）有限公司 | Method, apparatus and system for constructing node relation tree according to node aggregation |
| CN102035815A (en) * | 2009-09-29 | 2011-04-27 | 华为技术有限公司 | Data acquisition method, access node and data acquisition system |
| CN102307221A (en) * | 2011-03-25 | 2012-01-04 | 国云科技股份有限公司 | Cloud storage system and implementation method thereof |
| CN103518364A (en) * | 2013-03-19 | 2014-01-15 | 华为技术有限公司 | Data update method for distributed storage system and server |
| CN103279302A (en) * | 2013-05-30 | 2013-09-04 | 华为技术有限公司 | Method and device for displaying stratified data |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109327484A (en) * | 2017-07-31 | 2019-02-12 | 北京嘀嘀无限科技发展有限公司 | Acquisition methods, device, server and the storage medium of characteristic value collection |
| CN109327484B (en) * | 2017-07-31 | 2021-09-28 | 北京嘀嘀无限科技发展有限公司 | Method and device for acquiring characteristic value set, server and storage medium |
| CN109189728A (en) * | 2018-07-18 | 2019-01-11 | 深圳市网心科技有限公司 | Intelligent hardware devices, data in magnetic disk processing method and storage medium |
| CN110008197A (en) * | 2019-04-12 | 2019-07-12 | 苏州浪潮智能科技有限公司 | A kind of data processing method, system and electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105721527B (en) | 2019-03-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102693246B (en) | Method and system for obtaining information from dataset | |
| CN102236678A (en) | Method and system for managing dynamic information of friends, and server for managing information of friends | |
| CN102782673A (en) | System and method for object migration waves | |
| US9026557B2 (en) | Schema mapping based on data views and database tables | |
| US20150019592A1 (en) | Systems, methods and software for computing reachability in large graphs | |
| CN107832446B (en) | Configuration item information searching method and computing device | |
| CN104301233A (en) | Route access method, route access system and user terminal | |
| CA2598923A1 (en) | Method and system for data classification using a self-organizing map | |
| CN105869057A (en) | Comment storage device, comment reading method and apparatus, and comment writing method and apparatus | |
| CN104346458A (en) | Data storage method and device | |
| CN116521956A (en) | Graph database query method and device, electronic equipment and storage medium | |
| CN106649602A (en) | Way, device and server of processing business object data | |
| CN106202392A (en) | A kind of photo classification method and terminal | |
| CN105721527A (en) | Data processing method and server | |
| CN105630419A (en) | Partition view sending method of resource pools and management node | |
| CN106844319A (en) | Report form generation method and device | |
| CN111666344A (en) | Heterogeneous data synchronization method and device | |
| WO2024160273A1 (en) | Data processing method and apparatus, device, and storage medium | |
| CN108833584A (en) | Information push method, terminal, server and computer storage medium | |
| CN110442369A (en) | Code method for cleaning and device, storage medium suitable for git | |
| CN106021359A (en) | CAD file modification method and device | |
| CN117113900A (en) | TDM-based segmentation processing method and device | |
| EP2710493A1 (en) | System and method for configuration policy extraction | |
| CN113760521A (en) | Virtual resource allocation method and device | |
| CN116703330A (en) | Management method, device, equipment and storage medium for multi-level business process |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |