CN103430178A - Method, apparatus and product of data updating - Google Patents
Method, apparatus and product of data updating Download PDFInfo
- Publication number
- CN103430178A CN103430178A CN2013800000645A CN201380000064A CN103430178A CN 103430178 A CN103430178 A CN 103430178A CN 2013800000645 A CN2013800000645 A CN 2013800000645A CN 201380000064 A CN201380000064 A CN 201380000064A CN 103430178 A CN103430178 A CN 103430178A
- Authority
- CN
- China
- Prior art keywords
- node
- updated
- version information
- root node
- renewal
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
- G06F16/235—Update request formulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/18—File system types
- G06F16/185—Hierarchical storage management [HSM] systems, e.g. file migration or policies thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
- G06F16/2372—Updates performed during offline database operations
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Stored Programmes (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Information Transfer Between Computers (AREA)
Abstract
Embodiments of the invention provide a method, apparatus and product of data updating. The method comprises determining a root node of a node to be updated according to update information of a node, determining a mode to be updated through current version information of the root node, updating the node to be updated, updating historical version information of the root node, and updating the historical version information of the root node into the current version information. The update of the node to be updated will not cause the update of other trees, and the update efficiency is high.
Description
Technical field
The embodiment of the present invention relates to data processing technique, relates in particular to a kind of data-updating method and device and product.
Background technology
In file system, class file system or Database Systems; usually can adopt the data structure of b-tree (b-tree), b+ tree (b+tree) or b* tree (b*tree) class to come catalogue or the index information of storage system to catalogue or the index of system upgraded, the operations such as inquiry, insertion or deletion.
The data store organisation schematic diagram that Fig. 1 is file system, as shown in Figure 1, superblock (super block) comprises a b-tree, this b-tree is for example for storing the catalogue of certain file system, this b-tree comprises a root node (Root) for storing the root directory of this document system, comprise three node Z below root node, Z1 and Z2 are respectively used to store three one-level sub-directories under the root directory of this document system, node Z comprises a tree A, this tree A comprises three node Y, Y1 and Y2, be respectively used to store the secondary sub-directory under the one-level sub-directory of this document system, node Y comprises a tree C, this tree C comprises three nodes X, X1 and X2, be respectively used to store three grades of sub-directories under this secondary sub-directory, root node, node Z, tree A, node Y, in fact tree C and nodes X 2 are the node of b-tree, be followed successively by relationship between superior and subordinate.
Available technology adopting copy-on-write technology is carried out writing of data.For example, when three grades of sub-directories storing in need to be to nodes X are upgraded, be not the data in direct overlay node X, but the piece administration module in computing machine, storage space managed, at first to one of hard disk application the storage space identical with the X node size form nodes X ', by amended data write nodes X '.For guarantee to write nodes X ' in data inquired about, the operation such as deletion, further need to revise the superior node C of this nodes X, the pointer modified that is about to point in superior node C nodes X for point to nodes X '.But, also adopt the copy-on-write technology for the renewal of superior node C, not directly cover the data of root node, but first create a node C ', amended new data is write to ingress C '.Similarly, the corresponding superior node Y that continues to revise node C after node C changes, be about to point in superior node Y the pointer modified of node C for pointing to node C ', according to the copy-on-write technology, amended new data is write to the node Y ' of new establishment, by that analogy until be modified to root node.
Visible, based on existing data store organisation, while upgrading downstream site, can cause needs to upgrade the superior node of this downstream site, and the superior node of this superior node is until highest root node, therefore, the data of storing in this structure are modified, inquire about, are inserted or the efficiency while upgrading operation such as deletion very low.
Summary of the invention
The embodiment of the present invention provides a kind of data-updating method and device and product, inefficient problem while to solve, data being upgraded to operation.
First aspect, the embodiment of the present invention provides a kind of data-updating method, comprising:
The receiving node updating message, comprise key word sign, the root node name identification of node to be updated and upgrade operational order in described updating message, determine the root node of described node to be updated according to described root node name identification;
Determine the current version information of described root node, and determine described node to be updated by described current version information;
According to described renewal operation, upgrade described node to be updated;
Upgrade the old version information of the root node of described node to be updated, the new address information that comprises all next stage nodes of described root node in old version information after renewal, can determine the node to be updated after described renewal according to described new address information;
By the old version information updating of described root node, be current version information.
In conjunction with first aspect, in the first of first aspect, in possible implementation, according to described updating message, upgrade described node to be updated and comprise:
Create the first replica node, according to described renewal operation, the data content after the renewal of described node to be updated is updated to described the first replica node.
In conjunction with first aspect, at the second of first aspect in possible implementation, the old version information of the root node of the described node to be updated of described renewal, the new address information that comprises all next stage nodes of described root node in old version information after renewal, before can determining the node to be updated after described renewal according to described new address information, also comprise:
When the even higher level of node of described node to be updated is not root node, create the second replica node, described the second replica node, as the replica node of the even higher level of node of described node to be updated, is updated to described the second replica node by the address information after the renewal of described node to be updated.
In conjunction with the first of first aspect or first aspect, possible implementation or the possible implementation of the second of first aspect, in the third possible implementation of first aspect, determine the current version information of described root node, comprising:
According to the verification of the current version information of described root node and, whether the content of the described current version information of verification is complete, if, according to described renewal operation, upgrade described node to be updated, if not, the corresponding old version information of version number that update time is nearest as described current version information.
Second aspect, the embodiment of the present invention provides a kind of data update apparatus, comprising:
Receiving element, for the receiving node updating message, comprise key word sign, the root node name identification of node to be updated and upgrade operational order in described updating message, determine the root node of described node to be updated according to described root node name identification;
Determining unit, for determining the current version information of described root node, and determine described node to be updated by described current version information;
The first child node updating block, for according to described renewal operation, upgrade described node to be updated;
The root node updating block, for upgrading the old version information of root node of described node to be updated, the new address information that comprises all next stage nodes of described root node in old version information after renewal, can determine the node to be updated after described renewal according to described new address information; By the old version information updating of described root node, be current version information.
In conjunction with second aspect, in the first of second aspect in possible implementation,
The first child node updating block, specifically for creating the first replica node, be updated to described the first replica node according to described renewal operation by the data content after the renewal of described node to be updated.
In conjunction with second aspect, at the second of second aspect, in possible implementation, also comprise:
The second child node update module, for when the even higher level of node of described node to be updated is not root node, upgrade the old version information of the root node of described node to be updated at described root node updating block, the new address information that comprises all next stage nodes of described root node in old version information after renewal, before can determining the node to be updated after described renewal according to described new address information, create the second replica node, described the second replica node is as the replica node of the even higher level of node of described node to be updated, address information after the renewal of described node to be updated is updated to described the second replica node.
Possible implementation or the possible implementation of the second of second aspect in conjunction with the first of second aspect or second aspect, in the third possible implementation of second aspect,
Determining unit, specifically for the verification of the current version information according to described root node and, whether the content of the described current version information of verification is complete, if, according to described renewal operation, upgrade described node to be updated, if not, the corresponding old version information of the version number that update time is nearest is as described current version information.
The third aspect, the embodiment of the present invention provides a kind of data update apparatus, comprising:
Processor and storer, described memory stores is carried out instruction, when described data update apparatus operation, between described processor and described storer, communicate by letter, described processor is carried out described fill order and is made described data update apparatus carry out implementation as possible as the first of first aspect, first aspect to arbitrary possible data-updating method in the third possible implementation of first aspect.
Fourth aspect, the computer program that the embodiment of the present invention provides a kind of executing data to process, comprise the computer-readable recording medium of having stored program code, the instruction that described program code comprises is for carrying out implementation as possible as the first of first aspect, first aspect to the arbitrary possible data-updating method of the third possible implementation of first aspect.
The data-updating method that the embodiment of the present invention provides and device, by the receiving node updating message, determine the root node of node to be updated according to the root node name identification comprised in node updates message; Determine the current version information of root node, and determine node to be updated by current version information; According to upgrading operation, upgrade node to be updated; Upgrade the old version information of the root node of node to be updated, comprise the new address information of all next stage nodes of root node in the old version information after renewal, according to new address information, can determine the node to be updated after renewal; Be current version information by the old version information updating of root node, due to node to be updated is upgraded to operation, explicitly, only can cause the renewal of node to be updated place tree, can not cause the renewal to other tree, upgrade efficiency high.
The accompanying drawing explanation
In order to be illustrated more clearly in the embodiment of the present invention or technical scheme of the prior art, below will the accompanying drawing of required use in embodiment or description of the Prior Art be briefly described, apparently, accompanying drawing in the following describes is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain other accompanying drawings according to these accompanying drawings.
The data store organisation schematic diagram that Fig. 1 is file system;
The process flow diagram that Fig. 2 is data-updating method embodiment mono-of the present invention;
The data store organisation schematic diagram that Fig. 3 is the embodiment of the present invention two;
The structural representation that Fig. 4 is data update apparatus embodiment mono-of the present invention;
The structural representation that Fig. 5 is data update apparatus embodiment bis-of the present invention.
Embodiment
For the purpose, technical scheme and the advantage that make the embodiment of the present invention clearer, 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, although, described embodiment is the present invention's part embodiment, rather than whole embodiment.Embodiment based in the present invention, those of ordinary skills, not making under the creative work prerequisite the every other embodiment obtained, belong to the scope of protection of the invention.
The data-updating method of the present embodiment can adopt data update apparatus to realize, this data update apparatus can realize by the mode of hardware or software, and data update apparatus can be integrated in computing machine realizes data-updating method.
The process flow diagram that Fig. 2 is data-updating method embodiment mono-of the present invention, as shown in Figure 2, the data-updating method of the present embodiment comprises:
201, receiving node updating message, comprise key word sign, the root node name identification of node to be updated and upgrade operational order in described updating message, determine the root node of described node to be updated according to described root node name identification.
Particularly, data update apparatus receiving node updating message, comprise the renewal operational order of node to be updated in this updating message, and this particularly for example upgrades operational order: can be Update Table content, deletion of data content, the new data content of increase; Also comprise the root node name identification in this updating message, this root node name identification can be the title of the tree under node to be updated, the run after fame child node of the tree that is called the root node name identification of this node to be updated; The key word sign that also comprises node to be updated in this updating message, this key word sign is for identifying the corresponding key word of data content that needs to carry out the renewal operation of upgrading the operational order appointment, and data update apparatus can be determined the position of the root node of node to be updated according to the root node name identification.
202, determine the current version information of described root node, and determine described node to be updated by described current version information.
Particularly, the storage space of root node can be divided, for example the memory headroom of root node carried out to 2 equal portions, root node has 2 version informations, these two version informations can be distinguished by version number, to distinguish these 2 version informations, be current version information or old version information, determine the position of root node of node to be updated according to the root node name identification in above-mentioned 201 after, the version number of the version information by root node determines the current version information of this root node, and the address information comprised in the current version information according to this root node is determined this node to be updated.
203,, according to described updating message, upgrade described node to be updated.
Particularly, according to the key word sign comprised in updating message and renewal operational order, to in the node to be updated of determining in above-mentioned 202 when writing multiplexing mode pair and this key word identify corresponding data content and carry out and upgrade the indicated renewal of operational order and operate, Update Table content for example.
204, upgrade the old version information of the root node of described node to be updated, the new address information that comprises all next stage nodes of described root node in old version information after renewal, can determine the node to be updated after described renewal according to described new address information.
Particularly, new address information after node updates to be updated is updated in the old version information of root node of this node to be updated, making the old version information after the renewal of root node is that up-to-date version information is current version information, the new address information that comprises all next stage nodes of this root node in this current version information, can determine the node to be updated after renewal according to the address information in this current version information.
When root node has three and above version information, in a nearest old version information, upgraded.The mode of determining a nearest old version information can be definite by the version number of each version information, for example: the storage space of root node is divided into three equal parts, every a version information takies 1/3 storage space of the total storage space of root node, the version number of 3 parts of version informations is respectively 0, 1, 2, while upgrading for the first time the version information of this root node, in the old version information that it is 0 that information after renewal is stored in the version number of this root node, version number is become to 3 by 0, while upgrading next time, by in the old version information that to be stored in the version number of this root node be 1 of the information after upgrading, version number is become to 4 by 1, by that analogy.
When data update apparatus can be determined node to be updated by root node according to node updates message, at first data update apparatus can read the data head of all version informations of this superior node, the version number recorded in the comparing data head, using the corresponding version information of version number of the value maximum of version number as current version information, the what be new using the data content in this current version information as this superior node; Perhaps, if during each upgraded edition this shop, when on the basis of master this shop, cumulative value is negative, when the version number after upgrading diminishes successively, get the corresponding version information of version number of value minimum of version number as current version information, the what be new using the data content in this current version information as this superior node; Or, can also be according to the update time of each version information, using version number to approach the corresponding version information of version number of current time update time most as current version information.
By a plurality of version informations are set in root node, in the time of can avoiding occurring in data updating process when data update apparatus outage, cause the data content of current version information imperfect, thereby cause data update apparatus can't normally access the problem of the content of this superior node according to this current version information, store a plurality of version informations in root node after, even data update apparatus cuts off the power supply in data updating process, data update apparatus is in the content of upper this superior node of old version message reference that can also be by this superior node while once starting.In addition, before can also inquiring about as required current version information, the content of this node to be updated, for example, while carrying out destruction operation, can also access the data content in this node to be updated.
205, by the old version information updating of described root node, be current version information.
Particularly, if with version number sign version information, upgrade the version number in the old version information of root node, the version information that the version number after making to upgrade identifies this root node is up-to-date current version information.
In the present embodiment, by the receiving node updating message, determine the root node of node to be updated according to the root node name identification, determine the current version information of root node, and determine node to be updated by current version information, upgrade node to be updated according to upgrading operation, upgrade the old version information of the root node of node to be updated, the new address information that comprises all next stage nodes of root node in old version information after renewal, can determine the node to be updated after renewal according to new address information, due to node to be updated is upgraded to operation, explicitly, only can cause the renewal to the tree at node to be updated place, can not cause the renewal to other tree, renewal efficiency is high.
On the basis of above-described embodiment, further, according to updating message, upgrade described node to be updated and comprise: create the first replica node, according to described renewal operation, the data content after the renewal of described node to be updated is updated to described the first replica node.
Particularly, according to updating message, in the node to be updated of determining, to key word, identifying corresponding data content, carry out while upgrading the indicated renewal operation of operational order, create a new node, the replica node that this node is node to be updated will identify corresponding data content with key word and be upgraded according to the execution of upgrading operational order in this replica node.
On the basis of above-described embodiment, further, the old version information of the root node of the described node to be updated of described renewal, the new address information that comprises all next stage nodes of described root node in old version information after renewal, before can determining the node to be updated after described renewal according to described new address information, also comprise:
When the even higher level of node of described node to be updated is not root node, create the second replica node, described the second replica node, as the replica node of the even higher level of node of described node to be updated, is updated to described the second replica node by the address information after the renewal of described node to be updated;
Particularly, the data store organisation schematic diagram that Fig. 3 is the embodiment of the present invention two, as shown in Figure 3, node to be updated is X, the superior node of nodes X is M, node M is not the root node of C tree, now, the data content after nodes X to be updated is upgraded be stored in nodes X ' in, for by superior node M, can determine nodes X ', create one second replica node M ', the replica node that this second replica node M ' is node M, by nodes X ' address information be updated in the second replica node M '.
On the basis of above-described embodiment, further, the current version information of determining described root node comprises: according to the verification of the current version information of described root node and, whether the content of the described current version information of verification is complete, if, according to described renewal operation, upgrade described node to be updated, if not, the corresponding old version information of version number that update time is nearest as described current version information.
Particularly, can be whether complete according to the content of checksum test current version information while determining the current version information of root node, also can adopt in other embodiments content whether complete test of the algorithm of other check data integrality to current version information, using and avoid mistake that the data that are damaged are carried out to associative operation as latest version information, if through the content intact of verification current version information, according to the information in this current version information, determine node to be updated, if the content through verification current version information is imperfect, with the immediate old version information of current version information, test, determine with the immediate old version information of current version information and can judge by version number, for example: the version number of the version information of root node is respectively 4, 5, 6, the version information that version number is 6 is current version information, the version information that version number is 5 is and the immediate old version information of current version information, immediate old version information is tested and judged approaching old version information integrity, finally obtain complete old version information, and using this complete old version information as current version information, carry out the node updates operation according to this current version information.
One of ordinary skill in the art will appreciate that: realize that the hardware that all or part of step of said method embodiment can be relevant by programmed instruction completes, aforesaid program can be stored in a computer read/write memory medium, this program, when carrying out, is carried out the step that comprises said method embodiment; And aforesaid storage medium comprises: various media that can be program code stored such as ROM, RAM, magnetic disc or CDs.
The structural representation that Fig. 4 is data update apparatus embodiment mono-of the present invention, as shown in Figure 4, the data update apparatus 400 of the present embodiment comprises: receiving element 401, determining unit 402, the first child node updating block 403 and root node updating block 404, wherein:
Receiving element 401, for the receiving node updating message, comprises key word sign, the root node name identification of node to be updated and upgrades operational order in described updating message, determine the root node of described node to be updated according to described root node name identification;
Determining unit 402 is for determining the current version information of described root node, and determines described node to be updated by described current version information;
The first child node updating block 403, for according to described renewal operation, upgrades described node to be updated;
Root node updating block 404 is for the old version information of the root node that upgrades described node to be updated, the new address information that comprises all next stage nodes of described root node in old version information after renewal, can determine the node to be updated after described renewal according to described new address information; By the old version information updating of described root node, be current version information.
The data update apparatus of the present embodiment can be for the data-updating method of executing data update method embodiment mono-, and concrete executive mode and beneficial effect and data-updating method embodiment mono-are similar, please refer to data-updating method embodiment mono-, repeat no more herein.
Further, the first child node updating block 403, specifically for creating the first replica node, be updated to described the first replica node according to described renewal operation by the data content after the renewal of described node to be updated.
Further, data update apparatus 400 can also comprise: the second child node update module.
When the second child node update module can be not root node for the even higher level of node when described node to be updated, upgrade the old version information of the root node of described node to be updated at described root node updating block, the new address information that comprises all next stage nodes of described root node in old version information after renewal, before can determining the node to be updated after described renewal according to described new address information, create the second replica node, described the second replica node is as the replica node of the even higher level of node of described node to be updated, address information after the renewal of described node to be updated is updated to described the second replica node.
Further, determining unit 402 specifically can be for the verification of the current version information according to described root node and, whether the content of the described current version information of verification is complete, if, according to described renewal operation, upgrade described node to be updated, if not, the corresponding old version information of the version number that update time is nearest is as described current version information.
The structural representation that Fig. 5 is data update apparatus embodiment bis-of the present invention.As shown in Figure 5, the data update apparatus 500 of the present embodiment comprises at least one CPU 501, at least one interface 502 or other user interfaces 503, storer 504.Storer 504 may comprise the high-speed RAM storer, also may also comprise nonvolatile memory (English for non-volatile memory, hereinafter to be referred as NVM), for example at least one magnetic disk memory.Storer 504 optionally can comprise at least one memory storage, stores various codes etc., for realizing various basic businesses and processing hardware based task.
Wherein, CPU 501 carries out following action according to the indication of the code of storer 504 storages:
The receiving node updating message, comprise key word sign, the root node name identification of node to be updated and upgrade operational order in described updating message, determine the root node of described node to be updated according to described root node name identification;
Determine the current version information of described root node, and determine described node to be updated by described current version information;
According to described renewal operation, upgrade described node to be updated;
Upgrade the old version information of the root node of described node to be updated, the new address information that comprises all next stage nodes of described root node in old version information after renewal, can determine the node to be updated after described renewal according to described new address information;
By the old version information updating of described root node, be current version information.
Further, according to described updating message, upgrade described node to be updated and comprise:
Create the first replica node, according to described renewal operation, the data content after the renewal of described node to be updated is updated to described the first replica node.
Further, the old version information of the root node of the described node to be updated of described renewal, the new address information that comprises all next stage nodes of described root node in old version information after renewal, before can determining the node to be updated after described renewal according to described new address information, also comprise:
When the even higher level of node of described node to be updated is not root node, create the second replica node, described the second replica node, as the replica node of the even higher level of node of described node to be updated, is updated to described the second replica node by the address information after the renewal of described node to be updated.
Further, determine the current version information of described root node, comprising:
According to the verification of the current version information of described root node and, whether the content of the described current version information of verification is complete, if, according to described renewal operation, upgrade described node to be updated, if not, the corresponding old version information of version number that update time is nearest as described current version information.
The data update apparatus of the present embodiment can be for executing data update method embodiment mono-described data-updating method, concrete executive mode and beneficial effect and data-updating method embodiment mono-are similar, please refer to data-updating method embodiment mono-, repeat no more herein.
The computer program that the embodiment of the present invention also provides a kind of executing data to process, comprise the computer-readable recording medium of having stored program code, and the instruction that described program code comprises is for making data set updating device manner of execution.
Finally it should be noted that: above each embodiment, only in order to technical scheme of the present invention to be described, is not intended to limit; Although with reference to aforementioned each embodiment, the present invention is had been described in detail, those of ordinary skill in the art is to be understood that: its technical scheme that still can put down in writing aforementioned each embodiment is modified, or some or all of technical characterictic wherein is equal to replacement; And these modifications or replacement do not make the essence of appropriate technical solution break away from the scope of various embodiments of the present invention technical scheme.
Claims (10)
1. a data-updating method, is characterized in that, comprising:
The receiving node updating message, comprise key word sign, the root node name identification of node to be updated and upgrade operational order in described updating message, determine the root node of described node to be updated according to described root node name identification;
Determine the current version information of described root node, and determine described node to be updated by described current version information;
According to described renewal operation, upgrade described node to be updated;
Upgrade the old version information of the root node of described node to be updated, the new address information that comprises all next stage nodes of described root node in old version information after renewal, can determine the node to be updated after described renewal according to described new address information;
By the old version information updating of described root node, be current version information.
2. method according to claim 1, is characterized in that, according to described updating message, upgrades described node to be updated and comprise:
Create the first replica node, according to described renewal operation, the data content after the renewal of described node to be updated is updated to described the first replica node.
3. method according to claim 1, it is characterized in that, the old version information of the root node of the described node to be updated of described renewal, the new address information that comprises all next stage nodes of described root node in old version information after renewal, before can determining the node to be updated after described renewal according to described new address information, also comprise:
When the even higher level of node of described node to be updated is not root node, create the second replica node, described the second replica node, as the replica node of the even higher level of node of described node to be updated, is updated to described the second replica node by the address information after the renewal of described node to be updated.
4. according to claim 1 or 2 or 3 described methods, it is characterized in that, determine the current version information of described root node, comprising:
According to the verification of the current version information of described root node and, whether the content of the described current version information of verification is complete, if, according to described renewal operation, upgrade described node to be updated, if not, the corresponding old version information of version number that update time is nearest as described current version information.
5. a data update apparatus, is characterized in that, comprising:
Receiving element, for the receiving node updating message, comprise key word sign, the root node name identification of node to be updated and upgrade operational order in described updating message, determine the root node of described node to be updated according to described root node name identification;
Determining unit, for determining the current version information of described root node, and determine described node to be updated by described current version information;
The first child node updating block, for according to described renewal operation, upgrade described node to be updated;
The root node updating block, for upgrading the old version information of root node of described node to be updated, the new address information that comprises all next stage nodes of described root node in old version information after renewal, can determine the node to be updated after described renewal according to described new address information; By the old version information updating of described root node, be current version information.
6. device according to claim 5, is characterized in that,
The first child node updating block, specifically for creating the first replica node, be updated to described the first replica node according to described renewal operation by the data content after the renewal of described node to be updated.
7. device according to claim 5, is characterized in that, also comprises:
The second child node update module, for when the even higher level of node of described node to be updated is not root node, upgrade the old version information of the root node of described node to be updated at described root node updating block, the new address information that comprises all next stage nodes of described root node in old version information after renewal, before can determining the node to be updated after described renewal according to described new address information, create the second replica node, described the second replica node is as the replica node of the even higher level of node of described node to be updated, address information after the renewal of described node to be updated is updated to described the second replica node.
8. according to claim 5 or 6 or 7 described devices, it is characterized in that,
Determining unit, specifically for the verification of the current version information according to described root node and, whether the content of the described current version information of verification is complete, if, according to described renewal operation, upgrade described node to be updated, if not, the corresponding old version information of the version number that update time is nearest is as described current version information.
9. a data update apparatus, it is characterized in that, comprise: processor and storer, described memory stores is carried out instruction, when described data update apparatus operation, between described processor and described storer, communicate by letter, described processor is carried out described fill order and is made described data update apparatus carry out method as described as claim 1 to 4 any one.
10. the computer program that executing data is processed, comprise the computer-readable recording medium of having stored program code, and the instruction that described program code comprises is for carrying out described method as arbitrary as claim 1-4.
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/CN2013/071134 WO2014117337A1 (en) | 2013-01-30 | 2013-01-30 | Data updating method, device, and product |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103430178A true CN103430178A (en) | 2013-12-04 |
Family
ID=49652995
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2013800000645A Pending CN103430178A (en) | 2013-01-30 | 2013-01-30 | Method, apparatus and product of data updating |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN103430178A (en) |
| WO (1) | WO2014117337A1 (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104536785A (en) * | 2014-12-23 | 2015-04-22 | 北京国双科技有限公司 | Method and device for updating real-time system |
| CN105635216A (en) * | 2014-11-03 | 2016-06-01 | 华为软件技术有限公司 | Distributed application upgrade method, device and distributed system |
| CN108363545A (en) * | 2017-01-26 | 2018-08-03 | 华为技术有限公司 | A kind of data configuration method and data configuration device |
| CN109684339A (en) * | 2018-11-21 | 2019-04-26 | 金蝶软件（中国）有限公司 | Method of adjustment, device, computer equipment and the storage medium of supply and demand document |
| CN109788027A (en) * | 2018-12-13 | 2019-05-21 | 平安科技（深圳）有限公司 | Method of data synchronization, device, server and computer storage medium |
| CN110457332A (en) * | 2019-07-23 | 2019-11-15 | 中国平安财产保险股份有限公司 | A kind of information processing method and relevant device |
| CN111538864A (en) * | 2020-03-25 | 2020-08-14 | 新华三技术有限公司合肥分公司 | Method and device for reducing Buildrun consumption |
| CN117349301A (en) * | 2023-10-10 | 2024-01-05 | 天翼数字生活科技有限公司 | Mobile terminal application program data updating method, system and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1619533A (en) * | 2003-11-17 | 2005-05-25 | 鸿富锦精密工业（深圳）有限公司 | Flash memory document management system and method |
| CN101082915A (en) * | 2006-05-29 | 2007-12-05 | 陈鹰 | Storage and update method of browsers local page |
| US20090248758A1 (en) * | 2006-09-29 | 2009-10-01 | Aisin Aw Co. Ltd | Map update data supplying apparatus, version table, map data updating system, and map update data supplying method |
| CN101763415A (en) * | 2009-12-16 | 2010-06-30 | 北京握奇数据系统有限公司 | Method and device for generating B tree index of database |
-
2013
- 2013-01-30 WO PCT/CN2013/071134 patent/WO2014117337A1/en active Application Filing
- 2013-01-30 CN CN2013800000645A patent/CN103430178A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1619533A (en) * | 2003-11-17 | 2005-05-25 | 鸿富锦精密工业（深圳）有限公司 | Flash memory document management system and method |
| CN101082915A (en) * | 2006-05-29 | 2007-12-05 | 陈鹰 | Storage and update method of browsers local page |
| US20090248758A1 (en) * | 2006-09-29 | 2009-10-01 | Aisin Aw Co. Ltd | Map update data supplying apparatus, version table, map data updating system, and map update data supplying method |
| CN101763415A (en) * | 2009-12-16 | 2010-06-30 | 北京握奇数据系统有限公司 | Method and device for generating B tree index of database |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105635216A (en) * | 2014-11-03 | 2016-06-01 | 华为软件技术有限公司 | Distributed application upgrade method, device and distributed system |
| CN105635216B (en) * | 2014-11-03 | 2019-05-03 | 华为软件技术有限公司 | Upgrade method, equipment and the distributed system of Distributed Application |
| CN104536785A (en) * | 2014-12-23 | 2015-04-22 | 北京国双科技有限公司 | Method and device for updating real-time system |
| CN104536785B (en) * | 2014-12-23 | 2018-04-06 | 北京国双科技有限公司 | Real-time system update method and device |
| CN108363545A (en) * | 2017-01-26 | 2018-08-03 | 华为技术有限公司 | A kind of data configuration method and data configuration device |
| US11163553B2 (en) | 2017-01-26 | 2021-11-02 | Huawei Technologies Co., Ltd. | Data configuration method and data configuration apparatus |
| CN109684339B (en) * | 2018-11-21 | 2021-10-08 | 金蝶云科技有限公司 | Supply and demand document adjusting method and device, computer equipment and storage medium |
| CN109684339A (en) * | 2018-11-21 | 2019-04-26 | 金蝶软件（中国）有限公司 | Method of adjustment, device, computer equipment and the storage medium of supply and demand document |
| CN109788027A (en) * | 2018-12-13 | 2019-05-21 | 平安科技（深圳）有限公司 | Method of data synchronization, device, server and computer storage medium |
| CN110457332A (en) * | 2019-07-23 | 2019-11-15 | 中国平安财产保险股份有限公司 | A kind of information processing method and relevant device |
| CN110457332B (en) * | 2019-07-23 | 2023-08-22 | 中国平安财产保险股份有限公司 | Information processing method and related equipment |
| CN111538864A (en) * | 2020-03-25 | 2020-08-14 | 新华三技术有限公司合肥分公司 | Method and device for reducing Buildrun consumption |
| CN111538864B (en) * | 2020-03-25 | 2023-03-31 | 新华三技术有限公司合肥分公司 | Method and device for reducing Buildrun consumption |
| CN117349301A (en) * | 2023-10-10 | 2024-01-05 | 天翼数字生活科技有限公司 | Mobile terminal application program data updating method, system and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2014117337A1 (en) | 2014-08-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103430178A (en) | Method, apparatus and product of data updating | |
| CN103473067B (en) | Built-in Linux subregion and data restoration method, system and system development method | |
| US8108446B1 (en) | Methods and systems for managing deduplicated data using unilateral referencing | |
| WO2011024688A1 (en) | Firmware update system, and information apparatus, as well as program | |
| JP2007012058A (en) | File system for storing transaction records in flash-like media | |
| KR20070003578A (en) | File system having deferred verification of data integrity | |
| JP2007012060A (en) | File system having inverted hierarchical structure | |
| CN103077043B (en) | A kind of method of quick Start-up and operating performance Linux | |
| JP2007012054A (en) | Startup authentication of optimized file system integrity | |
| CN103617097A (en) | File recovery method and file recovery device | |
| US20110022601A1 (en) | Block level tagging with file level information | |
| CN105260270A (en) | Flash storage space dynamic recovery method and device | |
| CN106919477B (en) | Virtual disk analysis method and system | |
| CN103559139A (en) | Data storage method and device | |
| CN107111460A (en) | Deduplication Using Chunk Files | |
| CN101216789A (en) | Data update method, device and system | |
| CN104484240A (en) | Method and device for storing terminal data | |
| CN105302665A (en) | Improved copy-on-write snapshot method and system | |
| CN107391195A (en) | A kind of method that SSD FW upgradings are carried out under linux | |
| CN105069002A (en) | Flash memory file system and method using different types of storage media | |
| CN103902562A (en) | Method and device for upgrading terminal databases | |
| CN103558998A (en) | Data processing method and device | |
| CN102331920B (en) | Data processing method and device | |
| US9875046B2 (en) | Tape backup and restore in a disk storage environment with intelligent data placement | |
| CN102207905A (en) | System recovery method, storage media controller and storage 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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20131204 |
|
| RJ01 | Rejection of invention patent application after publication |