WO2022088184A1 - 数据的存储方法、电子设备以及计算机可读存储介质 - Google Patents

数据的存储方法、电子设备以及计算机可读存储介质 Download PDF

Info

Publication number
WO2022088184A1
WO2022088184A1 PCT/CN2020/125937 CN2020125937W WO2022088184A1 WO 2022088184 A1 WO2022088184 A1 WO 2022088184A1 CN 2020125937 W CN2020125937 W CN 2020125937W WO 2022088184 A1 WO2022088184 A1 WO 2022088184A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
incremental information
information
data blocks
incremental
Prior art date
Application number
PCT/CN2020/125937
Other languages
English (en)
French (fr)
Inventor
曲强
许沁琪
张孟秋
Original Assignee
中国科学院深圳先进技术研究院
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 中国科学院深圳先进技术研究院 filed Critical 中国科学院深圳先进技术研究院
Priority to PCT/CN2020/125937 priority Critical patent/WO2022088184A1/zh
Publication of WO2022088184A1 publication Critical patent/WO2022088184A1/zh

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/13—File access structures, e.g. distributed indices
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/30—Authentication, i.e. establishing the identity or authorisation of security principals
    • G06F21/31—User authentication

Definitions

  • the present application relates to the technical field of data storage, and in particular, to a data storage method, an electronic device, and a computer-readable storage medium.
  • DNA (deoxyribonucleic acid, deoxyribonucleic acid) storage has become a hot spot in the scientific research community in recent years due to its high storage density and long storage time. It is considered to be an information storage technology with great application prospects.
  • DNA storage is an The future epoch-making storage technology uses artificially synthesized deoxyribonucleic acid (DNA) as a storage medium, which has the advantages of high efficiency, large storage capacity, long storage time, easy access and maintenance-free.
  • DNA storage has made some progress in the design and improvement of the coding system, increasing the storage density and strengthening the reliability of unilateral information storage.
  • the technology needs to be improved in terms of DNA information storage to achieve efficient data update and data management.
  • DNA storage converts the data stored in the computer into a DNA sequence file
  • the current stage needs to store and read the DNA sequence in vivo or in vitro. And decode and restore it into a computer-stored file, encode the added data together, and then perform the DNA storage operation. This process costs a lot, and when the information is updated frequently, the data update efficiency is very low.
  • the main technical problem to be solved by this application is to provide a data storage method, an electronic device and a computer-readable storage medium, which can improve the data update efficiency in the DNA storage medium and reduce the storage cost.
  • a technical solution adopted by the present application is to provide a data storage method, the method includes: acquiring incremental information corresponding to target data; wherein, the target data is divided into multiple data blocks and stored in a DNA storage medium using a DNA storage method , the incremental information is generated based on the operation on the target data; the incremental information is stored, and the association relationship with the corresponding data blocks in the multiple data blocks is established.
  • acquiring the incremental information corresponding to the target data includes: acquiring at least one incremental information generated at the current moment; storing the incremental information, and establishing an association relationship with the corresponding data blocks in the multiple data blocks, including: At least one incremental information generated at the moment is added to the directed acyclic graph, and an association relationship is established with the corresponding data blocks in the multiple data blocks, or the incremental information added historically in the directed acyclic graph; wherein, the historically added incremental information The incremental information is associated with the corresponding data blocks in the multiple data blocks.
  • acquiring at least one incremental information generated at the current moment includes: acquiring at least one incremental information generated at the current moment and corresponding user information; adding the at least one incremental information generated at the current moment to the directed acyclic graph, and Establishing an association relationship with the corresponding data blocks in the multiple data blocks or the incremental information added in the history of the directed acyclic graph, including: adding at least one incremental information generated at the current moment to the directed acyclic graph, and establishing An association relationship with the corresponding data block in the multiple data blocks, or the incremental information of the corresponding user information added to the history of the acyclic graph.
  • acquiring at least one incremental information generated at the current moment and corresponding user information includes: acquiring at least one incremental information generated at the current moment and corresponding user information, and setting the first incremental information for the at least one incremental information generated at the current moment Version information; at least one incremental information generated at the current moment is added to the directed acyclic graph, and the incremental information corresponding to the corresponding data blocks in the multiple data blocks or the corresponding user information historically added to the directed acyclic graph is established.
  • the association relationship includes: adding at least one incremental information generated at the current moment to the directed acyclic graph, and establishing a relationship with the corresponding data block in the multiple data blocks, or the corresponding user information historically added in the directed acyclic graph An association relationship between incremental information of the second version information, wherein the incremental information of the second version information is added to the directed acyclic graph at the previous moment.
  • storing the incremental information and establishing an association relationship with the corresponding data blocks in the multiple data blocks also includes: forming a set of at least one incremental information generated at the current moment, and storing it in the DNA storage medium by using the DNA storage method middle.
  • the target data is divided into a plurality of data blocks and stored in the DNA storage medium by using DNA storage method, including: hashing each data block to obtain the first hash value corresponding to each data block; The first hash values corresponding to the data blocks are mapped to the child nodes of the file index tree to form the file index tree.
  • mapping the first hash value corresponding to each data block to the child nodes of the file index tree to form the file index tree includes: combining the first hash values of each two child nodes into a string; Perform hash processing to obtain a second hash value corresponding to the string; use the second hash value as the hash value of the parent node of each two child nodes.
  • the target data Before acquiring the incremental information corresponding to the target data, it includes: performing identity authentication and authority authentication on the user, and if the identity authentication and authority authentication are successful, the user is allowed to operate the target data.
  • Another technical solution adopted in the present application is to provide an electronic device, the electronic device includes a processor and a memory coupled to the processor; wherein the memory is used to store program data, and the processor is used to execute the program data to achieve the following: The method provided by the above technical solution.
  • Another technical solution adopted in this application is to provide a computer-readable storage medium, where the computer-readable storage medium is used to store program data, and when the program data is executed by a processor, it is used to implement the method provided by the above technical solution .
  • a data storage method of the present application includes: acquiring incremental information corresponding to target data; wherein, the target data is divided into a plurality of data blocks and adopts The DNA storage method is stored in the DNA storage medium, and the incremental information is generated based on the operation of the target data; the incremental information is stored, and an association relationship with the corresponding data blocks in multiple data blocks is established.
  • the incremental information is used to establish an association relationship with the data block, so as to avoid the incremental information to directly update the data in the DNA storage medium, without destroying the integrity of the original data in the DNA storage medium, thereby reducing the data update in the DNA storage medium.
  • the required encoding and decoding storage operations can improve the data update efficiency in the DNA storage medium and reduce storage costs.
  • FIG. 1 is a schematic flowchart of an embodiment of a data storage method provided by the present application.
  • FIG. 2 is a schematic diagram of an application of a method for storing data provided by the present application
  • FIG. 3 is a schematic flowchart of another embodiment of a data storage method provided by the present application.
  • Fig. 4 is another application schematic diagram of the storage method of data provided by the present application.
  • Fig. 5 is another application schematic diagram of the storage method of data provided by the present application.
  • Fig. 6 is another application schematic diagram of the storage method of data provided by the present application.
  • FIG. 7 is a schematic flowchart of another embodiment of a data storage method provided by the present application.
  • FIG. 8 is a schematic structural diagram of an embodiment of an electronic device provided by the present application.
  • FIG. 9 is a schematic structural diagram of an embodiment of a computer-readable storage medium provided by the present application.
  • FIG. 1 is a schematic flowchart of an embodiment of a data storage method provided by the present application. The method includes:
  • Step 11 Acquire incremental information corresponding to the target data; wherein, the target data is divided into a plurality of data blocks and stored in the DNA storage medium in a DNA storage manner, and the incremental information is generated based on operations on the target data.
  • the data generated by all operations on the target data are identified as incremental information, that is, the data generated by operations such as adding, deleting, modifying and searching for target data are identified as incremental information. For example, if the target data is "1234", modify the target data at this time, and modify the target data to "124", then the "124" at this time and the modification operation to the target data "1234" are incremental information. For another example, if the target data has one piece of data "1234", then add a piece of data "5678" to the target data, then the target data has two pieces of data "1234" and "5678", then the "1234" and "5678” at this time And the addition operation to the target data "1234" is incremental information.
  • the target data is divided into multiple data blocks, and each data block can be marked, and the incremental information is to operate on the content of each data block.
  • the target data may be divided according to a preset size, and the preset size may be 256KB, 1M, 2M, or the like.
  • hash processing is performed on each data block to obtain a first hash value corresponding to each data block; the first hash value corresponding to each data block is mapped to a child of the file index tree nodes to form a file index tree.
  • the first hash value of each two sub-nodes can be combined into a string; the string is hashed to obtain a second hash value corresponding to the string; the second hash value can be used as each two sub-nodes
  • the hash value of the parent node is performed on each data block to obtain a first hash value corresponding to each data block; the first hash value corresponding to each data block is mapped to a child of the file index tree nodes to form a file index tree.
  • the file index tree can be a Merkle tree.
  • the first hash value of each data block is mapped to the Merkle tree child nodes, as a Merkle tree, the first hash value of each two child nodes is combined into a string, and then the hash value of this string is calculated as the two
  • the hash value of the parent node corresponding to each leaf node is calculated upward, and finally a root hash value is obtained.
  • the file index tree generated in this way may be stored in the DNA storage medium, or may be stored in the storage medium of the device interacting with the DNA storage medium. The storage of incremental information does not need to modify the hash value of the Merkle tree, which is low cost and high efficiency.
  • the data is divided into F1 data block, F2 data block and F3 data block, and then the F1 data block, F2 data block and F3 data block are hashed to obtain the corresponding first hash value, the first
  • the character length of the hash value is set according to actual needs, which can be 64 characters or 128 characters.
  • a file index tree including A, B, C, D and E nodes in Fig. 2 is constructed according to the first hash value.
  • the first hash value corresponding to the F2 data block is mapped to the E node
  • the first hash value corresponding to the F3 data block is mapped to the D node
  • the first hash value corresponding to the F1 data block is mapped to the B node.
  • the first hash value of the D node and the first hash value of the E node are combined into a string, and then the string is calculated to generate a second hash value, which is mapped to the parent node C of the D node and the E node.
  • the second hash value of node C and the first hash value of node B are combined into a string, and then the string is calculated to generate a new second hash value, and the new second hash value is Map to parent node A of nodes B and C.
  • the A node is the root node. So far, the file index tree is constructed, and the file index tree can be stored in the DNA storage medium, or stored in other storage mediums.
  • all data exists in binary form.
  • the binary data is encoded and mapped into A, T, G and C base sequences in DNA, and long-chain DNA is formed in sequence order for preservation. For example, “00” corresponds to A, "01” corresponds to G, "10” corresponds to C, and "11” corresponds to T, then the binary "00111001" can be mapped to the sequence of "A, T, C and G".
  • the corresponding target data is divided into a plurality of data blocks and then stored in the DNA storage medium using the above-mentioned DNA storage method.
  • multiple users can operate on the data, then perform identity authentication and authority authentication on the user before step 11. If the identity authentication and authority authentication are successful, the user is allowed to operate the target data. User identity management is implemented in this way.
  • Step 12 Store the incremental information, and establish an association relationship with the corresponding data blocks in the multiple data blocks.
  • the incremental information is also stored in the DNA storage medium in a DNA storage manner, the location of the incremental information in the DNA storage medium is different from the location of the target data, and the target data will not be updated.
  • the incremental information can also be processed into blocks, divided into multiple data blocks, and then marked and correlated with each other to establish an association relationship with the corresponding data blocks in the multiple data blocks, and then the above-mentioned DNA is used.
  • the storage method is stored in the DNA storage medium.
  • the original data is divided into blocks to obtain multiple data blocks, each data block is marked, and then the multiple data blocks are stored in the DNA storage medium by using the DNA storage method.
  • the target data block is operated, it is first read from the DNA storage medium according to the mark, then decoded into a binary file, and then operated based on the binary file, and the file after the operation is completed is the incremental information.
  • the file is divided into blocks, and the divided file is stored in a DNA storage medium by using a DNA storage method to store multiple data blocks.
  • the location of the partitioned file in the DNA storage medium is different from the location of the original data, and the original data will not be updated.
  • the incremental information corresponding to the target data is obtained; wherein, the target data is divided into a plurality of data blocks and stored in the DNA storage medium in the DNA storage mode, and the incremental information is generated based on the operation of the target data; the incremental information is Storage is performed, and an association relationship with corresponding data blocks in multiple data blocks is established.
  • the incremental information is used to establish an association relationship with the data block, so as to avoid the incremental information to directly update the data in the DNA storage medium, without destroying the integrity of the original data in the DNA storage medium, thereby reducing the data update in the DNA storage medium.
  • the required encoding and decoding storage operations can improve the data update efficiency in the DNA storage medium and reduce storage costs.
  • FIG. 3 is a schematic flowchart of another embodiment of the data storage method provided by the present application.
  • the method includes:
  • Step 31 Acquire at least one incremental information generated at the current moment.
  • multiple users may operate the data, then perform identity authentication and authority authentication on the user before step 31, and if the identity authentication and authority authentication succeed, allow the user to operate the target data.
  • User identity management is implemented in this way.
  • the at least one incremental information generated at the current moment may correspond to different data blocks, or may be operations performed on the same data block by different users.
  • step 32 is performed; if the current moment is not the first operation on the original data, after step 31 is performed, step 33 is performed.
  • Step 32 Add at least one incremental information generated at the current moment to the directed acyclic graph, and establish an association relationship with the corresponding data blocks in the multiple data blocks.
  • step 32 is illustrated with FIG. 4:
  • the original data F is divided into F1 data blocks, F2 data blocks, F3 data blocks, F4 data blocks, and F5 data blocks.
  • the first user operates on the F1 data block at the current moment to generate the first incremental information
  • the second user operates on the F1 data block at the current moment.
  • the second increment information is generated by operating on the F4 data block at the current moment.
  • the directed acyclic graph increases the One increment information and second increment information, and the first increment information points to the F1 data block and establishes an association relationship with the F1 data block, and the second increment information points to the F4 data block and establishes an association relationship with the F4 data block.
  • step 32 is illustrated with FIG. 5:
  • the original data F is divided into F1 data block, F2 data block, F3 data block, F4 data block and F5 data block.
  • the first user operates the F3 data block at the current moment to generate the first increment information
  • the second user is in the
  • the second increment information is generated by operating on the F3 data block at the current moment.
  • the directed acyclic graph increases the One increment information and second increment information, and the first increment information points to the F3 data block and establishes an association relationship with the F3 data block, and the second increment information also points to the F3 data block and establishes an association relationship with the F3 data block.
  • Step 33 Add at least one incremental information generated at the current moment to the directed acyclic graph, and establish an association relationship with the historically added incremental information in the directed acyclic graph.
  • step 33 is illustrated with FIG. 6:
  • the original data F is divided into F1 data block, F2 data block, F3 data block, F4 data block and F5 data block.
  • Operating on the F4 data block at the previous moment produces the second incremental information.
  • the directed acyclic graph increases the One increment information and second increment information, and the first increment information points to the F1 data block and establishes an association relationship with the F1 data block, and the second increment information points to the F4 data block and establishes an association relationship with the F4 data block.
  • the operation of the F1 data block by the first user at the current moment generates the third increment information
  • the operation of the F5 data block by the second user at the current moment generates the fourth increment information.
  • the third increment information and the fourth increment information are added to the directed acyclic graph, and the third increment information points to the first increment information, and the The first increment information establishes an association relationship
  • the fourth increment information points to the F5 data block and establishes an association relationship with the F5 data block.
  • At least one incremental information generated at the current moment is formed into a set, and stored in the DNA storage medium in a DNA storage manner. In this way, incremental information generated at the same moment can be recorded, which is convenient for classification and storage. in DNA storage media.
  • the incremental information is used to establish an association relationship with the data block, so as to avoid the incremental information to directly update the data in the DNA storage medium, without destroying the integrity of the original data in the DNA storage medium, thereby reducing the data update in the DNA storage medium.
  • the required encoding and decoding storage operations can improve the data update efficiency in the DNA storage medium and reduce storage costs.
  • FIG. 7 is a schematic flowchart of another embodiment of the data storage method provided by the present application.
  • the method includes:
  • Step 71 Acquire at least one incremental information generated at the current moment and corresponding user information.
  • multiple users may operate on the data, and the user is authenticated before step 71 to perform identity authentication and authority authentication. If the identity authentication and authority authentication are successful, the user is allowed to operate the target data. User identity management is implemented in this way.
  • user information is set for different users.
  • step 72 is performed; if the user does not operate on the data for the first time at the current moment, after step 71 is performed, step 73 is performed.
  • version information is added to the incremental information generated by the operation at the current moment.
  • the version information of the incremental information generated for the first time is V1
  • the version information of the incremental information generated for the second time is V2. Since different users are involved, user information needs to be added to distinguish them. If the first user is recorded as id1 and the second user is recorded as id2, the incremental information generated by the operation of the first user at the current moment can be recorded as "xxxV1-id1", and the incremental information generated by the operation of the second user at the current moment can be recorded as "xxxV1-id2".
  • Step 72 Add at least one incremental information generated at the current moment to the directed acyclic graph, and establish an association relationship with a corresponding data block in the multiple data blocks.
  • the incremental information corresponding to the user is associated with the data block according to different user information, and the incremental information is added to the directed acyclic graph.
  • Step 73 Add at least one incremental information generated at the current moment to the directed acyclic graph, and establish an association relationship with the incremental information of the corresponding user information added historically in the directed acyclic graph.
  • At least one incremental information generated at the current moment and corresponding user information are acquired, and the first version information is set for the at least one incremental information generated at the current moment;
  • To operate add at least one incremental information generated at the current moment to the directed acyclic graph, and establish an association relationship with the corresponding data blocks in the multiple data blocks, if the current moment is not the first time the user operates on the data , adding at least one incremental information generated at the current moment to the directed acyclic graph, and establishing an association relationship with the incremental information of the second version information of the corresponding user information historically added in the directed acyclic graph, wherein the first The incremental information of the second version information is added to the directed acyclic graph at the previous moment. It can be understood that the incremental information generated by the same user's operations on the same data block at different times can be set in sequence for the version information.
  • all data operations are recorded as incremental information, and then the incremental information is stored.
  • the storage of incremental information does not require reading the DNA sequence of the original data for decoding, adding data and re-encoding operations, but directly recording the incremental information including time, user, version and other information, and connecting pointers to form a directed acyclic graph structure, which requires reading When fetching files, file reorganization is performed. Compared with the traditional technology, it saves a lot of time and cost, and can improve the data update efficiency in the DNA storage medium and reduce the storage cost.
  • FIG. 8 is a schematic structural diagram of an embodiment of an electronic device provided by the present application.
  • the electronic device 80 includes a processor 81 and a memory 82 coupled to the processor 81; wherein, the memory 82 is used to store program data, and the processor 81 is used to execute the program data to implement the following methods:
  • the target data is divided into a plurality of data blocks and stored in the DNA storage medium in a DNA storage mode, and the incremental information is generated based on the operation of the target data; the incremental information is stored and stored in the DNA storage medium.
  • processor 81 in this embodiment is used to execute program data, and may also implement any method in the above-mentioned embodiments, which will not be repeated here.
  • FIG. 9 is a schematic structural diagram of an embodiment of a computer-readable storage medium provided by the present application.
  • the computer storage medium 90 is used to store program data 91, and when the program data 91 is executed by the processor, it is used to implement the following methods :
  • the target data is divided into a plurality of data blocks and stored in the DNA storage medium in a DNA storage mode, and the incremental information is generated based on the operation of the target data; the incremental information is stored and stored in the DNA storage medium.
  • computer storage medium 90 in this embodiment can also implement any method in the above-mentioned embodiments, and details are not repeated here.
  • the disclosed method and apparatus may be implemented in other manners.
  • the device implementations described above are only illustrative.
  • the division of the modules or units is only a logical function division. In actual implementation, there may be other divisions.
  • multiple units or components may be Incorporation may either be integrated into another system, or some features may be omitted, or not implemented.
  • the units described as separate components may or may not be physically separated, and components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution in this implementation manner.
  • each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit.
  • the above-mentioned integrated units may be implemented in the form of hardware, or may be implemented in the form of software functional units.
  • the integrated units in the other embodiments described above are implemented in the form of software functional units and sold or used as independent products, they may be stored in a computer-readable storage medium.
  • the technical solutions of the present application can be embodied in the form of software products in essence, or the parts that contribute to the prior art, or all or part of the technical solutions, and the computer software products are stored in a storage medium , including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor (processor) to execute all or part of the steps of the methods described in the various embodiments of the present application.
  • the aforementioned storage medium includes: U disk, mobile hard disk, Read-Only Memory (ROM, Read-Only Memory), Random Access Memory (RAM, Random Access Memory), magnetic disk or optical disk and other media that can store program codes .

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Security & Cryptography (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Computer Hardware Design (AREA)
  • Software Systems (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

一种数据的存储方法、电子设备以及计算机可读存储介质，涉及数据存储技术领域。该方法包括：获取对应目标数据的增量信息；其中，目标数据划分为多个数据块并采用DNA存储方式存储于DNA存储介质中，增量信息基于对目标数据的操作产生（11）；将增量信息进行存储，并建立与多个数据块中对应数据块的关联关系（12）。通过上述方式，能够提高DNA存储介质中数据更新效率，减少存储成本。

Description

数据的存储方法、电子设备以及计算机可读存储介质 【技术领域】
本申请涉及数据存储技术领域，特别是涉及一种数据的存储方法、电子设备以及计算机可读存储介质。
【背景技术】
DNA(deoxyribonucleic acid，脱氧核糖核酸)存储因其存储密度大以及存储时间长等良好特性近年来成为科研界热点，被认为是一种具有巨大应用前景的信息存储技术，DNA存储是一项着眼于未来的具有划时代意义存储技术，它利用人工合成的脱氧核糖核酸(DNA)作为存储介质，具有高效、存储量大、存储时间长、易获取且免维护的优点。目前DNA存储在编码系统的设计与改进、提高存储密度和加强单方信息存储可靠性等方面已取得了一定进展，而在DNA信息存储实现高效的数据更新以及数据管理方面技术有待提升。
当前已有方案在做数据更新时所需花费较大，由于DNA存储是将计算机存储的数据转换成DNA序列文件，若需要修改数据，目前阶段是需要在生物体内或体外存储读取DNA序列，并解码恢复成计算机存储的文件，将增加的数据一同编码再进行DNA存储操作。该过程花费成本较大，在信息更新频繁时，数据更新效率非常低。
【发明内容】
本申请主要解决的技术问题是提供数据的存储方法、电子设备以及计算机可读存储介质，能够提高DNA存储介质中数据更新效率，减少存储成本。
本申请采用的一种技术方案是提供一种数据的存储方法，该方法包括：获取对应目标数据的增量信息；其中，目标数据划分为多个数据块并采用DNA存储方式存储于DNA存储介质中，增量信息基于对目标数据的操作产生；将增量信息进行存储，并建立与多个数据块中对应数据块的关联关系。
其中，获取对应目标数据的增量信息，包括：获取当前时刻产生的至少一个增量信息；将增量信息进行存储，并建立与多个数据块中对应数据块的关联关系，包括：将当前时刻产生的至少一个增量信息添加至有向无环图，并建立与多个数据块中对应数据块、或有向无环图中历史添加的增量信息的关联关系；其中，历史添加的增量信息与多个数据块中对应数据块存在关联关系。
其中，获取当前时刻产生的至少一个增量信息，包括：获取当前时刻产生的至少一个增量信息以及对应的用户信息；将当前时刻产生的至少一个增量信息添加至有向无环图，并建立与多个数据块中对应数据块、或有向无环图中历史添加的增量信息的关联关系，包括：将当前时刻产生的至少一个增量信息添加至有向无环图，并建立与多个数据块中对应数据块、或有向无环图中历史添加的对应用户信息的增量信息的关联关系。
其中，获取当前时刻产生的至少一个增量信息以及对应的用户信息，包括：获取当前时刻产生的至少一个增量信息以及对应的用户信息，并对当前时刻产生的至少一个增量信息设置第一版本信息；将当前时刻产生的至少一个增量信息添加至有向无环图，并建立与多个数据块中对应数据块、或有向无环图中历史添加的对应用户信息的增量信息的关联关系，包括：将当前时刻产生的至少一个增量信息添加至有向无环图，并建立与多个数据块中对应数据块、或有向无环图中历史添加的对应用户信息的第二版本信息的增量信息的关联关系，其中，第二版本信息的增量信息为前一时刻添加至有向无环图的。
其中，将增量信息进行存储，并建立与多个数据块中对应数据块的关联关系，还包括：将当前时刻产生的至少一个增量信息组成集合，并采用DNA存储方式存储于DNA存储介质中。
其中，目标数据划分为多个数据块并采用DNA存储方式存储于DNA存储介质中，包括：对每个数据块进行哈希处理，以得到每个数据块对应的第一哈希值；将每个数据块对应的第一哈希值映射至文件索引树的子节点，以形成文件索引树。
其中，将每个数据块对应的第一哈希值映射至文件索引树的子节点，以形成文件索引树，包括：将每两个子节点的第一哈希值合并成字符串；对字符串进行哈希处理，得到字符串对应的第二哈希值；将第二哈希值作为每两个子节点的父节点的哈希值。
其中，获取对应目标数据的增量信息之前，包括：对用户进行身份认证以及权限认证，若身份认证以及权限认证成功，则允许用户对目标数据进行操作。
本申请采用的另一种技术方案是提供一种电子设备，该电子设备包括处理器以及与处理器耦接的存储器；其中，存储器用于存储程序数据，处理器用于执行程序数据，以实现如上述技术方案提供的方法。
本申请采用的另一种技术方案是提供一种计算机可读存储介质，该计算机可读存储介质用于存储程序数据，程序数据在被处理器执行时，用于实现如上述技术方案提供的方法。
本申请的有益效果是：区别于现有技术的情况，本申请的一种数据的存储方法，该方法包括：获取对应目标数据的增量信息；其中，目标数据划分为多个数据块并采用DNA存储方式存储于DNA存储介质中，增量信息基于对目标数据的操作产生；将增量信息进行存储，并建立与多个数据块中对应数据块的关联关系。通过上述方式，利用增量信息与数据块建立关联关系，避免增量信息直接对DNA存储介质中的数据进行更新，无需破坏DNA存储介质中原始数据的完整性，进而减少DNA存储介质中数据更新所需要的编码以及解码的存储操作，能够提高DNA存储介质中数据更新效率，减少存储成本。
【附图说明】
为了更清楚地说明本申请实施例中的技术方案，下面将对实施例描述中所需要使用的附图作简单地介绍，显而易见地，下面描述中的附图仅仅是本申请的一些实施例，对于本领域普通技术人员来讲，在不付出创造性劳动的前提下，还可以根据这些附图获得其他的附图。其中：
图1是本申请提供的数据的存储方法一实施例的流程示意图；
图2是本申请提供的数据的存储方法一应用示意图；
图3是本申请提供的数据的存储方法另一实施例的流程示意图；
图4是本申请提供的数据的存储方法另一应用示意图；
图5是本申请提供的数据的存储方法另一应用示意图；
图6是本申请提供的数据的存储方法另一应用示意图；
图7是本申请提供的数据的存储方法另一实施例的流程示意图；
图8是本申请提供的电子设备一实施例的结构示意图；
图9是本申请提供的计算机可读存储介质一实施例的结构示意图。
【具体实施方式】
下面将结合本申请实施例中的附图，对本申请实施例中的技术方案进行清楚、完整地描述。可以理解的是，此处所描述的具体实施例仅用于解释本申请，而非对本申请的限定。另外还需要说明的是，为了便于描述，附图中仅示出了与本申请相关的部分而非全部结构。基于本申请中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例，都属于本申请保护的范围。
在本文中提及“实施例”意味着，结合实施例描述的特定特征、结构或特性可以包含在本申请的至少一个实施例中。在说明书中的各个位置出现该短语并不一定均是指相同的实施例，也不是与其它实施例互斥的独立的或备选的实施例。本领域技术人员显式地和隐式地理解的是，本文所描述的实施例可以与其它实施例相结合。
参阅图1，图1是本申请提供的数据的存储方法一实施例的流程示意图。该方法包括：
步骤11：获取对应目标数据的增量信息；其中，目标数据划分为多个数据块并采用DNA存储方式存储于DNA存储介质中，增量信息基于对目标数据的操作产生。
对目标数据的所有操作所产生的数据均认定为增量信息，即对目标数据的增加、删除、修改和查找等操作所产生的数据认定为增量信息。如：目标数据为“1234”，此时对目标数据进行修改，将目标数据修改 为“124”，则此时的“124”以及对目标数据“1234”的修改操作则为增量信息。又如，目标数据有一条数据“1234”，此时对目标数据增加一条数据“5678”，则目标数据有两条数据“1234”和“5678”，则此时的“1234”和“5678”以及对目标数据“1234”的增加操作则为增量信息。
将目标数据划分为多个数据块，可以对每个数据块进行标记，则增量信息是对于每个数据块的内容做操作。如，可以将目标数据按照预设大小进行划分，预设大小可以为256KB、1M、2M等。
在一些实施例中，将对每个数据块进行哈希处理，以得到每个数据块对应的第一哈希值；将每个数据块对应的第一哈希值映射至文件索引树的子节点，以形成文件索引树。具体地，可以将每两个子节点的第一哈希值合并成字符串；对字符串进行哈希处理，得到字符串对应的第二哈希值；将第二哈希值作为每两个子节点的父节点的哈希值。
可选的，文件索引树可以是Merkle树。将每个数据块的第一哈希值映射到Merkle树子节点，作为Merkle树，每两个子节点的第一哈希值合并成一个字符串，然后运算这个字符串的哈希值作为这两个叶子节点对应的父节点的哈希值，以此往上运算，最终得到一个根哈希值。如果篡改数据信息，将导致篡改数据部分所在数据块的第一哈希值变化，Merkle树指向该块的子节点将变化，同时包含该子节点的所有子树哈希值都将变化，这样使得篡改数据成本极其高昂，从而在原始数据上篡改数据将不可执行。在一应用场景中，通过此方式生成的文件索引树可以存储在DNA存储介质中，也可以存储在与DNA存储介质交互的设备的存储介质中。增量信息的存储无需修改Merkle树哈希值，成本低且效率高。
参阅图2进行说明：
如图2所示，数据划分为F1数据块、F2数据块和F3数据块，然后对F1数据块、F2数据块和F3数据块进行哈希处理，得到对应的第一哈希值，第一哈希值的字符长度根据实际需要设置，可以是64个字符或128个字符。根据第一哈希值构成图2中包括A、B、C、D和E节点的 文件索引树。其中，将F2数据块对应的第一哈希值映射至E节点，将F3数据块对应的第一哈希值映射至D节点，将F1数据块对应的第一哈希值映射至B节点。D节点的第一哈希值和E节点的第一哈希值合并成一个字符串，然后运算这个字符串，生成第二哈希值，映射至D节点和E节点的父节点C。此时，C节点的第二哈希值和B节点的第一哈希值合并成一个字符串，然后运算这个字符串，生成新的第二哈希值，将这个新的第二哈希值映射至B节点和C节点的父节点A。此时,A节点为根节点。至此，文件索引树构造完成，可以将此文件索引树存储DNA存储介质，也可以存储至其他存储介质。在需要从DNA存储介质中读取数据时，再按照文件索引树的指引来快速获取。通过将数据块对应转换为哈希值，基于哈希值的特性，相同内容的数据块有相同哈希值，可去掉重复的数据，节省存储空间。
在计算机中，所有的数据均以二进制的方式存在。在将数据存储于DNA存储介质中时，将二进制数据通过编码，映射成DNA里A、T、G和C碱基序列，按序列顺序形成长链DNA进行保存。如，“00”对应A，“01”对应G，“10”对应C，“11”对应T，则二进制“00111001”可映射为“A、T、C和G”的序列。相应的目标数据划分为多个数据块后采用上述的DNA存储方式存储于DNA存储介质中。
在一些实施例中，可以有多用户对数据进行操作，则在步骤11之前对用户进行身份认证以及权限认证，若身份认证以及权限认证成功，则允许用户对目标数据进行操作。通过这种方式实现用户身份管理。
步骤12：将增量信息进行存储，并建立与多个数据块中对应数据块的关联关系。
在一些实施例中，将增量信息也采用DNA存储方式存储于DNA存储介质中，增量信息在DNA存储介质中的位置与目标数据的位置不同，不会对目标数据进行更新操作。
在一些实施例中，也可以将增量信息进行分块处理，划分为多个数据块，然后进行标记且相互关联并建立与多个数据块中对应数据块的关联关系，然后采用上述的DNA存储方式存储于DNA存储介质中。
在一应用场景中，将原始数据进行分块，以得到多个数据块，对每个数据块进行标记，然后采用DNA存储方式将多个数据块存储于DNA存储介质中。在对目标数据块操作时，先根据标记从DNA存储介质中读取出来，然后解码为二进制文件，然后基于该二进制文件进行操作，操作完成后的文件则为增量信息。将此文件进行分块处理，并将分块后的文件采用DNA存储方式将多个数据块存储于DNA存储介质中。分块后的文件在DNA存储介质中的位置与原始数据的位置不同，不会对原始数据进行更新操作。
本实施例通过获取对应目标数据的增量信息；其中，目标数据划分为多个数据块并采用DNA存储方式存储于DNA存储介质中，增量信息基于对目标数据的操作产生；将增量信息进行存储，并建立与多个数据块中对应数据块的关联关系。通过上述方式，利用增量信息与数据块建立关联关系，避免增量信息直接对DNA存储介质中的数据进行更新，无需破坏DNA存储介质中原始数据的完整性，进而减少DNA存储介质中数据更新所需要的编码以及解码的存储操作，能够提高DNA存储介质中数据更新效率，减少存储成本。
参阅图3，图3是本申请提供的数据的存储方法另一实施例的流程示意图。该方法包括：
步骤31：获取当前时刻产生的至少一个增量信息。
在一些实施例中，可以有多用户对数据进行操作，则在步骤31之前对用户进行身份认证以及权限认证，若身份认证以及权限认证成功，则允许用户对目标数据进行操作。通过这种方式实现用户身份管理。
在本实例中，对原始数据进行操作的用户为多个，则存在同一时刻多个用户同时对数据进行操作的情况，则同一时刻会产生至少一个增量信息。
因原始数据被划分为多个数据块，则当前时刻产生的至少一个增量信息可以是对应不同数据块的，也可以是不同用户对同一数据块的操作。
若当前时刻为第一次对原始数据进行操作，则在步骤31执行后， 执行步骤32，若当前时刻不是第一次对原始数据进行操作，则在步骤31执行后，执行步骤33。
步骤32：将当前时刻产生的至少一个增量信息添加至有向无环图，并建立与多个数据块中对应数据块的关联关系。
在一些实施例中，以图4对步骤32进行说明：
原始数据F被划分为F1数据块、F2数据块、F3数据块、F4数据块和F5数据块，第一用户在当前时刻对F1数据块进行操作产生了第一增量信息，第二用户在当前时刻对F4数据块进行操作产生了第二增量信息。在对原始数据F进行操作前，有向无环图中只有原始数据F的多个数据块，在第一增量信息和第二增量信息产生后，则有向无环图中增加了第一增量信息和第二增量信息，且第一增量信息指向F1数据块，与F1数据块建立关联关系，且第二增量信息指向F4数据块，与F4数据块建立关联关系。
在一些实施例中，以图5对步骤32进行说明：
原始数据F被划分为F1数据块、F2数据块、F3数据块、F4数据块和F5数据块，第一用户在当前时刻对F3数据块进行操作产生了第一增量信息，第二用户在当前时刻对F3数据块进行操作产生了第二增量信息。在对原始数据F进行操作前，有向无环图中只有原始数据F的多个数据块，在第一增量信息和第二增量信息产生后，则有向无环图中增加了第一增量信息和第二增量信息，且第一增量信息指向F3数据块，与F3数据块建立关联关系，第二增量信息也指向F3数据块，与F3数据块建立关联关系。
步骤33：将当前时刻产生的至少一个增量信息添加至有向无环图，并建立与有向无环图中历史添加的增量信息的关联关系。
在一些实施例中，以图6对步骤33进行说明：
原始数据F被划分为F1数据块、F2数据块、F3数据块、F4数据块和F5数据块，第一用户在前一时刻对F1数据块进行操作产生了第一增量信息，第二用户在前一时刻对F4数据块进行操作产生了第二增量信息。在对原始数据F进行操作前，有向无环图中只有原始数据F的多 个数据块，在第一增量信息和第二增量信息产生后，则有向无环图中增加了第一增量信息和第二增量信息，且第一增量信息指向F1数据块，与F1数据块建立关联关系，且第二增量信息指向F4数据块，与F4数据块建立关联关系。第一用户在当前时刻对F1数据块进行操作产生了第三增量信息，第二用户在当前时刻对F5数据块进行操作产生了第四增量信息。在第三增量信息和第四增量信息产生后，则有向无环图中增加了第三增量信息和第四增量信息，且第三增量信息指向第一增量信息，与第一增量信息建立关联关系，且第四增量信息指向F5数据块，与F5数据块建立关联关系。
在一应用场景中，对原始数据进行操作的用户为一个，则每一操作时刻只产生一个增量信息。若当前时刻为第一次对原始数据进行操作，则将当前时刻产生的增量信息添加至有向无环图，并建立与所操作的数据块的关联关系。若当前时刻不是第一次对原始数据中的目标数据块进行操作，则将当前时刻产生的增量信息添加至有向无环图，并建立与有向无环图中对应该目标数据块的历史添加的增量信息的关联关系。
在一些实施例中，将当前时刻产生的至少一个增量信息组成集合，并采用DNA存储方式存储于DNA存储介质中，通过这种方式，可以记录同一时刻产生的增量信息，便于归类存储于DNA存储介质中。
在重组数据时，按照有向无环图中的关联关系，将属于同一用户的目标数据块对应的所有增量信息进行组合，得到最终数据，则实现了数据更新。
通过上述方式，利用增量信息与数据块建立关联关系，避免增量信息直接对DNA存储介质中的数据进行更新，无需破坏DNA存储介质中原始数据的完整性，进而减少DNA存储介质中数据更新所需要的编码以及解码的存储操作，能够提高DNA存储介质中数据更新效率，减少存储成本。
参阅图7，图7是本申请提供的数据的存储方法另一实施例的流程示意图。该方法包括：
步骤71：获取当前时刻产生的至少一个增量信息以及对应的用户信 息。
在一些实施例中，可以有多用户对数据进行操作，则在步骤71之前对用户进行身份认证以及权限认证，若身份认证以及权限认证成功，则允许用户对目标数据进行操作。通过这种方式实现用户身份管理。
在本实施例中，为区别不同用户对数据的操作，为不同用户设置用户信息。
若当前时刻该用户为第一次对数据进行操作，则在步骤71执行后，执行步骤72，若当前时刻该用户不是第一次对数据进行操作，则在步骤71执行后，执行步骤73。
在其他实施例中，为当前时刻操作产生的增量信息加入版本信息，如，第一次产生的增量信息的版本信息为V1，第二次产生的增量信息的版本信息为V2。因涉及到不同用户，则还需加入用户信息以作区分。如第一用户记为id1，第二用户记为id2，则第一用户在当前时刻操作产生增量信息可记为“xxxV1-id1”，第二用户在当前时刻操作产生增量信息可记为“xxxV1-id2”。
步骤72：将当前时刻产生的至少一个增量信息添加至有向无环图，并建立与多个数据块中对应数据块的关联关系。
在生成对应的增量信息后，则根据不同用户信息，将用户对应的增量信息和数据块进行关联，并将增量信息添加至有向无环图。
步骤73：将当前时刻产生的至少一个增量信息添加至有向无环图，并建立与有向无环图中历史添加的对应用户信息的增量信息的关联关系。
在一些实施例中，获取当前时刻产生的至少一个增量信息以及对应的用户信息，并对当前时刻产生的至少一个增量信息设置第一版本信息；若当前时刻该用户为第一次对数据进行操作，则将当前时刻产生的至少一个增量信息添加至有向无环图，并建立与多个数据块中对应数据块的关联关系，若当前时刻该用户不是第一次对数据进行操作，将当前时刻产生的至少一个增量信息添加至有向无环图，并建立与有向无环图中历史添加的对应用户信息的第二版本信息的增量信息的关联关系，其 中，第二版本信息的增量信息为前一时刻添加至有向无环图的。可以理解，同一用户对同一数据块在不同时刻的操作产生的增量信息可以按照顺序进行版本信息的设置。
在本实施例中，通过将所有数据操作记录为增量信息，再将增量信息进行存储。增量信息的存储不需要读取原始数据的DNA序列进行解码加入数据再编码操作，而是直接记录增量包括时间、用户、版本等信息，通过指针连接构成有向无环图结构，需要读取文件时，进行文件重组。相比于传统技术节省了大量时间以及成本，能够提高DNA存储介质中数据更新效率，减少存储成本。
参阅图8，图8是本申请提供的电子设备一实施例的结构示意图。该电子设备80包括处理器81以及与处理器81耦接的存储器82；其中，存储器82用于存储程序数据，处理器81用于执行程序数据，以实现以下的方法：
获取对应目标数据的增量信息；其中，目标数据划分为多个数据块并采用DNA存储方式存储于DNA存储介质中，增量信息基于对目标数据的操作产生；将增量信息进行存储，并建立与多个数据块中对应数据块的关联关系。
可以理解地，本实施例中的处理器81用于执行程序数据，还可以实现上述实施例的任一方法，这里不再赘述。
参阅图9，图9是本申请提供的计算机可读存储介质一实施例的结构示意图，计算机存储介质90用于存储程序数据91，程序数据91在被处理器执行时，用于实现以下的方法：
获取对应目标数据的增量信息；其中，目标数据划分为多个数据块并采用DNA存储方式存储于DNA存储介质中，增量信息基于对目标数据的操作产生；将增量信息进行存储，并建立与多个数据块中对应数据块的关联关系。
可以理解地，本实施例中的计算机存储介质90还可以实现上述实施例的任一方法，这里不再赘述。
在本申请所提供的几个实施方式中，应该理解到，所揭露的方法以 及设备，可以通过其它的方式实现。例如，以上所描述的设备实施方式仅仅是示意性的，例如，所述模块或单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施方式方案的目的。
另外，在本申请各个实施方式中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现，也可以采用软件功能单元的形式实现。
上述其他实施方式中的集成的单元如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。基于这样的理解，本申请的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的全部或部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)或处理器(processor)执行本申请各个实施方式所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器(ROM，Read-Only Memory)、随机存取存储器(RAM，Random Access Memory)、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述仅为本申请的实施方式，并非因此限制本申请的专利范围，凡是利用本申请说明书及附图内容所作的等效结构或等效流程变换，或直接或间接运用在其他相关的技术领域，均同理包括在本申请的专利保护范围内。

Claims (10)

  1. 一种数据的存储方法，其特征在于，所述方法包括：
    获取对应目标数据的增量信息；其中，所述目标数据划分为多个数据块并采用DNA存储方式存储于DNA存储介质中，所述增量信息基于对所述目标数据的操作产生；
    将所述增量信息进行存储，并建立与所述多个数据块中对应数据块的关联关系。
  2. 根据权利要求1所述的方法，其特征在于，
    所述获取对应目标数据的增量信息，包括：
    获取当前时刻产生的至少一个增量信息；
    所述将所述增量信息进行存储，并建立与所述多个数据块中对应数据块的关联关系，包括：
    将所述当前时刻产生的至少一个增量信息添加至有向无环图，并建立与所述多个数据块中对应数据块、或所述有向无环图中历史添加的增量信息的关联关系；其中，所述历史添加的增量信息与所述多个数据块中对应数据块存在关联关系。
  3. 根据权利要求2所述的方法，其特征在于，
    所述获取当前时刻产生的至少一个增量信息，包括：
    获取当前时刻产生的至少一个增量信息以及对应的用户信息；
    所述将所述当前时刻产生的至少一个增量信息添加至有向无环图，并建立与所述多个数据块中对应数据块、或所述有向无环图中历史添加的增量信息的关联关系，包括：
    将所述当前时刻产生的至少一个增量信息添加至有向无环图，并建立与所述多个数据块中对应数据块、或所述有向无环图中历史添加的对应所述用户信息的增量信息的关联关系。
  4. 根据权利要求3所述的方法，其特征在于，
    所述获取当前时刻产生的至少一个增量信息以及对应的用户信息，包括：
    获取当前时刻产生的至少一个增量信息以及对应的用户信息，并对所述当前时刻产生的至少一个增量信息设置第一版本信息；
    所述将所述当前时刻产生的至少一个增量信息添加至有向无环图，并建立与所述多个数据块中对应数据块、或所述有向无环图中历史添加的对应所述用户信息的增量信息的关联关系，包括：
    将所述当前时刻产生的至少一个增量信息添加至有向无环图，并建立与所述多个数据块中对应数据块、或所述有向无环图中历史添加的对应所述用户信息的第二版本信息的增量信息的关联关系，其中，所述第二版本信息的增量信息为前一时刻添加至所述有向无环图的。
  5. 根据权利要求2所述的方法，其特征在于，
    所述将所述增量信息进行存储，并建立与所述多个数据块中对应数据块的关联关系，还包括：
    将所述当前时刻产生的至少一个增量信息组成集合，并采用DNA存储方式存储于所述DNA存储介质中。
  6. 根据权利要求1所述的方法，其特征在于，
    所述目标数据划分为多个数据块并采用DNA存储方式存储于DNA存储介质中，包括：
    对每个所述数据块进行哈希处理，以得到每个所述数据块对应的第一哈希值；
    将每个所述数据块对应的第一哈希值映射至文件索引树的子节点，以形成所述文件索引树。
  7. 根据权利要求6所述的方法，其特征在于，
    所述将每个所述数据块对应的第一哈希值映射至文件索引树的子节点，以形成所述文件索引树，包括：
    将每两个子节点的第一哈希值合并成字符串；
    对所述字符串进行哈希处理，得到所述字符串对应的第二哈希值；
    将所述第二哈希值作为所述每两个子节点的父节点的哈希值。
  8. 根据权利要求1所述的方法，其特征在于，
    所述获取对应目标数据的增量信息之前，包括：
    对用户进行身份认证以及权限认证，若所述身份认证以及所述权限认证成功，则允许所述用户对所述目标数据进行操作。
  9. 一种电子设备，其特征在于，所述电子设备包括处理器以及与所述处理器耦接的存储器；
    其中，所述存储器用于存储程序数据，所述处理器用于执行所述程序数据，以实现如权利要求1-8任一项所述的方法。
  10. 一种计算机可读存储介质，其特征在于，所述计算机存储介质用于存储程序数据，所述程序数据在被处理器执行时，用于实现如权利要求1-8任一项所述的方法。
PCT/CN2020/125937 2020-11-02 2020-11-02 数据的存储方法、电子设备以及计算机可读存储介质 WO2022088184A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2020/125937 WO2022088184A1 (zh) 2020-11-02 2020-11-02 数据的存储方法、电子设备以及计算机可读存储介质

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2020/125937 WO2022088184A1 (zh) 2020-11-02 2020-11-02 数据的存储方法、电子设备以及计算机可读存储介质

Publications (1)

Publication Number Publication Date
WO2022088184A1 true WO2022088184A1 (zh) 2022-05-05

Family

ID=81381638

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/125937 WO2022088184A1 (zh) 2020-11-02 2020-11-02 数据的存储方法、电子设备以及计算机可读存储介质

Country Status (1)

Country Link
WO (1) WO2022088184A1 (zh)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20190325040A1 (en) * 2018-04-24 2019-10-24 EMC IP Holding Company LLC DNA-Based Data Center With Deduplication Capability
CN110618974A (zh) * 2019-09-06 2019-12-27 苏州浪潮智能科技有限公司 一种数据存储方法、装置、设备及存储介质
CN111091876A (zh) * 2019-12-16 2020-05-01 中国科学院深圳先进技术研究院 一种dna存储方法、系统及电子设备
CN111209444A (zh) * 2020-01-06 2020-05-29 电子科技大学 一种基于时间序列多版本图拓扑数据的存储方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20190325040A1 (en) * 2018-04-24 2019-10-24 EMC IP Holding Company LLC DNA-Based Data Center With Deduplication Capability
CN110618974A (zh) * 2019-09-06 2019-12-27 苏州浪潮智能科技有限公司 一种数据存储方法、装置、设备及存储介质
CN111091876A (zh) * 2019-12-16 2020-05-01 中国科学院深圳先进技术研究院 一种dna存储方法、系统及电子设备
CN111209444A (zh) * 2020-01-06 2020-05-29 电子科技大学 一种基于时间序列多版本图拓扑数据的存储方法

Similar Documents

Publication Publication Date Title
CN109254733B (zh) 用于存储数据的方法、装置和系统
US10778246B2 (en) Managing compression and storage of genomic data
US20240004838A1 (en) Quality score compression for improving downstream genotyping accuracy
US11106633B2 (en) DNA-based data center with deduplication capability
CN111177302B (zh) 业务单据处理方法、装置、计算机设备和存储介质
CN112433986B (zh) 数据的存储方法、电子设备以及计算机可读存储介质
Nadiya et al. Block summarization and compression in bitcoin blockchain
CN112527736B (zh) 基于dna的数据存储方法、数据恢复方法及终端设备
US11070231B2 (en) Reducing storage of blockchain metadata via dictionary-style compression
Al-Okaily et al. Toward a better compression for DNA sequences using Huffman encoding
Holley et al. Dynamic alignment-free and reference-free read compression
CN113901006A (zh) 大规模基因测序数据存储与查询系统
Qu et al. Clover: tree structure-based efficient DNA clustering for DNA-based data storage
CN101063970B (zh) 一种基于音频特征码识别技术的音频文件管理方法和系统
WO2022088184A1 (zh) 数据的存储方法、电子设备以及计算机可读存储介质
CN110532284B (zh) 海量数据存储和检索方法、装置、计算机设备及存储介质
CN114065269B (zh) 无绑定型非同质化代币的生成方法和解析方法和存储介质
US20220236886A1 (en) Securely archiving digital data in dna storage as blocks in a blockchain
WO2022120626A1 (zh) 基于dna的数据存储方法、数据恢复方法、装置及终端设备
US20220237470A1 (en) Storing digital data in dna storage using blockchain and destination-side deduplication using smart contracts
US20220199202A1 (en) Method and apparatus for compressing fastq data through character frequency-based sequence reordering
CN113779025A (zh) 一种区块链中分类数据检索效率的优化方法、系统及应用
Siwach et al. Encrypted Search & Cluster Formation in Big Data
WO2021056167A1 (zh) 信息编码和解码方法、装置、存储介质以及信息存储和解读方法
CN114357064A (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: 20959344

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20959344

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 20959344

Country of ref document: EP

Kind code of ref document: A1