WO2012088767A1 - 基于树结构的海量数据存储装置及方法 - Google Patents
基于树结构的海量数据存储装置及方法 Download PDFInfo
- Publication number
- WO2012088767A1 WO2012088767A1 PCT/CN2011/002209 CN2011002209W WO2012088767A1 WO 2012088767 A1 WO2012088767 A1 WO 2012088767A1 CN 2011002209 W CN2011002209 W CN 2011002209W WO 2012088767 A1 WO2012088767 A1 WO 2012088767A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- tree structure
- data
- tree
- data information
- bit
- Prior art date
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2453—Query optimisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2246—Trees, e.g. B+trees
Definitions
- the present invention relates to a data storage device and method, and more particularly to a mass data storage device and method based on a tree structure. Background technique
- a container for example, a structure
- each data that is, each different data information is stored in a different container
- the plurality of containers are sequentially or Linked form storage.
- the storage space occupied by each different data information cannot be reused.
- the time complexity of the query operation is about 0 (n), and sometimes even reaches 0 (nlogn).
- the above existing technical solutions have the following problems:
- the amount of data to be stored is significantly increased in a specific application domain (for example, financial card number storage)
- the required storage space will increase in magnitude, thereby consuming a large amount of
- the time required for the query increases, which reduces the efficiency and performance of the entire application system
- the existing method requires the infrastructure of the container (for example, the definition of a structure) is adjusted, resulting in insufficient system expansion capability or a complicated expansion process.
- the present invention proposes a massive data storage device and method based on a tree structure.
- a massive data storage device based on a tree structure comprising:
- An input/output module for receiving request information from an application server and transmitting the request information to a main control module, and transmitting the result data or response information back to the application server;
- a data creation module for creating the tree structure based on instructions and initial data information from the main control module and storing the created tree structure in a memory, and pointing to the tree structure The pointer of the root node is transmitted back to the main control module;
- a data query module configured to complete a specified query process based on the instruction and data information from the main control module and based on a predetermined query rule for the tree structure, and transmit the query result back to the main Control module
- a data maintenance module configured to complete a maintenance operation for the tree structure according to an instruction and data information from the main control module, and transmit response information indicating a result of the operation back to the main control module;
- the memory is configured to store the tree structure
- a main control module configured to receive and parse request information transmitted by the input/output module, and construct a message including data information and an instruction according to the parsing result, and transmit the message to a corresponding Processing the module and transmitting the result data or response information returned by the processing module back to the input/output module.
- the data maintenance module further includes: a modifying unit, configured to query the tree structure according to an instruction and data information from the main control module, and modify the matching to The value of the corresponding node;
- the deleting unit is configured to query the tree structure according to an instruction and data information from the main control module 2, and change a value of a flag bit of the last node that is matched when the matching is successful;
- Adding a unit for using instructions and data information from the main control module Query the tree structure and create nodes that are not matched.
- the request information includes data information and/or operation command information.
- the tree structure is a decanc tree.
- each of the parent nodes in the decimal tree includes a plurality of pointers, each of which points to its respective child node.
- each of the nodes in the hex tree includes a data bit and a flag bit, wherein the data bit is used to store one bit of data corresponding to the data information, the flag The value of the bit is one of 0 and 1.
- the data bits and the flag bits of the root node of the decimal tree are both set to zero.
- the value of the flag bit of the node corresponding to the last data bit of the data information in the decimal tree is set to 1, and the flag bits of the remaining nodes in the decimal tree The value is set to 0.
- each node of the decimal tree is in a hierarchy in the tree structure corresponding to the order of each bit of the data information in the data information.
- a massive data storage method based on a tree structure includes the following steps:
- the method further comprises:
- the method further comprises:
- the step (A4) further comprises:
- the tree structure is a decanc tree.
- each of the parent nodes in the decimal tree includes a plurality of pointers, each of which points to its respective child node.
- each of the nodes in the decimal tree includes a data bit and a flag bit, wherein the data bit is used to store one bit of data corresponding to the data information, the flag The value of the bit is one of 0 and 1.
- the data bits of the root node of the decimal tree and the value of the flag bit are both set to zero.
- the value of the flag bit of the node corresponding to the last data bit of the data information in the decimal tree is set to 1, and the flag bits of the remaining nodes in the decimal tree The value is set to 0.
- each node of the decimal tree is in a hierarchy in the tree structure corresponding to the order of each bit of the data information in the data information
- the tree structure-based mass data storage device and method disclosed by the invention have the following advantages: easy to expand; save storage space; and can significantly improve query efficiency.
- FIG. 1 is a structural diagram of a mass data storage device based on a tree structure according to an embodiment of the present invention
- FIG. 2 is a schematic diagram of a tentree structure according to an embodiment of the present invention
- 3 is a flowchart of a tree structure-based mass data storage method according to an embodiment of the present invention
- the data storage device 1 is for storing mass data based on a tree structure.
- the data storage device 1 includes a main control module 2, an input/output module 3, a data creation module 4, a data query module 5, a data maintenance module 6, and a memory 7.
- the input/output module 3 is configured to receive request information from an application server and transmit the request information to the main control module 2, and transmit the result data or response information back to the application server.
- the data creation module 4 is configured to create the tree structure according to instructions and initial data information from the main control module 2 and store the created tree structure in the memory 7, and will point to the root of the tree structure The pointer of the node is transmitted back to the main control module 2.
- the data query module 5 is configured to complete a specified query process based on the instruction and data information from the main control module 2 and based on a predetermined query rule for the tree structure, and transmit the query result back to the main control module 2.
- the data maintenance module 6 is configured to perform maintenance operations for the tree structure based on instructions and data information from the main control module 2, and transmit response information indicating the result of the operation back to the main control module 2.
- the memory 7 is used to store the tree structure.
- the main control module 2 is configured to receive and parse the request information transmitted by the input/output module 3, and construct a message including the data information and the instruction according to the parsing result, and transmit the message to the corresponding processing module. And transmitting the result data or response information returned by the processing module back to the input/output module 3.
- the data maintenance module 6 further includes a modification unit 8, a deletion unit 9, and an addition unit 10.
- the modifying unit 8 is configured to query the tree structure according to the instruction and data information from the main control module 2, and modify the value of the corresponding node to which the matching is performed.
- the deleting unit 9 is configured to query the tree structure according to the instruction and data information from the main control module 2, and change the value of the flag bit of the last node matched when the matching is successful.
- the adding unit 10 is configured to query the tree structure according to instructions and data information from the main control module 2, and create a node that is not matched.
- the request information includes data information and/or operation command information.
- 2 is a schematic diagram of a tentree structure in accordance with an embodiment of the present invention.
- the tree structure is a decimal tree (ie, each parent node in the tree has at most 10 child nodes). Since the data information (e.g., card number) that needs to be stored is a set of numbers, and each digit is one of 0-9, the tree structure is selected as a decimal tree.
- each parent node in the decimal tree includes a plurality of pointers, and the plurality of pointers respectively point to respective child nodes thereof.
- each node in the decimal tree includes a data bit and a flag bit, wherein the data bit is used to store corresponding to the A piece of data of a number of pieces of information (e.g., a card number) whose value is one of 0 and 1.
- a number of pieces of information e.g., a card number
- the root node of the decimal tree is set to (0, 0) (ie, the value of the data bit and the flag bit of the root node) Each is set to 0).
- the value of the flag bit of the node corresponding to the last data bit of the data information in the decimal tree Set to 1
- the value of the flag bits of the remaining nodes in the ten-tree is set to 0.
- each level node of the decimal tree corresponds to each bit of the data information, that is, the level of each node in the tree structure corresponds to the The order of each bit of the data information in the data information (for example, the first-level child node corresponds to the 1-bit data of the data information).
- the predetermined query rule is a query algorithm from the root-up binding tree, so that the traversal of the tree structure can be completed based on data matching.
- the predetermined query rule is a query algorithm from the root-up binding tree, so that the traversal of the tree structure can be completed based on data matching.
- the process of creating a tree structure of the data storage device disclosed by the present invention is exemplarily as follows: creating a root node (the root node is set to (0, 0)); starting from the root node , traversing the tree structure for each bit of data in each piece of data information (eg, each card number); if there is a matching node for a certain bit of data, continue to traverse down; if there is no match for a certain bit of data
- the node based on the structure of the tree, creates a node corresponding to the bit data; and so on, until the node corresponding to the last bit of each of the data information has been established.
- each piece of data information is stored in a bit by tree structure, that is, a large part of the same number in different data information (for example, a card number) occupies the same space, so that the storage space can be significantly saved.
- the query process of the tree structure of the data storage device disclosed by the present invention is exemplarily as follows: Starting from the root node, for each data information to be queried (for example, each card number) Bit data traverses the tree structure (ie, sequentially matches nodes on the tree); if the node corresponding to the last digit of the data information is matched and the flag bit of the node has a value of 1, the query succeeds; otherwise , Query failed.
- the query efficiency of the decimal tree is independent of the base number N (ie, the total amount of data information), and is related to the length of the data information, that is, regardless of the data information. The total size, at most, only compares the length of the data information, so it can significantly improve the performance and efficiency of the entire system.
- the process of increasing the tree structure of the data storage device disclosed by the present invention is as follows: Starting from the root node, for each data information to be added (for example, each card number) One bit of data traverses the tree structure (ie, matches nodes on the tree in turn); if there is a matching node for a certain bit of data, it continues to traverse down; if there is no matching node for a certain bit of data, based on The structure of the tree creates the node corresponding to the bit data; and so on, until the node corresponding to the last digit of each of the data information has been established.
- the deletion process of the tree structure of the data storage device disclosed by the present invention is exemplarily as follows: Starting from the root node, for each data information to be deleted (for example, each card number) One bit of data traverses the tree structure (ie, sequentially matches nodes on the tree); if there is a matching node for a certain bit of data, it continues to traverse down; if there is no matching node for a certain bit of data, then exits; If the node corresponding to the last digit of each of the data information is matched, the value of the flag bit of the node is set to 0;
- the modification process of the tree structure of the data storage device disclosed by the present invention is as follows: starting from the root node, for the to-be-modified Each bit of data in each piece of data information (eg, each card number) traverses the tree structure (ie, sequentially matches nodes on the tree); if there is a matching node for a certain bit of data, the data bits of the node are Set to the new value and continue traversing down; and so on, until all the nodes of the node that need to be modified are set to the new value. Where the correspondence between the old data information and the new data information (ie, Modifying the old data information to the corresponding new data information) is included in the request information.
- the correspondence between the old data information and the new data information ie, Modifying the old data information to the corresponding new data information
- the modification process of the tree structure of the data storage device disclosed by the present invention is as follows: (1) When the length of the data information is shortened The modification process is as follows: Starting from the root node, traversing the tree structure for each bit of data in each new shortened data information (eg, a shorter card number) (ie, sequentially matching nodes on the tree); If there is a matching node for a certain bit of data, it continues to traverse down; if there is no matching node for a certain bit of data, it exits; if it matches the last digit corresponding to each of the new data information Node, the value of the flag bit of the node is set to 1; (2) When the length of the data information is lengthened, the modification process is as follows: Starting from the root node, for each new extended data information (for example, a longer card number) Each bit of data in the traversal of the tree structure (ie, in turn matching the nodes on the
- each data information is stored in a bit structure in a tree structure, so when it is necessary to add, delete, and modify data information (such as a card number), it is only necessary to The node can operate without modifying the data structure, so the system is easy to expand.
- FIG. 3 is a flow chart of a tree structure based mass data storage method in accordance with an embodiment of the present invention.
- the tree structure-based mass data storage method disclosed in the present invention includes the following steps: (A1) receiving data information and an initialization instruction from an application server; (A2) storing according to the initialization instruction and based on a tree structure The data information
- the tree structure-based mass data storage method disclosed by the present invention further includes: (A3) receiving a query instruction from the application server and data information to be queried, and based on the query instruction and the to-be-queried
- the data information and predetermined query rules for the tree structure complete the specified query operation and communicate the query balance back to the application server.
- the tree structure-based mass data storage method disclosed by the present invention further includes: (A4) receiving a maintenance instruction from the application server and data information to be maintained, and based on the maintenance instruction and the to-be-maintained The data information completes a maintenance operation for the tree structure and transmits response information indicating the result of the operation back to the application server.
- A4 receiving a maintenance instruction from the application server and data information to be maintained, and based on the maintenance instruction and the to-be-maintained The data information completes a maintenance operation for the tree structure and transmits response information indicating the result of the operation back to the application server.
- the step (A4) further includes: (B1) when the maintenance instruction is a modification command, according to the modification command and The data information to be maintained is queried for the tree structure, and the value of the matching corresponding node is modified; (B2) when the maintenance command is a delete command, the tree is queried according to the delete command and the data information to be maintained. Structure, and changing the value of the flag bit of the last node matched when the matching succeeds; (B3) when the maintenance instruction is an increase command, querying the tree structure according to the increase command and the data information to be maintained, And create a node that does not match.
- the tree structure is a decimal tree (i.e., each parent node in the tree has at most 10 child nodes). Since the data information (e.g., card number) that needs to be stored is a set of numbers, and each digit is one of 0-9, the tree structure is selected as a decimal tree.
- the data information e.g., card number
- each parent node in the hex tree includes a plurality of pointers, each of which points to its respective child node.
- each of the nodes in the hex tree includes a data bit and a flag bit, wherein the data bit is used to store a data corresponding to the data information (eg, a card number)
- the data bit is used to store a data corresponding to the data information (eg, a card number)
- the value of the flag bit is one of 0 and 1.
- the root node of the decimal tree is set to (0, 0) (ie, the values of the data bits and flag bits of the root node are both set to 0)
- the value of the flag bit of the node corresponding to the last data bit of the data information in the decimal tree is set to 1, and the remaining nodes in the decimal tree The value of the flag bit is set to 0.
- each level node of the decimal tree corresponds to each bit of the data information, that is, the level of each node in the tree structure corresponds to the The order of each bit of the data information in the data information (eg, the first level child node corresponds to the first bit data of the data information)
- the predetermined query rule is a query algorithm from the root-up binding tree, so that the traversal of the tree structure can be completed based on data matching.
- the predetermined query rule is a query algorithm from the root-up binding tree, so that the traversal of the tree structure can be completed based on data matching.
- the tree structure is created as follows: a root node is created (the root node is set to (0, 0)); from the root node, for each Each bit of data in the data information (eg, each card number) traverses the tree structure; if there is a matching node for a certain bit of data, then continues to traverse down; for example, there is no matching node for a certain bit of data, Then, a node corresponding to the bit data is created based on the structure of the tree; and so on, until a node corresponding to the last bit of each of the data information is established.
- each data information is stored in a bit structure in a tree structure, that is, a large part of the same number in different data information (for example, a card number) occupies the same space, Significant savings in storage space.
- the query process of the tree structure is as follows: Starting from the root node, traversing each bit of data in each data information to be queried (for example, each card number) The tree structure is described (ie, the nodes on the tree are matched in sequence); if the node corresponding to the last digit of the data information is matched and the value of the flag of the node is 1, the query succeeds; otherwise, the query fails.
- the query efficiency of the pseudotree is independent of the base number N (ie, the total amount of data information), and is related to the length of the data information, that is, regardless of the data information. The total size, at most, only compares the length of the data information, so it can significantly improve the performance and efficiency of the entire system.
- the process of increasing the tree structure is as follows: Starting from the root node, traversing each bit of data in each data information to be added (for example, each card number) The tree structure (ie, matching the nodes on the tree in turn); if there is a matching node for a certain bit of data, continuing to traverse down; if there is no matching node for a certain bit of data, based on the structure of the tree Creating a node corresponding to the bit data; and so on, until a node corresponding to the last digit of each of the data information is established,
- the deletion process of the tree structure is as follows: Starting from the root node, traversing each bit of data in each data information to be deleted (for example, each card number) The tree structure (ie, the nodes on the tree are matched in sequence); if there is a matching node for a certain number of bits, the traversal continues downward; if there is no matching node for a certain bit of data, the exit is performed; if the match To the node corresponding to the last digit of each of the data information, the value of the flag bit of the node is set to 0;
- the modification process of the tree structure is as follows: Starting from the root node, for the to-be-modified Each bit of data in each piece of data information (eg, each card number) traverses the tree structure (ie, sequentially matches nodes on the tree); if there is a matching node for a certain bit of data, the data bits of the node are Set to the new value and continue traversing down; and so on, until the data bits of all nodes that need to be modified are set to the new value.
- the corresponding relationship between the data information and the new data information (that is, the old data information is modified to the corresponding new data) is included in the request information.
- the modification process of the tree structure is as follows: (1) When the length of the data information is shortened, the modification process As follows: Starting from the root node, traversing the tree structure for each bit of data in each new shortened data information (eg, a shorter card number) (ie, sequentially matching nodes on the tree); If there is a matching node in the data, it continues to traverse down; if there is no matching node for a certain bit of data, it exits; if it matches the node corresponding to the last digit of each new data information, The value of the flag bit of the node is set to 1; (2) When the length of the data information is lengthened, the modification process is as follows: Starting from the root node, for each new extended data information (for example, a longer card number) One bit of data traverses the tree structure (ie, matches the nodes on the tree in turn); if there is a matching node for
- each data information is stored in a bit structure in a tree structure, so when it is necessary to add, delete, and modify data information (such as a card number), it is only necessary to The node can operate without modifying the data structure, so the system is easy to expand.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Computational Linguistics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP11853163.1A EP2660729A4 (en) | 2010-12-31 | 2011-12-29 | DEVICE AND METHOD FOR STORING MASS DATA USING ARBORESCENT STRUCTURE |
US13/977,649 US20140052710A1 (en) | 2010-12-31 | 2011-12-29 | Device and method of mass data storage based on tree structure |
JP2013546563A JP2014502756A (ja) | 2010-12-31 | 2011-12-29 | ツリー構造に基づくマスデータストレージの装置および方法 |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201010621365.8A CN102567419B (zh) | 2010-12-31 | 2010-12-31 | 基于树结构的海量数据存储装置及方法 |
CN201010621365.8 | 2010-12-31 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2012088767A1 true WO2012088767A1 (zh) | 2012-07-05 |
Family
ID=46382252
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2011/002209 WO2012088767A1 (zh) | 2010-12-31 | 2011-12-29 | 基于树结构的海量数据存储装置及方法 |
Country Status (5)
Country | Link |
---|---|
US (1) | US20140052710A1 (zh) |
EP (1) | EP2660729A4 (zh) |
JP (1) | JP2014502756A (zh) |
CN (1) | CN102567419B (zh) |
WO (1) | WO2012088767A1 (zh) |
Families Citing this family (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103399904B (zh) * | 2013-07-26 | 2018-10-02 | 浙江吉利汽车研究院有限公司 | 数据处理方法及数据处理系统 |
TW201508283A (zh) * | 2013-08-29 | 2015-03-01 | Hon Hai Prec Ind Co Ltd | 儲存裝置測試方法及系統 |
CN106802927A (zh) * | 2016-12-22 | 2017-06-06 | 上海大汉三通数据通信有限公司 | 一种数据存储方法及查询方法 |
CN107067323B (zh) * | 2016-12-29 | 2021-10-26 | 中国银联股份有限公司 | 金融数据处理系统以及批量贷记交易分发系统及其方法 |
KR102109467B1 (ko) * | 2019-04-30 | 2020-05-12 | 주식회사 데이타젠네트웍스 | 업무영역의 상관관계를 이용한 데이터 식별 시스템 및 방법 |
CN114465741B (zh) * | 2020-11-09 | 2023-09-26 | 腾讯科技(深圳)有限公司 | 一种异常检测方法、装置、计算机设备及存储介质 |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1260090A (zh) * | 1997-02-21 | 2000-07-12 | 艾利森电话股份有限公司 | 因特网上的数据高速缓冲存储器 |
CN101866305A (zh) * | 2010-05-21 | 2010-10-20 | 武汉大学 | 支持数据查询和快速恢复的连续数据保护方法及系统 |
Family Cites Families (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5628002A (en) * | 1992-11-02 | 1997-05-06 | Woodrum; Luther J. | Binary tree flag bit arrangement and partitioning method and apparatus |
US5644763A (en) * | 1995-06-28 | 1997-07-01 | Sybase, Inc. | Database system with improved methods for B-tree maintenance |
JP3630057B2 (ja) * | 2000-01-26 | 2005-03-16 | 日本電気株式会社 | 検索用データ構造構築方法、その装置、及び機械可読プログラム記録媒体 |
US6907032B2 (en) * | 2000-03-06 | 2005-06-14 | Goremote Internet Communications, Inc. | Method for selecting terminating gateways for an internet telephone call using a tree search |
US6785687B2 (en) * | 2001-06-04 | 2004-08-31 | Hewlett-Packard Development Company, L.P. | System for and method of efficient, expandable storage and retrieval of small datasets |
US20040230690A1 (en) * | 2003-05-17 | 2004-11-18 | Teh Jin Teik | Protocol for data hosting servers |
JP5095397B2 (ja) * | 2004-07-12 | 2012-12-12 | フェクスコ マーチャント サービシズ | 直接的な通貨両替 |
US8645350B2 (en) * | 2008-07-11 | 2014-02-04 | Adobe Systems Incorporated | Dictionary compilations |
CN101398869B (zh) * | 2008-10-07 | 2010-04-14 | 深圳市蓝韵实业有限公司 | 一种海量数据存储方法 |
US8095677B1 (en) * | 2009-05-21 | 2012-01-10 | Sendmail, Inc. | Configuration rule generation with compressed address sets |
US8838563B2 (en) * | 2010-07-08 | 2014-09-16 | Xconnect Global Networks Limited | Method and system for routing a telephone call |
US8204887B2 (en) * | 2010-08-27 | 2012-06-19 | Hewlett-Packard Development Company, L.P. | System and method for subsequence matching |
-
2010
- 2010-12-31 CN CN201010621365.8A patent/CN102567419B/zh active Active
-
2011
- 2011-12-29 WO PCT/CN2011/002209 patent/WO2012088767A1/zh active Application Filing
- 2011-12-29 JP JP2013546563A patent/JP2014502756A/ja not_active Ceased
- 2011-12-29 US US13/977,649 patent/US20140052710A1/en not_active Abandoned
- 2011-12-29 EP EP11853163.1A patent/EP2660729A4/en not_active Ceased
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1260090A (zh) * | 1997-02-21 | 2000-07-12 | 艾利森电话股份有限公司 | 因特网上的数据高速缓冲存储器 |
CN101866305A (zh) * | 2010-05-21 | 2010-10-20 | 武汉大学 | 支持数据查询和快速恢复的连续数据保护方法及系统 |
Non-Patent Citations (1)
Title |
---|
See also references of EP2660729A4 * |
Also Published As
Publication number | Publication date |
---|---|
US20140052710A1 (en) | 2014-02-20 |
EP2660729A1 (en) | 2013-11-06 |
CN102567419A (zh) | 2012-07-11 |
CN102567419B (zh) | 2014-07-16 |
EP2660729A4 (en) | 2016-10-19 |
JP2014502756A (ja) | 2014-02-03 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN107577427B (zh) | 用于区块链系统的数据迁移方法、设备和存储介质 | |
CN109359222B (zh) | 数据存储方法及系统、设备和存储介质 | |
US9471633B2 (en) | Eigenvalue-based data query | |
WO2012088767A1 (zh) | 基于树结构的海量数据存储装置及方法 | |
CN112261159B (zh) | 执行跨片事务的方法及系统、主链节点和目标分片节点 | |
JP5407043B2 (ja) | バイナリにエンコードされたxmlデータの効率的な区分的アップデート | |
CN110599169B (zh) | 数据处理方法、装置、终端及介质 | |
WO2022143540A1 (zh) | 区块链索引的存储方法、装置、计算机设备及介质 | |
WO2022156574A1 (zh) | 基于区块链的数据处理方法、装置、设备及可读存储介质 | |
JP4621747B2 (ja) | 通信制御装置および情報処理装置 | |
JP2013513147A (ja) | 情報システムにおける変換データの高スループット・高信頼性の複製 | |
CN101009516A (zh) | 一种进行数据同步的方法及系统 | |
US9292549B2 (en) | Method and system for index serialization | |
WO2011131079A1 (zh) | 一种分布式控制系统的事件处理方法及系统 | |
CN109088914B (zh) | 区块的生成方法、区块链生态系统及计算机可读存储介质 | |
CN107818114A (zh) | 一种数据处理方法、装置及数据库 | |
CN113076304A (zh) | 一种分布式版本管理方法、装置和系统 | |
WO2024041022A1 (zh) | 数据库表变更方法、装置、设备和存储介质 | |
WO2023184052A1 (zh) | 一种数据处理方法、区块链节点及区块链系统 | |
CN105930104B (zh) | 数据存储方法和装置 | |
WO2014180401A1 (zh) | 业务模型的适配方法及系统 | |
CN104023056B (zh) | 更新数据的方法和相关设备 | |
KR102274656B1 (ko) | 블록체인 네트워크에서 데이터를 관리하기 위한 기법 | |
CN110928839B (zh) | 国际运价数据的存储方法和系统 | |
CN111858642B (zh) | 数据集更新方法、相关设备及可读存储介质 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 11853163 Country of ref document: EP Kind code of ref document: A1 |
|
ENP | Entry into the national phase |
Ref document number: 2013546563 Country of ref document: JP Kind code of ref document: A |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2011853163 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 13977649 Country of ref document: US |