CN105721527B - A kind of data processing method and server - Google Patents
A kind of data processing method and server Download PDFInfo
- Publication number
- CN105721527B CN105721527B CN201410733900.7A CN201410733900A CN105721527B CN 105721527 B CN105721527 B CN 105721527B CN 201410733900 A CN201410733900 A CN 201410733900A CN 105721527 B CN105721527 B CN 105721527B
- Authority
- CN
- China
- Prior art keywords
- node
- server
- data
- superior
- acquisition request
- 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.)
- Active
Links
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the invention discloses a kind of data processing methods, and the determination method of lower data is knitted for solving multiple groups.The method comprise the steps that server receives data acquisition request；Server determines the corresponding selected node of data acquisition request；Server judges whether selected node is multiple nodes；If so, server obtains the corresponding superior node of each selected node, and superior node storage is formed into multiple first sets into corresponding first set；Server determines destination node according to multiple first sets；Server obtains the basic data of destination node as common base data.The embodiment of the present invention can determine the public superior node of the most junior of multiple selected nodes as destination node according to multiple first sets, clothes are using the basic data of the destination node as common base data, a possibility that reducing the number that common base data are modified, reducing corrupt data or omit.
Description
Technical field
The present invention relates to the communications field more particularly to a kind of data processing method and servers.
Background technique
With the continuous development of Internet technology, electronic office is more and more common, and enterprises pass through server admin
Each tissue, interdepartmental affairs and data, a department in node on behalf in enterprise management system enterprise or
The case where one is organized, and there may be common sparing basic datas between multiple tissues, sometimes enterprise is it needs to be determined that multiple groups
The basic data shared between knitting.
The determination method that a kind of existing multiple groups knit lower data saves on the basis of mainly using first node or specified node
Point, i.e., using the basic data of the datum node as common base data.
But in this existing scheme, if multiple selected nodes are the indirect junior of the datum node, multiple choosing
Determine between node and the datum node that there may be multiple common superior nodes, then since multiple common superior node may
Modification was carried out to the common base data of multiple selected nodes, increases the number that the common base data are modified, therefore
A possibility that increasing the common base corrupt data or omitting.
Summary of the invention
The embodiment of the invention provides a kind of data processing methods, for solving the problems, such as that multiple groups knit the determination of lower data.
In view of this, first aspect present invention provides a kind of data processing method, comprising:
Server receives data acquisition request；
The server determines the corresponding selected node of the data acquisition request；
The server judges whether the selected node is multiple nodes；
If so, the server obtains the corresponding superior node of each selected node, and the superior node is deposited
It stores up in corresponding first set, forms multiple first sets；
The server determines destination node according to the multiple first set；
The server obtains the basic data of the destination node as common base data.
Optionally:
The server determines that the corresponding selected node of the data acquisition request includes:
The server obtains the selected nodal information that the data acquisition request carries；
The server determines the corresponding selected node of the data acquisition request according to the selected nodal information.
Optionally:
The selected nodal information is organization number, settling time or organizational member number.
Optionally:
The server obtains the corresponding superior node of each selected node, and by superior node storage to corresponding the
In one set, forming multiple first sets includes:
For each selected node, the server is using the selected node as judging node
1) server stores the judgement node into corresponding first set；
2) server obtains the immediate superior node of the judgement node；
3) server judges whether the immediate superior node is root node；
If so, by root node storage into the first set；
If it is not, then using the immediate superior node as the judgement node re-execute the steps 1), 2) and 3) until
Until getting root node.
Optionally:
The server determines that destination node includes: according to the multiple first set
The server obtains the intersection of the multiple first set as objective result collection；
The server determines the destination node according to the objective result collection.
Optionally:
The server determines the destination node according to the objective result collection specifically:
The server traverses the objective result collection, concentrates the node of most junior as target section the objective result
Point.
Optionally:
The method also includes:
If the selected node is not multiple nodes, the server is using the selected node as destination node, touching
Sending out server described obtains the step of basic data of the destination node is as common base data.
Second aspect of the embodiment of the present invention provides a kind of server, comprising:
Receiving module, for receiving data acquisition request；
First determining module, for determining the corresponding selected section of the received data acquisition request of the receiving module
Point；
Judgment module, whether the selected node for judging that the determining module determines is multiple nodes；
Memory module is obtained, for obtaining each choosing when the judgment module determines that the selected node is multiple nodes
Determine the corresponding superior node of node, and superior node storage is formed multiple first into corresponding first set
Set；
Second determining module, the multiple first set for being obtained according to the acquisition memory module determine target section
Point；
Module is obtained, for obtaining the basic data for the destination node that second determining module determines as public
Basic data.
Optionally:
First determining module includes:
First acquisition unit, the selected nodal information carried for obtaining the data acquisition request；
First determination unit, for determining the corresponding selected section of the data acquisition request according to the selected nodal information
Point.
Optionally:
The acquisition memory module includes:
First processing units, for for each selected node, using the selected node as judging node
First storage unit for storing the judgement node, and triggers second acquisition unit；
Second acquisition unit for obtaining the immediate superior node of the judgement node, and triggers judging unit；
Judging unit, for judging whether the immediate superior node is root node, if so, triggering second storage
Unit, if it is not, then triggering the second processing unit；
The second processing unit, for using the immediate superior node as judging node, and the first storage unit of triggering；
Second storage unit, for storing the root node.
Optionally:
Second determining module includes:
Third acquiring unit, for obtaining the intersection of the multiple first set as objective result collection；
Second determination unit, for determining the destination node according to the objective result collection.
Optionally:
Second determination unit is specifically used for traversing the objective result collection, and the objective result is concentrated most junior
Node is 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 the corresponding whole superior nodes of selected node and form higher level's set, when there are multiple selected
When node, server can get multiple first sets, and the most junior of multiple selected nodes is determined according to multiple first sets
Public superior node as destination node, server is using the basic data of the destination node as the public of multiple selected nodes
Basic data, since the destination node is the public superior node of multiple selected node most juniors, i.e., the minimum of multiple selected nodes
Public superior node, so the common base data are to be able to satisfy multiple selected node demands and modify the least basis of number
Data, thus reduce corrupt data or omit a possibility that.
Detailed description of the invention
Fig. 1 is one 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 one 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 organization system node topology figure.
Specific embodiment
The embodiment of the invention provides a kind of data processing methods, for solving the problems, such as that multiple groups knit the determination of lower data.
In order to enable those skilled in the art to better understand the solution of the present invention, below in conjunction in the embodiment of the present invention
Attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is only
The embodiment of a part of the invention, instead of all the embodiments.Based on the embodiments of the present invention, ordinary skill people
The model that the present invention protects all should belong in member's every other embodiment obtained without making creative work
It encloses.
Description and claims of this specification and term " first ", " second ", " third " " in above-mentioned attached drawing
The (if present)s such as four " are to be used to distinguish similar objects, without being used to describe a particular order or precedence order.It should manage
The data that solution uses in this way are interchangeable under appropriate circumstances, so that the embodiments described herein can be in addition to illustrating herein
Or the sequence other than the content of description is implemented.In addition, term " includes " and " having " and their any deformation, it is intended that
Cover it is non-exclusive include, for example, containing the process, method, system, product or equipment of a series of steps or units need not limit
In step or unit those of is clearly listed, but may include be not clearly listed or for these process, methods, produce
The other step or units of product or equipment inherently.
Referring to Fig. 1, one embodiment of data processing method includes: in the embodiment of the present invention
101, server receives data acquisition request；
When user needs to obtain data by server, server will receive Client-initiated data acquisition request.
102, server determines the corresponding selected node of the data acquisition request；
After server receives data acquisition request, it can determine that the data acquisition request is corresponding by various modes
Selected node.
103, server judges whether the selected node is multiple nodes, if so, thening follow the steps 104；
After server determines the data acquisition request corresponding selected node, server judge the selected node whether be
Multiple nodes, if so, thening follow the steps 104.
104, server obtains the corresponding superior node of each selected node, and the superior node is stored to corresponding
In first set, multiple first sets are formed；
When server determines that the corresponding selected node of the data acquisition request is multiple nodes, server obtains each selected
The corresponding superior node of node, and by superior node storage into corresponding first set, i.e., each selectes node
A corresponding first set, to form multiple first sets.
105, server determines destination node according to multiple first set；
When server gets the corresponding superior node of each selected node, and by superior node storage to corresponding
In first set, after forming multiple first sets, server determines destination node according to multiple first set.
106, server obtains the basic data of the destination node as common base data.
After server determines destination node according to multiple first set, server obtains the basic number of the destination node
According to as common base data.
In the embodiment of the present invention, server can get the corresponding whole superior nodes of selected node and form higher level's collection
It closes, when there are multiple selected nodes, server can get multiple first sets, and be determined according to multiple first sets multiple
The public superior node of the most junior of selected node is as destination node, and server is using the basic data of the destination node as more
The common base data of a selected node are since the destination node is the public superior node of multiple selected node most juniors, i.e., more
The public superior node of minimum of a selected node, so the common base data are to be able to satisfy multiple selected node demands and repair
A possibility that changing the least basic data of number, therefore reducing corrupt data or omit.
In practical applications, server can determine the data by the selected nodal information carried in data acquisition request
The corresponding selected node of acquisition request, is further explained below:
Referring to Fig. 2, another embodiment of data processing method includes: in the embodiment of the present invention
201, server receives data acquisition request；
When user needs to obtain data by server, server will receive Client-initiated data acquisition request.
202, server obtains the selected nodal information carried in the data acquisition request；
After server receives data acquisition request, by parsing the data acquisition request, obtains the data acquisition and ask
Seek the selected nodal information of middle carrying.
It should be noted that the selected nodal information specifically may is that organization number, settling time or organizational member number,
It is understood that in practical applications, which is also possible to other information, specifically herein without limitation.
It is understood that in practical applications, server can also get the data acquisition by other means and ask
The selected nodal information of middle carrying is sought, specifically herein without limitation.
203, server selectes nodal information according to this and determines the corresponding selected node of the data acquisition request；
After server gets the selected nodal information carried in the data acquisition request, server is according to the selected section
Point information determines the corresponding selected node of the data acquisition request.
204, server judges whether the selected node is multiple nodes, if so, 205 are thened follow the steps, if it is not, then holding
Row step 207；
After server determines the data acquisition request corresponding selected node, server judge the selected node whether be
Multiple nodes, if so, 205 are thened follow the steps, if it is not, thening follow the steps 207.
205, server obtains the corresponding superior node of each selected node, and the superior node is stored to corresponding
In first set, multiple first sets are formed；
When server determines that the corresponding selected node of the data acquisition request is multiple nodes, server obtains each selected
The corresponding superior node of node, and superior node storage is formed into multiple first sets into corresponding first set.
206, server determines destination node according to multiple first set, executes step 208；
When server gets the corresponding superior node of each selected node, and by superior node storage to corresponding
In first set, after forming multiple first sets, server determines destination node according to multiple first set, executes step
208。
207, this is selected node as destination node by server, executes step 208；
When server determines that the corresponding selected node of the data acquisition request is not multiple nodes, server selectes this
Node executes step 208 as destination node.
208, server obtains the basic data of the destination node as common base data.
After server determines destination node, server obtains the basic data of the destination node as common base number
According to.
In the embodiment of the present invention, server can get the corresponding whole superior nodes of selected node and form higher level's collection
It closes, when there are multiple selected nodes, server can get multiple first sets, and be determined according to multiple first sets multiple
The public superior node of the most junior of selected node is as destination node, and server is using the basic data of the destination node as more
The common base data of a selected node are since the destination node is the public superior node of multiple selected node most juniors, i.e., more
The public superior node of minimum of a selected node, so the common base data are to be able to satisfy multiple selected node demands and repair
A possibility that changing the least basic data of number, therefore reducing corrupt data or omit.
Secondly, present embodiments providing a kind of mode of determining selected node of server, i.e., by data acquisition request
The selected nodal information carried determines, increases the alternative of scheme.
It should be noted that in the above-described embodiments, step 207 is optional step, when server determines the data acquisition
When to request corresponding selected node be not multiple nodes, server can also carry out other processing according to the prior art, it is specific this
Place is without limitation.
In practical applications, server obtains the corresponding superior node of each selected node, and the superior node is deposited
It stores up in corresponding first set, the specific implementation for forming multiple first sets may is that
Referring to Fig. 3, another embodiment of data processing method includes: in the embodiment of the present invention
301, server receives data acquisition request；
When user needs to obtain data by server, server will receive Client-initiated data acquisition request.
302, server determines the corresponding selected node of the data acquisition request；
After server receives data acquisition request, it can be believed by the selected node carried in the data acquisition request
Breath determines corresponding selected node, and specific implementation can be similar to embodiment shown in Fig. 2, and details are not described herein again.
It should be noted that server can also determine the corresponding selected section of the data acquisition request by other means
Point, specifically herein without limitation.
303, server judges whether the selected node is multiple nodes, if so, 304 are thened follow the steps, if it is not, then holding
Row step 311；
After server determines the data acquisition request corresponding selected node, server judge the selected node whether be
Multiple nodes, if so, 304 are thened follow the steps, if it is not, thening follow the steps 311.
304, for each selected node, this is selected node as judging node by server；
When server determines that the corresponding selected node of data acquisition request is multiple nodes, for each selected node,
This is selected node as judging node by server.
305, server stores the judgement node into corresponding first set, executes step 306；
After server is using selected node as node is judged, server stores the judgement node to corresponding first collection
In conjunction.
306, server obtains the immediate superior node of the judgement node, executes step 307；
When server will judge node storage to corresponding first set after, server obtain the judgement node it is direct on
Grade node.
It should be noted that server can get the immediate superior node of the judgement node by various modes, tool
Body is herein without limitation.
307, server judges whether the immediate superior node is root node, if so, 308 are thened follow the steps, if it is not, then holding
Row step 309；
After server gets the immediate superior node of the judgement node, whether server judges the immediate superior node
For root node, if so, 308 are thened follow the steps, if it is not, thening follow the steps 309.
308, server stores the root node into the first set, executes step 310；
When server determines that the immediate superior node is root node, root node storage is arrived the first set by server
In, execute step 310.
309, server executes step 305 using the immediate superior node as node is judged；
When server determines that the immediate superior node is not root node, server is using the immediate superior node as judgement
Node executes step 305.
310, server determines destination node according to multiple first set, executes step 312；
When server gets the corresponding superior node of each selected node, and by superior node storage to corresponding
In first set, after forming multiple first sets, server determines destination node according to multiple first set.
311, this is selected node as destination node by server, executes step 312；
When server determines that the corresponding selected node of the data acquisition request is not multiple nodes, server selectes this
Node executes step 312 as destination node.
312, server obtains the basic data of the destination node as common base data.
After server determines destination node, server obtains the basic data of the destination node as common base number
According to.
In the embodiment of the present invention, server can get the corresponding whole superior nodes of selected node and form higher level's collection
It closes, when there are multiple selected nodes, server can get multiple first sets, and be determined according to multiple first sets multiple
The public superior node of the most junior of selected node is as destination node, and server is using the basic data of the destination node as more
The common base data of a selected node are since the destination node is the public superior node of multiple selected node most juniors, i.e., more
The public superior node of minimum of a selected node, so the common base data are to be able to satisfy multiple selected node demands and repair
A possibility that changing the least basic data of number, therefore reducing corrupt data or omit.
Secondly, present embodiments providing a kind of server obtains the corresponding superior node of multiple selected nodes, formed
The method of multiple first sets increases the flesh alternative of scheme.
It should be noted that in the above-described embodiments, step 311 is optional step, when server determines the data acquisition
When to request corresponding selected node be not multiple nodes, server can also carry out other processing according to the prior art, it is specific this
Place is without limitation.
In practical applications, server determines that destination node specifically can be by multiple first according to multiple first sets
Intersection of sets collection determines, is further explained below:
Referring to Fig. 4, another embodiment of data processing method includes: in the embodiment of the present invention
401, server receives data acquisition request；
When user needs to obtain data by server, server will receive Client-initiated data acquisition request.
402, server determines the corresponding selected node of the data acquisition request；
After server receives data acquisition request, it can be believed by the selected node carried in the data acquisition request
Breath determines corresponding selected node, and specific implementation can be similar to embodiment shown in Fig. 2, and details are not described herein again.
It should be noted that server can also determine the corresponding selected section of the data acquisition request by other means
Point, specifically herein without limitation.
403, server judges whether the selected node is multiple nodes, if so, 404 are thened follow the steps, if it is not, then holding
Row step 407；
After server determines the data acquisition request corresponding selected node, server judge the selected node whether be
Multiple nodes, if so, 404 are thened follow the steps, if it is not, thening follow the steps 407.
404, server obtains the corresponding superior node of each selected node, and the superior node is stored to corresponding
In first set, multiple first sets are formed；
When server determines that the corresponding selected node of the data acquisition request is multiple nodes, server obtains each selected
The corresponding superior node of node, and superior node storage is formed into multiple first sets into corresponding first set,
Concrete methods of realizing can be similar to embodiment shown in Fig. 3, and details are not described herein again.
405, server obtains the intersection of multiple first sets as objective result collection；
When server obtains the corresponding superior node of each selected node, and by superior node storage to corresponding the
In one set, after forming multiple first sets, server obtains the intersection of multiple first sets as objective result collection.
406, server determines destination node according to the objective result collection, executes step 408；
After server obtains the intersection of multiple first sets as objective result collection, server is according to the objective result collection
It determines destination node, executes step 408.
It should be noted that server determines that the mode of destination node may is that server time according to the objective result collection
The objective result collection is gone through, concentrates the node of most junior as destination node the objective result, it is to be understood that server
Destination node can be determined by other means, specifically herein without limitation.
407, this is selected node as destination node by server, executes step 408；
When server determines that the corresponding selected node of the data acquisition request is not multiple nodes, server selectes this
Node executes step 407 as destination node.
408, server obtains the basic data of the destination node as common base data.
After server determines destination node, server obtains the basic data of the destination node as common base number
According to.
In the embodiment of the present invention, server can get the corresponding whole superior nodes of selected node and form higher level's collection
It closes, when there are multiple selected nodes, server can get multiple first sets, and be determined according to multiple first sets multiple
The public superior node of the most junior of selected node is as destination node, and server is using the basic data of the destination node as more
The common base data of a selected node are since the destination node is the public superior node of multiple selected node most juniors, i.e., more
The public superior node of minimum of a selected node, so the common base data are to be able to satisfy multiple selected node demands and repair
A possibility that changing the least basic data of number, therefore reducing corrupt data or omit.
Secondly, present embodiments providing a kind of implementation method for determining destination node according to multiple first sets, that is, pass through
The intersection of multiple first sets is obtained, and destination node is determined according to the intersection, increases the alternative of scheme.
It should be noted that in the above-described embodiments, step 407 is optional step, when server determines the data acquisition
When to request corresponding selected node be not multiple nodes, server can also carry out other processing according to the prior art, it is specific this
Place is without limitation.
For ease of understanding, data processing method in the embodiment of the present invention is carried out with a concrete application scene below detailed
Description, specific:
It is assumed that the organization system of certain company is tree-like institutional framework, as shown in figure 9, its root node is A, there are two A nodes
Direct downstream site is respectively B node and D node, and it is C node that wherein B node, which has a direct downstream site, and there are two D nodes
Direct downstream site is respectively E node and F node, and F node is again G node and H node respectively there are two direct downstream site.
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, determined by carrying selected nodal information in the data acquisition request
The corresponding selected node of the data acquisition request is E node and G node, while server determines that the data acquisition request is corresponding
Selected node be multiple nodes, then be directed to E node and G node, server obtains E node respectively and G node is corresponding
Superior node, and superior node storage is formed into two first sets into corresponding first set, specifically: E node pair
The first set [D, A] answered；The corresponding higher level of G node gathers [F, D, A].
Server is according to two first sets, by taking the intersection of two first sets to obtain objective result collection: [D, A],
Server traverses objective result collection [D, A], since the tissue of A is superior to D, server using D node as destination node,
Later, server obtains common base data of the basic data of D node as selected node E node and G node.
Data processing method in the embodiment of the present invention is described above, below to the service in the embodiment of the present invention
Device is described, specific:
Referring to Fig. 5, one embodiment of server includes: in the embodiment of the present invention
Receiving module 501, for receiving data acquisition request；
First determining module 502, for determining the corresponding selected node of the received data acquisition request of receiving module 501；
Judgment module 503, whether the selected node for judging that determining module 502 determines is multiple nodes；
Memory module 504 is obtained, for obtaining each selected when judgment module 503 determines that selected node is multiple nodes
The corresponding superior node of node, and superior node storage is formed into multiple first sets into corresponding first set；
Second determining module 505, multiple first sets for being obtained according to acquisition memory module 504 determine target section
Point；
Module 506 is obtained, for obtaining the basic data for the destination node that the second determining module 505 determines as public base
Plinth data.
In the embodiment of the present invention, after receiving module 501 receives data acquisition request, the first determining module 502 can
Determine the corresponding selected node of the data acquisition request, judgment module 503 can judge whether the selected node is multiple nodes,
If so, the corresponding superior node of each selected node can be obtained by obtaining memory module 504, and the superior node storage is arrived
In corresponding first set, multiple first sets are formed, the second determining module 505 can be according to multiple first set target sections
Point, acquisition module 506 can obtain the basic data of the destination node as common base data, since the destination node is more
The public superior node of a selected node most junior, i.e., the public superior node of minimum of multiple selected nodes, so the common base
Data be able to satisfy multiple selected node demands and modify the least basic data of number, therefore reduce corrupt data or
A possibility that omission.
Referring to Fig. 6, another embodiment of server includes: in the embodiment of the present invention
Receiving module 601, for receiving data acquisition request；
First determining module 602, for determining the corresponding selected node of the received data acquisition request of receiving module 601；
Judgment module 603, whether the selected node for judging that determining module 602 determines is multiple nodes；
Memory module 604 is obtained, for obtaining each selected when judgment module 603 determines that selected node is multiple nodes
The corresponding superior node of node, and superior node storage is formed into multiple first sets into corresponding first set；
Second determining module 605, multiple first sets for being obtained according to acquisition memory module 604 determine target section
Point；
Module 606 is obtained, for obtaining the basic data for the destination node that the second determining module 605 determines as public base
Plinth data；
Wherein, the first determining module 602 specifically includes:
First acquisition unit 6021, for obtaining the selected nodal information of data acquisition request carrying；
First determination unit 6022 determines the corresponding selected section of the data acquisition request for selecting nodal information according to this
Point.
In the embodiment of the present invention, after receiving module 601 receives data acquisition request, in the first determining module 602
First acquisition unit 6021 can enough get the selected nodal information of data acquisition request carrying, the first determination unit 6022
Nodal information can be selected according to this determines that the corresponding selected node of the data acquisition request, judgment module 603 can judge this
Whether selected node is multiple nodes, if so, the corresponding higher level's section of each selected node can be obtained by obtaining memory module 604
Point, and superior node storage is formed into multiple first sets, the second determining module 605 can into corresponding first set
According to multiple first set destination nodes, the basic data of the destination node can be obtained as common base by obtaining module 606
Data, since the destination node is the public superior node of multiple selected node most juniors, i.e., the minimum of multiple selected nodes is public
Superior node, so the common base data are to be able to satisfy multiple selected node demands and modify the least basic number of number
According to, thus reduce corrupt data or omit a possibility that.
Referring to Fig. 7, another embodiment of server includes: in the embodiment of the present invention
Receiving module 701, for receiving data acquisition request；
First determining module 702, for determining the corresponding selected node of the received data acquisition request of receiving module 701；
Judgment module 703, whether the selected node for judging that determining module 702 determines is multiple nodes；
Memory module 704 is obtained, for obtaining each selected when judgment module 703 determines that selected node is multiple nodes
The corresponding superior node of node, and superior node storage is formed into multiple first sets into corresponding first set；
Second determining module 705, multiple first sets for being obtained according to acquisition memory module 704 determine target section
Point；
Module 706 is obtained, for obtaining the basic data for the destination node that the second determining module 705 determines as public base
Plinth data；
Wherein, memory module 704 is obtained to specifically include:
This is selected node as judging node for for each selected node by first processing units 7041
First storage unit 7042 for storing the judgement node, and triggers second acquisition unit 7043；
Second acquisition unit 7043 for obtaining the immediate superior node of the judgement node, and triggers judging unit 7044；
Judging unit 7044, for judging whether the immediate superior node is root node, if so, triggering described second is deposited
Storage unit 7046, if it is not, then triggering the second processing unit 7045；
The second processing unit 7045, for using the immediate superior node as judging node, and the first storage unit of triggering
7042；
Second storage unit 7046, for storing the root node.
In the embodiment of the present invention, after receiving module 701 receives data acquisition request, the first determining module 702 can
Determine the corresponding selected node of the data acquisition request, judgment module 703 can judge whether the selected node is multiple nodes,
If so, the corresponding superior node of each selected node can be obtained by obtaining memory module 704, and the superior node storage is arrived
In corresponding first set, multiple first sets are formed, the second determining module 705 can be according to multiple first set target sections
Point, acquisition module 706 can obtain the basic data of the destination node as common base data, since the destination node is more
The public superior node of a selected node most junior, i.e., the public superior node of minimum of multiple selected nodes, so the common base
Data be able to satisfy multiple selected node demands and modify the least basic data of number, therefore reduce corrupt data or
A possibility that omission.
For ease of understanding, below with a concrete application scene to the number between each module of server in the embodiment of the present invention
It is described in detail according to interactive process, specific:
When user needs to obtain data by server, server receiving module 701 will receive Client-initiated number
According to acquisition request.
After receiving module 701 receives data acquisition request, the first determining module 702 can be asked by the data acquisition
The selected nodal information of middle carrying is asked to determine corresponding selected node.
It should be noted that the first determining module 702 can also determine that the data acquisition request is corresponding by other means
Selected node, specifically herein without limitation.
After the determining data acquisition request of the first determining module 702 corresponding selected node, the judgement of judgment module 703 should
Whether selected node is multiple nodes, if so, triggering obtains memory module 704.
When judgment module 703 determines that the corresponding selected node of data acquisition request is multiple nodes, for each selected
Node obtains in memory module 704 first processing units 7041 for this and selectes node as judging node.
After server first processing units 7041 are using selected node as node is judged, the first storage unit 7042 should
Judge node storage into corresponding first set.
When the first storage unit 7042 will judge node storage to corresponding first set after, second acquisition unit 7043 obtains
Take the immediate superior node of the judgement node.
It should be noted that server can get the immediate superior node of the judgement node by various modes, tool
Body is herein without limitation.
After second acquisition unit 7043 gets the immediate superior node of the judgement node, the judgement of judging unit 7044 should
Whether immediate superior node is root node, if so, the second storage unit 7046 of triggering, if it is not, then triggering the second processing unit
7045。
When judging unit 7044 determines that the immediate superior node is root node, the second storage unit 7046 is by the root node
It stores in the first set, triggers the second determining module 705.
When judging unit 7044 determines that the immediate superior node is not root node, the second processing unit 7045 is direct by this
Superior node triggers the first storage unit 7042 as node is judged.
The corresponding superior node of each selected node is got when obtaining memory module 704, and the superior node is deposited
It stores up in corresponding first set, after forming multiple first sets, the second determining module 705 is determined according to multiple first set
Destination node.
After the second determining module 705 determines destination node, the basic data work that module 706 obtains the destination node is obtained
For common base data.
In the embodiment of the present invention, server can get the corresponding whole superior nodes of selected node and form higher level's collection
It closes, when there are multiple selected nodes, server can get multiple first sets, and be determined according to multiple first sets multiple
The public superior node of the most junior of selected node is as destination node, and server is using the basic data of the destination node as more
The common base data of a selected node are since the destination node is the public superior node of multiple selected node most juniors, i.e., more
The public superior node of minimum of a selected node, so the common base data are to be able to satisfy multiple selected node demands and repair
A possibility that changing the least basic data of number, therefore reducing corrupt data or omit.
Referring to Fig. 8, another embodiment of server includes: in the embodiment of the present invention
Receiving module 801, for receiving data acquisition request；
First determining module 802, for determining the corresponding selected node of the received data acquisition request of receiving module 801；
Judgment module 803, whether the selected node for judging that determining module 802 determines is multiple nodes；
Memory module 804 is obtained, for obtaining each selected when judgment module 803 determines that selected node is multiple nodes
The corresponding superior node of node, and superior node storage is formed into multiple first sets into corresponding first set；
Second determining module 805, multiple first sets for being obtained according to acquisition memory module 804 determine target section
Point；
Module 806 is obtained, for obtaining the basic data for the destination node that the second determining module 805 determines as public base
Plinth data；
Wherein, the second determining module 805 specifically includes:
Third acquiring unit 8051, for obtaining the intersection of multiple first sets as objective result collection；
Second determination unit 8052, for determining destination node according to the objective result collection；
Wherein, the second determination unit 8052 is specifically used for traversing the objective result collection, which is concentrated most junior
Node as destination node.
In the embodiment of the present invention, after receiving module 801 receives data acquisition request, the first determining module 802 can
Determine the corresponding selected node of the data acquisition request, judgment module 803 can judge whether the selected node is multiple nodes,
If so, the corresponding superior node of each selected node can be obtained by obtaining memory module 804, and the superior node storage is arrived
In corresponding first set, multiple first sets are formed, the second determining module 805 can be according to multiple first set target sections
Point, acquisition module 806 can obtain the basic data of the destination node as common base data, since the destination node is more
The public superior node of a selected node most junior, i.e., the public superior node of minimum of multiple selected nodes, so the common base
Data be able to satisfy multiple selected node demands and modify the least basic data of number, therefore reduce corrupt data or
A possibility that omission.
It is apparent to those skilled in the art that for convenience and simplicity of description, the system of foregoing description,
The specific work process of device and unit, can refer to corresponding processes in the foregoing method embodiment, and details are not described herein.
In several embodiments provided herein, it should be understood that disclosed system, device and method can be with
It realizes by another way.For example, the apparatus embodiments described above are merely exemplary, for example, the unit
It divides, only a kind of logical function partition, there may be another division manner in actual implementation, such as multiple units or components
It can be combined or can be integrated into another system, or some features can be ignored or not executed.Another point, it is shown or
The mutual coupling, direct-coupling or communication connection discussed can be through some interfaces, the indirect coupling of device or unit
It closes or communicates to connect, can be electrical property, mechanical or other forms.
The unit as illustrated by the separation member may or may not be physically separated, aobvious as unit
The component shown may or may not be physical unit, it can and it is in one place, or may be distributed over multiple
In network unit.It can select some or all of unit therein according to the actual needs to realize the mesh of this embodiment scheme
's.
It, can also be in addition, the functional units in various embodiments of the present invention may be integrated into one processing unit
It is that each unit physically exists alone, can also be integrated in one unit with two or more units.Above-mentioned integrated list
Member both can take the form of hardware realization, can also realize in the form of software functional units.
If the integrated unit is realized in the form of SFU software functional unit and sells or use as independent product
When, it can store in a computer readable storage medium.Based on this understanding, technical solution of the present invention is substantially
The all or part of the part that contributes to existing technology or the technical solution can be in the form of software products in other words
It embodies, which is stored in a storage medium, including some instructions are used so that a computer
Equipment (can be personal computer, server or the network equipment etc.) executes the complete of each embodiment the method for the present invention
Portion or part steps.And storage medium above-mentioned includes: USB flash disk, mobile hard disk, read-only memory (ROM, Read-Only
Memory), random access memory (RAM, Random Access Memory), magnetic or disk etc. are various can store journey
The medium of sequence code.
The above, the above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although referring to before
Stating embodiment, invention is explained in detail, those skilled in the art should understand that: it still can be to preceding
Technical solution documented by each embodiment is stated to modify or equivalent replacement of some of the technical features；And these
It modifies or replaces, the spirit and scope for technical solution of various embodiments of the present invention that it does not separate the essence of the corresponding technical solution.
Claims (8)
1. a kind of data processing method characterized by comprising
Server receives data acquisition request；
The server determines the corresponding selected node of the data acquisition request；
The server judges whether the selected node is multiple nodes；
If so, the server obtains the corresponding all superior nodes of each selected node, and by each selected node
Corresponding all superior node storages form multiple first sets into first set；
The server obtains the intersection of the multiple first set as objective result collection；
The server traverses the objective result collection, concentrates the node of most junior as destination node the objective result；
The server obtains the basic data of the destination node as common base data.
2. data processing method according to claim 1, which is characterized in that the server determines that the data acquisition is asked
The corresponding selected node is asked to include:
The server obtains the selected nodal information that the data acquisition request carries；
The server determines the corresponding selected node of the data acquisition request according to the selected nodal information.
3. data processing method according to claim 2, which is characterized in that the selected nodal information be organization number,
Settling time or organizational member number.
4. data processing method according to claim 1, which is characterized in that it is corresponding that the server obtains each selected node
Superior node, and by the superior node storage into corresponding first set, forming multiple first sets includes:
For each selected node, the server is using the selected node as judging node
1) server stores the judgement node into corresponding first set；
2) server obtains the immediate superior node of the judgement node；
3) server judges whether the immediate superior node is root node；
If so, by root node storage into the first set；
If it is not, then re-executeing the steps 1), 2) and 3) using the immediate superior node as the judgement node until obtaining
Until root node.
5. data processing method according to any one of claim 1 to 4, which is characterized in that the method also includes:
If the selected node is not multiple nodes, the server triggers institute using the selected node as destination node
It states server and obtains the step of basic data of the destination node is as common base data.
6. a kind of server characterized by comprising
Receiving module, for receiving data acquisition request；
First determining module, for determining the corresponding selected node of the received data acquisition request of the receiving module；
Judgment module, whether the selected node for judging that the determining module determines is multiple nodes；
Memory module is obtained, for obtaining each selected section when the judgment module determines that the selected node is multiple nodes
The corresponding all superior nodes of point, and the corresponding all superior nodes storages of each selected node are collected to first
In conjunction, multiple first sets are formed；
Second determining module, the intersection for obtaining the multiple first set traverse the target knot as objective result collection
The objective result is concentrated the node of most junior as destination node by fruit collection；
Module is obtained, for obtaining the basic data for the destination node that second determining module determines as common base
Data.
7. server according to claim 6, which is characterized in that first determining module includes:
First acquisition unit, the selected nodal information carried for obtaining the data acquisition request；
First determination unit, for determining the corresponding selected node of the data acquisition request according to the selected nodal information.
8. server according to claim 6, which is characterized in that the acquisition memory module includes:
First processing units, for for each selected node, using the selected node as judging the first storage unit of node,
For storing the judgement node, and trigger second acquisition unit；
Second acquisition unit for obtaining the immediate superior node of the judgement node, and triggers judging unit；
Judging unit, for judging whether the immediate superior node is root node, if so, the second storage unit of triggering, if
It is no, then trigger the second processing unit；
The second processing unit, for using the immediate superior node as judging node, and the first storage unit of triggering；
Second storage unit, for storing the root 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 CN105721527A (en) | 2016-06-29 |
| CN105721527B true 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) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109327484B (en) * | 2017-07-31 | 2021-09-28 | 北京嘀嘀无限科技发展有限公司 | Method and device for acquiring characteristic value set, server and storage medium |
| CN109189728B (en) * | 2018-07-18 | 2022-08-12 | 深圳市网心科技有限公司 | Intelligent hardware device, magnetic disk data processing method and storage medium |
| CN110008197B (en) * | 2019-04-12 | 2020-07-07 | 苏州浪潮智能科技有限公司 | Data processing method and system, electronic equipment and storage medium |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2006127229A (en) * | 2004-10-29 | 2006-05-18 | Toshiba Corp | Structured document retrieval system, method for retrieving structured document and program |
| CN100589546C (en) * | 2006-09-15 | 2010-02-10 | 中兴通讯股份有限公司 | 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 |
| CN102035815B (en) * | 2009-09-29 | 2013-04-24 | 华为技术有限公司 | Data acquisition method, access node and system |
| CN102307221A (en) * | 2011-03-25 | 2012-01-04 | 国云科技股份有限公司 | Cloud storage system and implementation method thereof |
| CN103518364B (en) * | 2013-03-19 | 2016-03-09 | 华为技术有限公司 | The data-updating method of distributed memory system and server |
| CN103279302B (en) * | 2013-05-30 | 2016-06-15 | 华为技术有限公司 | A kind of methods of exhibiting of individual-layer data and device |
-
2014
- 2014-12-04 CN CN201410733900.7A patent/CN105721527B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN105721527A (en) | 2016-06-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105204927B (en) | For the application collating unit of terminal device and using aligning method | |
| CN108322502A (en) | Method, gateway system and storage medium for equalization server load | |
| CN105162875B (en) | Big data group method for allocating tasks and device | |
| CN103631933B (en) | Distributed duplication elimination system-oriented data routing method | |
| CN103229487A (en) | Partition balance method, device and server in distributed storage system | |
| CN109064243A (en) | Source of houses searching method | |
| CN105095313B (en) | A kind of data access method and equipment | |
| CN102831170A (en) | Pushing method and device of event information | |
| CN109739890A (en) | Data processing method, device and equipment | |
| CN105721527B (en) | A kind of data processing method and server | |
| CN104125303B (en) | Reading and writing data requesting method, client and system | |
| CN110276060A (en) | The method and device of data processing | |
| CN110020086A (en) | A kind of user draws a portrait querying method and device | |
| CN109740034A (en) | The case-involving information query method of enterprise and device based on graphic data base | |
| CN109462631A (en) | Data processing method, device, storage medium and electronic device | |
| CN109783757A (en) | Render method and device, the system, storage medium, electronic device of webpage | |
| CN109685336A (en) | Collection task distribution method, device, computer equipment and storage medium | |
| CN105871955A (en) | Distributed file system-based processing method, server and client | |
| CN110083504B (en) | Running state monitoring method and device for distributed tasks | |
| CN104994179B (en) | A kind of data processing method and server | |
| CN109150981A (en) | Block chain network network-building method, device, equipment and computer readable storage medium | |
| CN103793469A (en) | Data inquiry statistics method and data inquiry statistics system | |
| CN105335362B (en) | The processing method and system of real time data, instant disposal system for treating | |
| CN107464330A (en) | The reminding method and system of dining room queueing message | |
| CN104317863A (en) | License number inquiry method and system |
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 |