CN112988075A - Method and system for storing user data through block chain technology - Google Patents

Method and system for storing user data through block chain technology Download PDF

Info

Publication number
CN112988075A
CN112988075A CN202110451529.5A CN202110451529A CN112988075A CN 112988075 A CN112988075 A CN 112988075A CN 202110451529 A CN202110451529 A CN 202110451529A CN 112988075 A CN112988075 A CN 112988075A
Authority
CN
China
Prior art keywords
data
block chain
storage
stored
block
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
Application number
CN202110451529.5A
Other languages
Chinese (zh)
Inventor
孙利国
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Ruizhi Technology Group Co ltd
Original Assignee
Ruizhi Technology Group Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Ruizhi Technology Group Co ltd filed Critical Ruizhi Technology Group Co ltd
Priority to CN202110451529.5A priority Critical patent/CN112988075A/en
Publication of CN112988075A publication Critical patent/CN112988075A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
    • G06F3/067—Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
    • G06F3/0604—Improving or facilitating administration, e.g. storage management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0638—Organizing or formatting or addressing of data
    • G06F3/064—Management of blocks

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Human Computer Interaction (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The application discloses a method and a system for storing user data through a block chain technology. The method comprises the steps that a current block chain node sets a storage level for user data, arranges the storage level into data to be stored, and sends the length and the storage level of the data to be stored to other block chain nodes associated with the current block chain link point; other block chain link points respectively calculate the storage capacity of the other block chain link points according to the length and the storage level of the data to be stored, and the storage capacity of each node is returned to the current block chain node; and the current block chain node divides the data to be stored according to the storage capacity returned by other block chain nodes to obtain a plurality of data blocks, and sends each data block to the corresponding other block chain nodes. By adopting the technical scheme, data can be guaranteed to be stored in a distributed mode in a more optimized mode, and the data storage efficiency is improved.

Description

Method and system for storing user data through block chain technology
Technical Field
The present invention relates to the field of information data transmission and communication, and in particular, to a method and system for storing user data by using a block chain technique.
Background
The blockchain is a decentralized and distrusted reliable database maintained collectively, and is essentially a shared database, and the data or information stored in the database has the characteristics of unforgeability, trace in the whole process, traceability, openness and transparency, collective maintenance and the like. Based on the characteristics, the block chain technology lays a solid trust foundation, creates a reliable cooperation mechanism and has wide application prospect.
The most basic characteristic of the block chain is distributed storage, however, the existing distributed data storage generally stores data into each block chain node directly, the capability of each block chain node is not measured, and user data cannot be distributed optimally to improve the storage effect.
Disclosure of Invention
The application provides a method for storing user data through a block chain technology, which comprises the following steps:
the current block chain node sets a storage level for the user data, arranges the storage level into data to be stored, and sends the length of the data to be stored and the storage level of the data to be stored to other block chain nodes associated with the current block chain link point;
other block chain link points respectively calculate the storage capacity of the other block chain link points according to the length and the storage level of the data to be stored, and the storage capacity of each block chain node is returned to the current block chain node;
and the current block chain node divides the data to be stored according to the storage capacity returned by other block chain nodes to obtain a plurality of data blocks, and sends each data block to the corresponding other block chain nodes.
The method for storing user data by using the blockchain technology includes setting source values of the user data in blockchain nodes according to application sorting and using sorting of the user data in advance, sorting the user data, storage levels and data sources to obtain data to be stored, and sending the length and the storage level of the data to be stored to other blockchain nodes associated with a current blockchain link point.
The method for storing user data by using the blockchain technology as described above, wherein n secure storage areas are previously allocated to each blockchain node according to a storage level, and it is agreed that only the secure storage area higher than or equal to the storage level of the data to be stored can store the data to be stored.
In the method for storing user data by using the block chain technique, after each block link point receives the length of the data to be stored and the storage level thereof, each block link point calculates its own storage capacity by using the following formula:
Figure 789192DEST_PATH_IMAGE001
wherein the content of the first and second substances,Tits own storage capacity calculated for each blockchain node,
Figure 142813DEST_PATH_IMAGE002
is as followsjThe remaining storage length of the individual secure storage areas,nas the total number of the secure storage areas,sas a storage level of the data to be stored,jis taken from the calculation
Figure 409846DEST_PATH_IMAGE003
~（n-s），LFor the length of the data to be stored,
Figure 608746DEST_PATH_IMAGE004
is as followsiThe total length of the individual secure storage areas,ithe value of (1) ~n。
In the method for storing user data by using the block chain technology, after other block chain link points return their own storage capacity, the storage capacities of the nodes are sorted, and a plurality of block chain nodes with the highest storage capacity are selected according to the sorting result and the length of the data to be stored.
Method for storing user data by means of a block chain technique as described above, in particular according to L = floor (2)t) And determining the value of the number t of the block chain nodes, wherein L is the length of the data to be stored, floor is a downward rounding function in matlab, and t is the number of the block chain nodes with the highest storage capacity selected according to the length of the data to be stored.
In the method for storing user data by using the blockchain technology, the current blockchain node sends each data block to each corresponding other blockchain node, specifically, the current blockchain node sends the hash result of each data block to each corresponding other blockchain node after performing hash operation on each data block.
The method for storing user data by using the block chain technique as described above, wherein after the current block link point sends each data block to each corresponding other block link point, the method further includes:
after receiving the respective data block, the other block chain nodes store the data block into a corresponding safe storage area higher than the storage level of the data to be stored, and return the storage address of the data block to the current block chain node;
and recording other block chain nodes which are allocated with the data blocks, and corresponding to the allocated data blocks and the storage addresses and the lengths of the data blocks in the safe storage areas stored by the data blocks.
The present application further provides a blockchain storage system, which includes a plurality of blockchain devices, each blockchain device serving as a blockchain node, where the blockchain node performs any one of the above methods for storing user data by using a blockchain technique.
The present application also provides a computer-readable storage medium comprising at least one memory and at least one processor; the memory is used for storing one or more program instructions; a processor configured to execute one or more program instructions to perform a method of storing user data by a blockchain technique as described in any one of the above.
The beneficial effect that this application realized is as follows: by adopting the technical scheme, the user data needs to be preprocessed when the block chain distributed storage is carried out, then each block chain link point calculates the storage capacity of the block chain link point according to the length and the storage level of the preprocessed data, and then the data blocks are divided according to different storage capacities of different block chain nodes, so that the data can be more optimally stored in a distributed mode, and the data storage efficiency is improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments described in the present invention, and other drawings can be obtained by those skilled in the art according to the drawings.
FIG. 1 is a flow diagram of a method of storing user data via a blockchain technique;
fig. 2 is a block chain memory system for storing user data by a block chain technique.
Detailed Description
The technical solutions in the embodiments of the present invention are clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Example one
The embodiment of the application provides a method for storing user data through a block chain technology, which is applied to a block chain storage system, wherein the block chain storage system comprises a plurality of block chain devices, each block chain device is used as a block chain node, in order to ensure the safety of the user data in each block chain node, the characteristics of block chain decentralization are utilized, the user data in each block chain node is stored into other block chain nodes in a split mode according to the storage capacity of each block chain node, and each block chain node is ensured to only reserve one part of the user data in a certain block chain node, so that the safe storage of the user data is ensured.
As shown in fig. 1, the method for storing user data by using the block chain technique specifically includes the following steps:
step 110, setting a storage level for user data by the current block chain node, arranging the storage level into data to be stored, and sending the length of the data to be stored and the storage level of the data to be stored to other block chain nodes associated with the current block chain link point;
when a certain block link point needs to store user data in the block link point safely, storage levels 01-FF (which can be according to user requirements or program requirements) are set for the user data needing to be stored, source values of all data are set in the block link node in advance, for example, application programs in the current block link node are sequenced, and the application programs are sequenced according to the use process (such as logging 01, intermediate data 02 and the like), for example, data of a second application are logged, the sequencing of the second application is 02, and the logging action is 01, the data source value of the second application is logged as 0201, and then the user data, the storage levels and the data sources are arranged to obtain data to be stored; for example, the first user data 0F34567891a11 is used for the user to log in the third application safely (that is, the data source is preset to 0301), the storage level is set to 04, and the data to be stored obtained by sorting is 0F234567891a 11030104; the length and storage level of the data to be stored is then sent to each other blockchain node associated with the current blockchain link point.
It should be noted that the current block link point as referred to herein may refer to any block link point for storing user data, and does not refer to a specific block link node.
Step 120, calculating the storage capacity of each other block link point according to the length and the storage level of the data to be stored, and returning the storage capacity of each node to the current block link node;
in the embodiment of the application, n safe storage areas are distributed in each block chain node in advance according to the storage level, and only the safe storage areas higher than or equal to the storage level can store data to be stored, for example, 10 safe storage areas are provided and named as storage areas 1-10, respectively, and the data to be stored has the storage level of 4, and can only be stored into the safe storage areas 1-4 in the block chain node;
after each block link point receives the length of the data to be stored and the storage level thereof, each block link point calculates the storage capacity thereof by adopting the following formula:
Figure 74362DEST_PATH_IMAGE005
wherein the content of the first and second substances,Tis each zoneThe memory capacity of the blockchain node itself,
Figure 67726DEST_PATH_IMAGE006
is as followsjThe remaining storage length of the individual secure storage areas,nas the total number of the secure storage areas,sas a storage level of the data to be stored,jis taken from the calculation
Figure 353214DEST_PATH_IMAGE007
~（n-s），LFor the length of the data to be stored,
Figure 90226DEST_PATH_IMAGE008
is as followsiThe total length of the individual secure storage areas,ithe value of (1) ~n。
Step 130, dividing the data to be stored by the current block link point according to the storage capacity returned by other block link points to obtain a plurality of data blocks, and sending each data block to the corresponding other block link nodes;
specifically, after returning the storage capacity of each other block link point, the storage capacities of the nodes are sorted first, and according to the sorting result, the block chain nodes with the highest storage capacity are selected according to the length of the data to be stored, for example, according to L = floor (2)t) Determining the value of the node number t, wherein the floor is a downward rounding function in matlab, and then segmenting the data to be stored by adopting the following formula:
Figure 613611DEST_PATH_IMAGE009
wherein the content of the first and second substances,
Figure 840193DEST_PATH_IMAGE010
is a data block divided for the ith blockchain node,
Figure 81819DEST_PATH_IMAGE011
the storage capacity returned for the ith block link point,
Figure 153680DEST_PATH_IMAGE012
the total storage capacity of the first k block link points after sorting according to the storage capacity, L is the length of data to be stored, t is the number of a plurality of block link nodes with the highest storage capacity selected according to the length of the data to be stored, and the ceil function is an upward rounding function in matlab.
For example, if the storage capacities returned by the block link points are 0.5, 0.4, 0.22, 0.7, 0.6, and 0.32, respectively, the three block link points with the highest storage capacity are taken for data storage after the storage capacities are sorted, that is, the fourth block link node, the fifth block link node, the first block link node, and the second block link node are taken, the length 20 of the data to be stored, which is 0F234567891a11030104, is calculated according to the formula, so that the data to be stored is divided into four data blocks, which are 0F23456, 7891A1, 10301, and 04, and the four data blocks are sent to the fourth block link node, the fifth block link node, and the first block link point for storage; preferably, the hash operation may be performed on each data block, and the hash result of each data block may be sent to each block chain node.
Further, after the current block link point sends each data block to the corresponding other block link points, the following sub-steps may be further included:
step1, storing corresponding data blocks by the link points of other blocks, and returning the storage addresses of the data blocks to the current block link node; after each of the other block chaining points receives the respective data block, the data block is stored into the corresponding secure storage area, i.e. the storage area higher than the storage level of the data to be stored, preferably the data is stored in the area capable of accommodating the entire data, and then the storage address of the data block is returned to the current block chaining node.
Step2, recording the storage sequence of each data block, and the storage address and the data block length of each data block at each other block chain node by the current block chain node; in the current block chain link point, recording corresponding block chain nodes, data blocks distributed by the block chain nodes, storage addresses of stored safe storage areas and data block lengths according to the storage sequence of the storage capacity sequenced previously;
for example, the result of the current block link point record in the above example is: 0F2345604a10207, 7891a1031006, 10301a10105, 04BC1001, where the last byte is the data block length, the third last byte is the stored safe storage area storage address, and the remaining bytes are the data blocks; therefore, the data stored in the current block chain node is not direct user data, the safety of the user data in the current block chain node is ensured, and only partial user data is stored in other block chain nodes, so that the safety of the user data can be ensured.
Example two
A second embodiment of the present application provides a block chain storage system, as shown in fig. 2, including a plurality of block chain devices, where each block chain device serves as a block chain node, and divides a block chain node into a current block chain node to which data is to be allocated and other block chain nodes to which distributed storage is to be performed according to a form in which data is to be stored;
the current block chain link point comprises a to-be-stored data sorting module 211, a data sending module 212, a data receiving module 213 and a data block dividing module 214; the to-be-stored data sorting module 211 sets a storage level for the user data and sorts the user data into to-be-stored data, and the data sending module 212 sends the length of the to-be-stored data and the storage level of the to-be-stored data to other block chain nodes associated with the current block chain link point; the data receiving module 213 receives the storage capacity returned by the link points of other blocks; the data block segmentation module 214 segments the data to be stored according to the storage capacity returned by the link points of each other block to obtain a plurality of data blocks; the data sending module 212 is further configured to send each data block to each corresponding other block chain node.
Each of the other block link points includes a data receiving module 221, a storage capacity calculating module 222 and a data transmitting module 223; the data receiving module 221 receives the length of the data to be stored and the storage level thereof sent by the current blockchain node; the storage capacity calculation module 222 is configured to calculate a storage capacity of the storage module according to the length and the storage level of the data to be stored; the data sending module 223 returns the storage capability of each node to the current blockchain node.
In accordance with the embodiments described above, embodiments of the present invention provide a computer-readable storage medium having one or more program instructions embodied therein for execution by a processor to perform a method for storing user data via a block-chain technique.
The disclosed embodiments of the present invention provide a computer-readable storage medium having stored therein computer program instructions which, when run on a computer, cause the computer to perform the above-described method.
In an embodiment of the invention, the processor may be an integrated circuit chip having signal processing capability. The Processor may be a general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete Gate or transistor logic device, discrete hardware component.
The various methods, steps and logic blocks disclosed in the embodiments of the present invention may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of the method disclosed in connection with the embodiments of the present invention may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor. The software module may be located in ram, flash memory, rom, prom, or eprom, registers, etc. storage media as is well known in the art. The processor reads the information in the storage medium and completes the steps of the method in combination with the hardware.
The storage medium may be a memory, for example, which may be volatile memory or nonvolatile memory, or which may include both volatile and nonvolatile memory.
The nonvolatile Memory may be a Read-Only Memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an Electrically Erasable PROM (EEPROM), or a flash Memory.
The volatile Memory may be a Random Access Memory (RAM) which serves as an external cache. By way of example, and not limitation, many forms of RAM are available, such as Static Random Access Memory (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), SLDRAM (SLDRAM), and Direct Rambus RAM (DRRAM).
The storage media described in connection with the embodiments of the invention are intended to comprise, without being limited to, these and any other suitable types of memory.
Those skilled in the art will appreciate that the functionality described in the present invention may be implemented in a combination of hardware and software in one or more of the examples described above. When software is applied, the corresponding functionality may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a general purpose or special purpose computer.
The above-mentioned embodiments, objects, technical solutions and advantages of the present invention are further described in detail, it should be understood that the above-mentioned embodiments are only exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made on the basis of the technical solutions of the present invention should be included in the scope of the present invention.

Claims (10)

1. A method for storing user data via a blockchain technique, comprising:
the current block chain node sets a storage level for the user data, arranges the storage level into data to be stored, and sends the length of the data to be stored and the storage level of the data to be stored to other block chain nodes associated with the current block chain link point;
other block chain link points respectively calculate the storage capacity of the other block chain link points according to the length and the storage level of the data to be stored, and the storage capacity of each block chain node is returned to the current block chain node;
and the current block chain node divides the data to be stored according to the storage capacity returned by other block chain nodes to obtain a plurality of data blocks, and sends each data block to the corresponding other block chain nodes.
2. The method according to claim 1, wherein the user data is sorted according to the application of the user data and the source value of the user data is set in the blockchain node according to the sorting, the user data, the storage level and the data source are sorted to obtain the data to be stored, and the length and the storage level of the data to be stored are sent to each other blockchain node associated with the current blockchain link point.
3. The method of claim 1, wherein n security storage areas are previously allocated in each blockchain node according to a storage level, and it is agreed that only security storage areas higher than or equal to the storage level of the data to be stored can store the data to be stored.
4. A method of storing user data by a block chain technique as claimed in claim 3, wherein after each block chain node receives the length of data to be stored and its storage level, each block chain node calculates its own storage capacity using the following formula:
Figure 290997DEST_PATH_IMAGE001
wherein the content of the first and second substances,Tits own storage capacity calculated for each blockchain node,
Figure 4875DEST_PATH_IMAGE002
is as followsjThe remaining storage length of the individual secure storage areas,nas the total number of the secure storage areas,sas a storage level of the data to be stored,jis taken from the calculation
Figure 784612DEST_PATH_IMAGE003
~（n-s），LFor the length of the data to be stored,
Figure 710980DEST_PATH_IMAGE004
is as followsiThe total length of the individual secure storage areas,ithe value of (1) ~n。
5. The method according to claim 1, wherein after the other block link points return their own storage capacities, the storage capacities of the nodes are sorted, and a plurality of block link nodes with the highest storage capacity are selected according to the sorting result and the length of the data to be stored.
6. Method for storing user data by means of block chain technique as claimed in claim 5, characterized in that specifically according to L = floor (2)t) And determining the value of the number t of the block chain nodes, wherein L is the length of the data to be stored, floor is a downward rounding function in matlab, and t is the number of the block chain nodes with the highest storage capacity selected according to the length of the data to be stored.
7. The method according to claim 1, wherein the current blockchain node sends each data block to each of the other corresponding blockchain nodes, and specifically, the current blockchain node sends the hash result of each data block to each of the other corresponding blockchain nodes after performing the hash operation on each data block.
8. The method of claim 1, wherein after the current block link point sends each data block to the corresponding other block link points, the method further comprises:
after receiving the respective data block, the other block chain nodes store the data block into a corresponding safe storage area higher than the storage level of the data to be stored, and return the storage address of the data block to the current block chain node;
and recording other block chain nodes which are allocated with the data blocks, and corresponding to the allocated data blocks and the storage addresses and the lengths of the data blocks in the safe storage areas stored by the data blocks.
9. A blockchain storage system comprising a plurality of blockchain devices, each blockchain device acting as a blockchain node, the blockchain node performing the method of storing user data by blockchain technique according to any one of claims 1 to 8.
10. A computer-readable storage medium comprising at least one memory and at least one processor; the memory is used for storing one or more program instructions; a processor arranged to execute one or more program instructions for performing a method of storing user data by a block chain technique as claimed in any one of claims 1 to 8.
CN202110451529.5A 2021-04-26 2021-04-26 Method and system for storing user data through block chain technology Pending CN112988075A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110451529.5A CN112988075A (en) 2021-04-26 2021-04-26 Method and system for storing user data through block chain technology

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110451529.5A CN112988075A (en) 2021-04-26 2021-04-26 Method and system for storing user data through block chain technology

Publications (1)

Publication Number Publication Date
CN112988075A true CN112988075A (en) 2021-06-18

Family

ID=76340148

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110451529.5A Pending CN112988075A (en) 2021-04-26 2021-04-26 Method and system for storing user data through block chain technology

Country Status (1)

Country Link
CN (1) CN112988075A (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113435307A (en) * 2021-06-23 2021-09-24 国网天津市电力公司 Operation and maintenance method, system and storage medium based on visual identification technology
CN113900598A (en) * 2021-12-10 2022-01-07 北京百度网讯科技有限公司 Block chain based data storage method, device, equipment and storage medium
CN114877943A (en) * 2022-05-19 2022-08-09 生态环境部华南环境科学研究所(生态环境部生态环境应急研究所) Ecological environment monitoring device based on block chain
CN115016743A (en) * 2022-08-08 2022-09-06 广东省信息工程有限公司 Distributed file storage and access control method, computer device and storage medium

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108712488A (en) * 2018-05-11 2018-10-26 北京奇虎科技有限公司 A kind of data processing method based on block chain, device, block catenary system
CN111859457A (en) * 2020-07-31 2020-10-30 联想(北京)有限公司 Intelligent contract setting method and system

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108712488A (en) * 2018-05-11 2018-10-26 北京奇虎科技有限公司 A kind of data processing method based on block chain, device, block catenary system
CN111859457A (en) * 2020-07-31 2020-10-30 联想(北京)有限公司 Intelligent contract setting method and system

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113435307A (en) * 2021-06-23 2021-09-24 国网天津市电力公司 Operation and maintenance method, system and storage medium based on visual identification technology
CN113900598A (en) * 2021-12-10 2022-01-07 北京百度网讯科技有限公司 Block chain based data storage method, device, equipment and storage medium
CN114877943A (en) * 2022-05-19 2022-08-09 生态环境部华南环境科学研究所(生态环境部生态环境应急研究所) Ecological environment monitoring device based on block chain
CN114877943B (en) * 2022-05-19 2024-04-09 生态环境部华南环境科学研究所(生态环境部生态环境应急研究所) Ecological environment monitoring device based on block chain
CN115016743A (en) * 2022-08-08 2022-09-06 广东省信息工程有限公司 Distributed file storage and access control method, computer device and storage medium

Similar Documents

Publication Publication Date Title
CN112988075A (en) Method and system for storing user data through block chain technology
US10776263B2 (en) Non-deterministic window scheduling for data storage systems
KR102284972B1 (en) Data processing method and device
CN109033422B (en) Method and device for generating block chain and block chain
CN100367306C (en) Nonvolatile memory card
TW201823988A (en) Block data checking method and device
CN103730162B (en) The soft reading of acceleration of nonvolatile memory for multi-level unit
CN110658990A (en) Data storage system with improved preparation time
CN110602239A (en) Block chain information storage method and related equipment
CN112654993A (en) Secure memory system programming
KR20200053600A (en) Buffer status reporting method, terminal and computer storage medium
US12008235B2 (en) Data storage device and method for rewriting parameters thereof
CN107526539A (en) Data storage device and data maintenance method thereof
CN112347007B (en) Flash memory data protection method and device, electronic equipment and storage medium
US20060015793A1 (en) Method of combining multilevel memory cells for an error correction scheme
US11409646B2 (en) Method for releasing memory
CN104461959B (en) Method and device for distinguishing NOR Flash from NAND Flash
CN110321133B (en) H5 application deployment method and device
KR102580634B1 (en) Data processing methods and associated data processors for memory
CN110750215A (en) Method and device for improving random reading performance of solid state disk and computer equipment
CN106155916A (en) Data storage device and data reading method
US10754548B2 (en) Data storage device and method for rewriting parameters thereof
CN116431382B (en) Error correction unit management method, memory control chip and flash memory device
CN210109808U (en) Processor chip
EP4398085A1 (en) Electronic device and operating method thereof

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20210618

RJ01 Rejection of invention patent application after publication