CN109614411A - Date storage method, equipment and storage medium - Google Patents
Date storage method, equipment and storage medium Download PDFInfo
- Publication number
- CN109614411A CN109614411A CN201811378484.8A CN201811378484A CN109614411A CN 109614411 A CN109614411 A CN 109614411A CN 201811378484 A CN201811378484 A CN 201811378484A CN 109614411 A CN109614411 A CN 109614411A
- Authority
- CN
- China
- Prior art keywords
- key
- prefix
- node
- node data
- data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/12—Replacement control
- G06F12/121—Replacement control using replacement algorithms
- G06F12/126—Replacement control using replacement algorithms with special data handling, e.g. priority of data or instructions, handling errors or pinning
Abstract
The present invention provides a kind of date storage method, equipment and storage medium, this method comprises: adding prefix to the key (key) of node data when the node data of Merkel tree is stored into key-value (key-value) database；Wherein, prefix includes the corresponding block height of node data.The present invention reduces the practical number read of hard disk, improves and reads efficiency, provides good user experience for user.
Description
Technical field
This application involves block chain technical fields, and in particular to a kind of date storage method, equipment and storage medium.
Background technique
In existing data storage technology, since disk IO read-write is there are bottleneck, for database read-write efficiency (especially
It is read operation) can all there be larger impact；Existing settling mode is to read using least recently used (LRU) caching or in advance to delay
The mode deposited when so that database reads data from disk every time, all can read together the data ambient data interior
In depositing, disk number is directly read to reduce.
In existing block catenary system, it will usually utilize Merkel tree (Merkle Tree), Merkel's balanced binary tree
(MAVL Tree) etc. stores the node data of block.By taking MAVLTree as an example, in block chain network, due to MAVL
Non-leaf nodes and leaf node the storage key assignments of Tree is generated by Hash operation, is had randomness, is read key every time
It requires to be searched in entire database when value；Since storage key assignments is generated by Hash operation, there is randomness,
Key assignments is distributed in each place of database, even with LRU cache or the mode of preparatory read buffer, by the corresponding key of reading
Value ambient data is read into memory together, also reduces continuous reading efficiency, can not reduce the number of disk IO read-write.
Summary of the invention
In view of drawbacks described above in the prior art or deficiency, it is intended to provide a kind of practical number read of reduction hard disk, is improved
Read date storage method, equipment and the storage medium of efficiency.
In a first aspect, the present invention provides a kind of date storage method, comprising:
When the node data of Merkel tree is stored into key-value (key-value) database, to the key of node data
(key) prefix is added；Wherein, prefix includes the corresponding block height of node data.
Second aspect, the present invention also provides a kind of equipment, including one or more processors and memory, wherein memory
Comprising can by instruction that the one or more processors execute so that the one or more processors execute it is each according to the present invention
The date storage method that embodiment provides.
The third aspect, the present invention also provides a kind of storage medium for being stored with computer program, which makes to count
Calculation machine executes the date storage method that each embodiment provides according to the present invention.
A kind of date storage method that many embodiments of the present invention provide is by arriving the node data storage of Merkel tree
When in key-value (key-value) database, prefix is added to the key (key) of node data；Wherein, prefix includes node data
The method of corresponding block height reduces the practical number read of hard disk, improves and reads efficiency, provides good user's body for user
It tests.
Detailed description of the invention
By reading a detailed description of non-restrictive embodiments in the light of the attached drawings below, the application's is other
Feature, objects and advantages will become more apparent upon:
Fig. 1 is the schematic diagram that the data that one embodiment of the invention provides store scene.
Fig. 2 is a kind of structural schematic diagram for equipment that one embodiment of the invention provides.
Specific embodiment
The application is described in further detail with reference to the accompanying drawings and examples.It is understood that this place is retouched
The specific embodiment stated is used only for explaining related invention, rather than the restriction to the invention.It also should be noted that in order to
Convenient for description, part relevant to invention is illustrated only in attached drawing.
It should be noted that in the absence of conflict, the features in the embodiments and the embodiments of the present application can phase
Mutually combination.The application is described in detail below with reference to the accompanying drawings and in conjunction with the embodiments.
Fig. 1 is the schematic diagram that the data that one embodiment of the invention provides store scene.As shown in Figure 1, in the present embodiment,
In the block that block height is 500, node receives several transaction so that the node data of four adjacent leaf nodes occurs
Variation, after node data changes, regenerates Merkel tree, each node data of Merkel tree is stored in key-value
(key-value) in database, when storing into key-value database, prefix is added to the key (key) of node data；Wherein, preceding
Sew including the corresponding block height of node data.Date storage method provided by the invention is carried out specifically below in conjunction with Fig. 2
It is bright.
Fig. 2 is a kind of flow chart for date storage method that one embodiment of the invention provides.
As shown in Fig. 2, in the present embodiment, the present invention provides a kind of date storage method, which is characterized in that by Merkel
When the node data of tree is stored into key-value (key-value) database, prefix is added to the key (key) of node data；Its
In, prefix includes the corresponding block height of node data.
Specifically, by taking application scenarios shown in FIG. 1 as an example, user A, user B, user C, user D balance status be
Possess 200 token1；Leaf node A records the balance status of user A, and leaf node B records the balance status of user B, leaf
Child node C records the balance status of user C, and leaf node D records the balance status of user D；The block for being 500 in block height
In, node first receives two transactions, and transaction M is indicated, user A sends 10 token1 to user B, and transaction N is indicated, user C to
User D sends 100 token1；Prefix is added to the key (key) of node data, prefix is that the corresponding block of node data is high
Degree.
After node receives transaction M and transaction N:
The node data of leaf node A becomes: 190 token1 (data 0)；
The node data of leaf node B becomes: 210 token1 (data 1)；
The node data of leaf node C becomes: 100 token1 (data 2)；
The node data of leaf node D becomes: 300 token1 (data 3)；
Become using node data of the sha256 algorithm to leaf node A: 190 token1 carry out Hash operation, obtain
Hash0, Hash0 906962 ... 9246e3；
Become using node data of the sha256 algorithm to leaf node B: 210 token1 carry out Hash operation, obtain
Hash1, Hash1 832bd1 ... 67c3b3；
Become using node data of the sha256 algorithm to leaf node C: 100 token1 carry out Hash operation, obtain
Hash2, Hash2 d6ddc0 ... 0cd2d9；
Become using node data of the sha256 algorithm to leaf node D: 300 token1 carry out Hash operation, obtain
Hash3, Hash3 e33ed5 ... ce0c04；
And Merkel tree is generated to Hash0, Hash1, Hash2, Hash3, ultimately generate Merkel's root.
Node data Hash0, Hash1, Hash2, Hash3, Hash01, Hash12, Hash0123 of Merkel tree are deposited
When storing up in key-value (key-value) database, prefix is added to the key (key) of node data:
The key generated after Hash0 addition prefix are as follows: 500Hash0；
The key generated after Hash1 addition prefix are as follows: 500Hash1；
The key generated after Hash2 addition prefix are as follows: 500Hash2；
The key generated after Hash3 addition prefix are as follows: 500Hash3；
The key generated after Hash01 addition prefix are as follows: 500Hash01；
The key generated after Hash23 addition prefix are as follows: 500Hash23；
The key generated after Hash0123 addition prefix are as follows: 500Hash0123.
Data when key-value (key-value) database are arrived in final storage are as follows:
500Hash0,190token1；
500Hash1,210token1；
500Hash2,100token1；
500Hash3,300token1；
500Hash01, Hash0+Hash1；
500Hash23, Hash2+Hash3；
500Hash0123, Hash01+Hash23.
Above-described embodiment adds prefix with the key (key) to node data, and prefix is the corresponding block height of node data
For, date storage method provided by the invention is expounded, in more embodiments, can also be according to actual needs
Node data configures different prefix (for example, the id for configuring the prefix of node data to block), it can be achieved that identical technology
Effect.
In the existing not scheme to key addition prefix, being 906962 from Hash0 ..., 9246e3, Hash1 are
832bd1 ... 67c3b3, Hash2 d6ddc0 ... 0cd2d9；Hash3 is that e33ed5 ... ce0c04 can be seen that Merck
Non-leaf nodes and leaf node the storage key assignments of your tree are generated by Hash operation, have randomness；Key assignments is distributed in
Each place of database, even with LRU cache or the mode of preparatory read buffer, by the corresponding key assignments ambient data of reading
It is read into memory together, also reduces continuous reading efficiency, the number of disk IO read-write can not be reduced；
For example, reading after Hash1 (832bd1 ... 67c3b3), can will there is successional one with 832bd1 ... 67c3b3
A little data are read into memory together, and and 832bd1 ... 67c3b3 have successional data, may not be related to Hash1；?
When reading data (such as Hash2) relevant to Hash1, due to Hash2 (d6ddc0 ... 0cd2d9) and Hash1
(832bd1 ... 67c3b3) does not have continuity, therefore when reading Hash2, it is desired nonetheless to read from disk, can not actually subtract
Few practical number read of hard disk.
And after using method provided by the above embodiment, in storing data, before key (key) addition of node data
Sew, the key generated after Hash0 addition prefix are as follows: 500Hash0；The key generated after Hash1 addition prefix are as follows: 500Hash1；
The key generated after Hash2 addition prefix are as follows: 500Hash2；The key generated after Hash3 addition prefix are as follows: 500Hash3；
The key generated after Hash01 addition prefix are as follows: 500Hash01；The key generated after Hash23 addition prefix are as follows: 500Hash23；
The key generated after Hash0123 addition prefix are as follows: 500Hash0123.It is such as when reading 500Hash1,500Hash1 is adjacent
Several key assignments (500Hash01,500Hash0123,500Hash12,500Hash2) are cached into memory；Due to 500Hash2
It has been buffered in memory, can be read directly, from the practical number read of hard disk is actually reduced, improved and read efficiency.
It is right when above-described embodiment is by storing the node data of Merkel tree into key-value (key-value) database
The key (key) of node data adds prefix；Wherein, prefix includes the method for the corresponding block height of node data, reduces hard disk
The number actually read improves and reads efficiency, provides good user experience for user.
In a preferred embodiment, prefix further includes identifier, which is for identifying the affiliated node of node data
No leaf node.For the application scenarios shown in Fig. 1, be Hash0, Hash1, Hash2, Hash3, Hash01, Hash12,
Hash0123 configures prefix, and it further includes for identifying number of nodes that prefix, which includes that prefix includes the corresponding block height of node data,
According to affiliated node, whether the identifier of leaf node is (for example, the identifier of leaf node is pri1, the identifier of non-leaf nodes
For pri2)；Node data Hash0, Hash1, Hash2, Hash3, Hash01, Hash12, Hash0123 of Merkel tree are deposited
When storing up in key-value (key-value) database, prefix is added to the key (key) of node data:
The key generated after Hash0 addition prefix are as follows: 500pri1Hash0；
The key generated after Hash1 addition prefix are as follows: 500pri1Hash1；
The key generated after Hash2 addition prefix are as follows: 500pri1Hash2；
The key generated after Hash3 addition prefix are as follows: 500pri1Hash3；
The key generated after Hash01 addition prefix are as follows: 500pri2Hash01；
The key generated after Hash23 addition prefix are as follows: 500pri2Hash23；
The key generated after Hash0123 addition prefix are as follows: 500pri2Hash0123.
Data when key-value (key-value) database are arrived in final storage are as follows:
500pri1Hash0,190token1；
500pri1Hash1,210token1；
500pri1Hash2,100token1；
500pri1Hash3,300token1；
500pri2Hash01, Hash0+Hash1；
500pri2Hash23, Hash2+Hash3；
500pri2Hash0123, Hash01+Hash23.
Above-described embodiment adds prefix with the key (key) to node data, and prefix is the corresponding block height of node data
Whether for the identifier of leaf node, date storage method provided by the invention is carried out with the mark affiliated node of node data
It illustrates, in more embodiments, different prefixes can also be configured (for example, by node for node data according to actual needs
The prefix of data be configured to the id of block and the mark affiliated node of node data whether the identifier of leaf node), it can be achieved that phase
Same technical effect.
In a preferred embodiment, Merkel tree is Merkel's balanced binary search tree (MAVLTree)；
When calculating the cryptographic Hash of the non-leaf nodes of Merkel's balanced binary search tree, the child node of non-leaf nodes is removed
Key prefix.
For the application scenarios shown in Fig. 1, become using node data of the sha256 algorithm to leaf node A: 190
Token1 carries out Hash operation, obtains Hash0, Hash0 906962 ... 9246e3；Using sha256 algorithm to leaf node
The node data of B becomes: 210 token1 carry out Hash operation, obtain Hash1, Hash1 832bd1 ... 67c3b3；Meter
Calculate non-leaf nodes cryptographic Hash Hash01 when, remove the prefix of the key of the child node of non-leaf nodes, i.e., using Hash0 with
Hash1 calculates Hash01:
Hash01=hash (Hash0+Hash1)=hash (906962 ... 9246e3+832bd1 ... 67c3b3), meter
Calculate Hash01 be 810611 ... aac6ff；
Similarly, Hash23 is calculated, and calculates Hash0123 using Hash01 and Hash23.
In a preferred embodiment, key further includes for judging to whether there is the first of data corresponding with key in disk
Mark:
It is no, then return to error information.
For example, read the node data that key is 500pri1Hash11, and in disk and there is no keys to be
The first identifier of the node data of 500pri1Hash11, returns to error information at this time.
Fig. 2 is a kind of structural schematic diagram for equipment that one embodiment of the invention provides.
As shown in Fig. 2, present invention also provides a kind of equipment 200, including one or more centres as on the other hand
Unit (CPU) 201 is managed, can be added according to the program being stored in read-only memory (ROM) 202 or from storage section 208
The program that is downloaded in random access storage device (RAM) 203 and execute various movements appropriate and processing.In RAM203, also deposit
It contains equipment 200 and operates required various programs and data.CPU201, ROM202 and RAM203 pass through the phase each other of bus 204
Even.Input/output (I/O) interface 205 is also connected to bus 204.
I/O interface 205 is connected to lower component: the importation 206 including keyboard, mouse etc.；It is penetrated including such as cathode
The output par, c 207 of spool (CRT), liquid crystal display (LCD) etc. and loudspeaker etc.；Storage section 208 including hard disk etc.；
And the communications portion 209 of the network interface card including LAN card, modem etc..Communications portion 209 via such as because
The network of spy's net executes communication process.Driver 210 is also connected to I/O interface 205 as needed.Detachable media 211, such as
Disk, CD, magneto-optic disk, semiconductor memory etc. are mounted on as needed on driver 210, in order to read from thereon
Computer program be mounted into storage section 208 as needed.
Particularly, in accordance with an embodiment of the present disclosure, the date storage method of any of the above-described embodiment description can be implemented
For computer software programs.For example, embodiment of the disclosure includes a kind of computer program product comprising be tangibly embodied in
Computer program on machine readable media, the computer program include the program code for executing date storage method.
In such embodiments, which can be downloaded and installed from network by communications portion 209, and/or from
Detachable media 211 is mounted.
As another aspect, present invention also provides a kind of computer readable storage medium, the computer-readable storage mediums
Matter can be computer readable storage medium included in the device of above-described embodiment；It is also possible to individualism, it is unassembled
Enter the computer readable storage medium in equipment.Computer-readable recording medium storage has one or more than one program, should
Program is used to execute the date storage method for being described in the application by one or more than one processor.
Flow chart and block diagram in attached drawing are illustrated according to the system of various embodiments of the invention, method and computer journey
The architecture, function and operation in the cards of sequence product.In this regard, each box in flowchart or block diagram can generation
A part of one module, program segment or code of table, a part of the module, program segment or code include one or more use
The executable instruction of the logic function as defined in realizing.It should also be noted that in some implementations as replacements, being marked in box
The function of note can also occur in a different order than that indicated in the drawings.For example, two boxes succeedingly indicated are actually
It can be basically executed in parallel, they can also be executed in the opposite order sometimes, this is depending on related function.Also it wants
It is noted that the combination of each box in block diagram and or flow chart and the box in block diagram and or flow chart, Ke Yitong
The dedicated hardware based system of functions or operations as defined in executing is crossed to realize, or by specialized hardware and can be calculated
The combination of machine instruction is realized.
Being described in the embodiment of the present application involved unit or module can be realized by way of software, can also be with
It is realized by way of hardware.Described unit or module also can be set in the processor, for example, each unit can
To be the software program being arranged in computer or intelligent movable equipment, it is also possible to the hardware device being separately configured.Wherein, this
The title of a little units or module does not constitute the restriction to the unit or module itself under certain conditions.
Above description is only the preferred embodiment of the application and the explanation to institute's application technology principle.Those skilled in the art
Member is it should be appreciated that invention scope involved in the application, however it is not limited to technology made of the specific combination of above-mentioned technical characteristic
Scheme, while should also cover in the case where not departing from the application design, appointed by above-mentioned technical characteristic or its equivalent feature
Other technical solutions of meaning combination and formation.Such as features described above and (but being not limited to) disclosed herein have similar functions
Technical characteristic replaced mutually and the technical solution that is formed.
Claims (6)
1. a kind of date storage method, which is characterized in that by the node data storage of Merkel tree to key-value (key-value)
When in database, prefix is added to the key (key) of the node data；Wherein, the prefix includes that the node data is corresponding
Block height.
2. the identifier is used for the method according to claim 1, wherein the prefix further includes identifier
Identify the affiliated node of the node data whether leaf node.
3. method according to claim 1 or 2, which is characterized in that the Merkel tree is the lookup of Merkel's balanced binary
It sets (MAVL Tree)；
When calculating the cryptographic Hash of the non-leaf nodes of Merkel's balanced binary search tree, the son of the non-leaf nodes is removed
The prefix of the key of node.
4. method according to claim 1 or 2, which is characterized in that the key further include for judge in disk whether
In the presence of the first identifier of data corresponding with the key:
It is no, then return to error information.
5. a kind of equipment, which is characterized in that the equipment includes:
One or more processors；
Memory, for storing one or more programs,
When one or more of programs are executed by one or more of processors, so that one or more of processors
Execute such as method of any of claims 1-4.
6. a kind of storage medium for being stored with computer program, which is characterized in that realize when the program is executed by processor as weighed
Benefit requires method described in any one of 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811378484.8A CN109614411B (en) | 2018-11-19 | 2018-11-19 | Data storage method, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811378484.8A CN109614411B (en) | 2018-11-19 | 2018-11-19 | Data storage method, device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109614411A true CN109614411A (en) | 2019-04-12 |
| CN109614411B CN109614411B (en) | 2022-03-04 |
Family
ID=66004546
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811378484.8A Active CN109614411B (en) | 2018-11-19 | 2018-11-19 | Data storage method, device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109614411B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110175188A (en) * | 2019-05-31 | 2019-08-27 | 杭州复杂美科技有限公司 | A kind of block chain state data buffer storage and querying method, equipment and storage medium |
| CN111339736A (en) * | 2020-02-18 | 2020-06-26 | 江苏满运软件科技有限公司 | Method for adding prefix name, configuration acquisition method and device and electronic equipment |
| CN111400320A (en) * | 2020-03-18 | 2020-07-10 | 百度在线网络技术（北京）有限公司 | Method and apparatus for generating information |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120239664A1 (en) * | 2009-11-30 | 2012-09-20 | S. Grants Co., Ltd. | Bit string search apparatus, search method, and program |
| CN106055597A (en) * | 2016-05-24 | 2016-10-26 | 布比（北京）网络技术有限公司 | Digital transaction system, and account information query method therefor |
| CN106777003A (en) * | 2016-12-07 | 2017-05-31 | 安徽大学 | A kind of search index method and system towards Key Value storage systems |
| US20170161522A1 (en) * | 2015-12-02 | 2017-06-08 | International Business Machines Corporation | Organizing key-value information sets into hierarchical representations for efficient signature computation given change information |
| CN106874348A (en) * | 2016-12-26 | 2017-06-20 | 贵州白山云科技有限公司 | File is stored and the method for indexing means, device and reading file |
| CN106952124A (en) * | 2017-03-16 | 2017-07-14 | 北京牛链科技有限公司 | Electronic bill management system and method based on distribution book keeping operation |
| CN107479829A (en) * | 2017-08-03 | 2017-12-15 | 杭州铭师堂教育科技发展有限公司 | A kind of Redis cluster mass datas based on message queue quickly clear up system and method |
| CN107659429A (en) * | 2017-08-11 | 2018-02-02 | 四川大学 | Data sharing method based on block chain |
| CN108319602A (en) * | 2017-01-17 | 2018-07-24 | 广州市动景计算机科技有限公司 | Data base management method and Database Systems |
| CN108427601A (en) * | 2017-02-13 | 2018-08-21 | 北京航空航天大学 | A kind of cluster transaction processing method of privately owned chain node |
| CN108446376A (en) * | 2018-03-16 | 2018-08-24 | 众安信息技术服务有限公司 | Date storage method and device |
| CN108628942A (en) * | 2018-03-27 | 2018-10-09 | 深圳市网心科技有限公司 | The digital independent and wiring method of block chain node device, distributed data base |
-
2018
- 2018-11-19 CN CN201811378484.8A patent/CN109614411B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120239664A1 (en) * | 2009-11-30 | 2012-09-20 | S. Grants Co., Ltd. | Bit string search apparatus, search method, and program |
| US20170161522A1 (en) * | 2015-12-02 | 2017-06-08 | International Business Machines Corporation | Organizing key-value information sets into hierarchical representations for efficient signature computation given change information |
| CN106055597A (en) * | 2016-05-24 | 2016-10-26 | 布比（北京）网络技术有限公司 | Digital transaction system, and account information query method therefor |
| CN106777003A (en) * | 2016-12-07 | 2017-05-31 | 安徽大学 | A kind of search index method and system towards Key Value storage systems |
| CN106874348A (en) * | 2016-12-26 | 2017-06-20 | 贵州白山云科技有限公司 | File is stored and the method for indexing means, device and reading file |
| CN108319602A (en) * | 2017-01-17 | 2018-07-24 | 广州市动景计算机科技有限公司 | Data base management method and Database Systems |
| CN108427601A (en) * | 2017-02-13 | 2018-08-21 | 北京航空航天大学 | A kind of cluster transaction processing method of privately owned chain node |
| CN106952124A (en) * | 2017-03-16 | 2017-07-14 | 北京牛链科技有限公司 | Electronic bill management system and method based on distribution book keeping operation |
| CN107479829A (en) * | 2017-08-03 | 2017-12-15 | 杭州铭师堂教育科技发展有限公司 | A kind of Redis cluster mass datas based on message queue quickly clear up system and method |
| CN107659429A (en) * | 2017-08-11 | 2018-02-02 | 四川大学 | Data sharing method based on block chain |
| CN108446376A (en) * | 2018-03-16 | 2018-08-24 | 众安信息技术服务有限公司 | Date storage method and device |
| CN108628942A (en) * | 2018-03-27 | 2018-10-09 | 深圳市网心科技有限公司 | The digital independent and wiring method of block chain node device, distributed data base |
Non-Patent Citations (1)
| Title |
|---|
| 李亚楠: "基于区块链的数据存储应用研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110175188A (en) * | 2019-05-31 | 2019-08-27 | 杭州复杂美科技有限公司 | A kind of block chain state data buffer storage and querying method, equipment and storage medium |
| CN111339736A (en) * | 2020-02-18 | 2020-06-26 | 江苏满运软件科技有限公司 | Method for adding prefix name, configuration acquisition method and device and electronic equipment |
| CN111339736B (en) * | 2020-02-18 | 2023-09-01 | 江苏满运软件科技有限公司 | Method for adding prefix name, configuration acquisition method, device and electronic equipment |
| CN111400320A (en) * | 2020-03-18 | 2020-07-10 | 百度在线网络技术（北京）有限公司 | Method and apparatus for generating information |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109614411B (en) | 2022-03-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110442579A (en) | A kind of State Tree date storage method, synchronous method and equipment and storage medium | |
| CN109684333A (en) | A kind of storage of data and method of cutting out, equipment and storage medium | |
| CN109359222A (en) | Date storage method and system, equipment and storage medium | |
| US20190272292A1 (en) | Building and querying hash tables on processors | |
| CN109933592A (en) | Date storage method, data rewind method, equipment and storage medium | |
| CN109614411A (en) | Date storage method, equipment and storage medium | |
| CN109559234A (en) | A kind of storage method, equipment and the storage medium of block chain status data | |
| CN109587271A (en) | Main chain parallel chain architecture system and block synchronous method, equipment and storage medium | |
| CN106156070B (en) | A kind of querying method, file mergences method and relevant apparatus | |
| CN108228649A (en) | For the method and apparatus of data access | |
| CN110196889A (en) | Data processing method, device, electronic equipment and storage medium | |
| CN109413127A (en) | A kind of method of data synchronization and device | |
| CN109903050A (en) | Transaction De-weight method, transaction building method, equipment and storage medium | |
| CN110113408A (en) | A kind of block synchronous method, equipment and storage medium | |
| CN110019080A (en) | Data access method and device | |
| US9727665B2 (en) | Grouping records in buckets distributed across nodes of a distributed database system to perform comparison of the grouped records | |
| CN109492053A (en) | Method and apparatus for accessing data | |
| CN106960020B (en) | A kind of method and apparatus creating concordance list | |
| CN109450659A (en) | Block delayed broadcast method, equipment and storage medium | |
| CN109558454A (en) | Parallel chain digs mine common recognition method, equipment and storage medium | |
| CN110287170A (en) | Database upgrade method, status data call method, equipment and storage medium | |
| CN109656923A (en) | A kind of data processing method, device, electronic equipment and storage medium | |
| CN109447639A (en) | Privacy transactions balances scan method, equipment and storage medium | |
| CN109542898A (en) | Date storage method, device, electronic equipment and the storage medium of data bank table | |
| CN106815258A (en) | A kind of date storage method and coordinator node |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |