CN114090691A - Block link point data storage and reading method and storage system - Google Patents

Block link point data storage and reading method and storage system Download PDF

Info

Publication number
CN114090691A
CN114090691A CN202111418272.XA CN202111418272A CN114090691A CN 114090691 A CN114090691 A CN 114090691A CN 202111418272 A CN202111418272 A CN 202111418272A CN 114090691 A CN114090691 A CN 114090691A
Authority
CN
China
Prior art keywords
storage server
service data
data
service
server
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
CN202111418272.XA
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.)
Chengdu Quality Starker Technology Co Ltd
Original Assignee
Chengdu Quality Starker Technology 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 Chengdu Quality Starker Technology Co Ltd filed Critical Chengdu Quality Starker Technology Co Ltd
Priority to CN202111418272.XA priority Critical patent/CN114090691A/en
Publication of CN114090691A publication Critical patent/CN114090691A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/21Design, administration or maintenance of databases
    • G06F16/214Database migration support
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/21Design, administration or maintenance of databases
    • G06F16/215Improving data quality; Data cleansing, e.g. de-duplication, removing invalid entries or correcting typographical errors
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/25Integrating or interfacing systems involving database management systems

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computing Systems (AREA)
  • Software Systems (AREA)
  • Quality & Reliability (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention relates to the technical field of block chains, in particular to a block chain link point data storage and reading method and a storage system, wherein the storage method comprises the following steps: the node server receives the archiving operation data; the node server generates a filing instruction according to the filing operation data and sends the filing instruction to the primary storage server; the primary storage server marks the filing instruction as a state to be executed; the secondary storage server monitors the archiving instruction of the state to be executed in the primary storage server; the secondary storage server sequentially executes data migration operation and data clearing operation according to the archiving instruction of the state to be executed; the data archiving method and the data archiving device have the advantages that the service data on the secondary storage server is subjected to the data archiving, the service data which is subjected to the service aging in the secondary storage server is cleared, the internal memory of the secondary storage server is further simplified, the data reading operation of the secondary storage server responding to the node server is improved, and the running efficiency of the block chain node server is improved.

Description

Block link point data storage and reading method and storage system
Technical Field
The invention relates to the technical field of block chains, in particular to a block chain link point data storage and reading method and a storage system.
Background
With the continuous development of services, hundreds of millions of transaction and T-level data are accumulated on a chain, a node server gradually cannot meet the storage requirement of transaction data, the expansion of the node storage space is only carried out, so that the development cost and the hardware cost are high, systematic risks are easily caused due to high technical requirements in the data expansion process, and the problem cannot be solved once and for all. On the other hand, a large amount of transaction cold data not only wastes space, but also affects the performance of block link click-out and transaction execution.
Disclosure of Invention
The invention aims to provide a block link point data storage method, a block link point data reading method, a block link point data storage device, a block link point data reading device and a readable storage medium, so as to improve the problems.
In order to achieve the above object, the embodiments of the present application provide the following technical solutions:
in one aspect, an embodiment of the present application provides a block link point data storage method, where the method is applied to any node in a block link network, where the node includes a node server, a primary storage server, a secondary storage server, and a tertiary storage server, and the method includes:
the node server receives archiving operation data, wherein the archiving operation data comprise a service identity identifier, and the archiving operation data are used for triggering the node to execute service data archiving operation;
the node server generates a filing instruction according to the filing operation data and sends the filing instruction to the primary storage server;
the primary storage server marks the archiving instruction as a to-be-executed state, and the to-be-executed state of the archiving instruction is used for triggering the secondary storage server to execute archiving operation;
the secondary storage server monitors a filing instruction of a to-be-executed state in the primary storage server, wherein the to-be-executed filing instruction comprises a service identity;
and the secondary storage server sequentially executes data migration operation and data clearing operation according to the archiving instruction in the state to be executed, wherein the data migration operation is that the secondary storage server archives all the business data corresponding to the business identity into a tertiary storage server, and the data clearing operation is that the secondary storage server clears all the business data corresponding to the business identity in a local database cluster.
In a second aspect, an embodiment of the present application provides a method for reading block link point data, where the method is applied to any node in a block chain network, where the node includes a node server and a primary storage server, and the method includes:
a primary storage server acquires a first service data reading request sent by the node server, wherein the service data reading request comprises a first service identity and first data generation time;
and the primary storage server judges whether the first service data is stored in the primary storage server according to the first data generation time, and if the first service data is stored in the primary storage server, the corresponding first service data is sent to the node server according to the service data reading request.
Optionally, after the primary storage server obtains the first service data reading request sent by the node server, the method further includes:
the primary storage server judges whether first service data are stored in the primary storage server according to the first data generation time, if the first service data are not stored in the primary storage server, the first service data reading request is marked to be in an immediate execution state, a second service data reading instruction is obtained, and the second service data reading instruction is sent to the secondary storage server;
and the secondary storage server calls second service data corresponding to the second service data reading instruction according to the second service data reading instruction and sends the second service data to the primary storage server.
Optionally, the second storage server calls second service data corresponding to the second service data reading instruction according to the second service data reading instruction, and sends the second service data to the first storage server, including:
calling the second service data reading instruction, wherein the second service data reading instruction comprises a first service identity and first data generation time;
and judging whether the second service data is archived according to the first service identity, if not, calling the second service data in a local memory according to the first data generation time, sending the second service data to the primary storage server, and triggering the primary storage server to send the second service data to the node server.
Optionally, the second storage server calls second service data corresponding to the second service data reading instruction according to the second service data reading instruction, and sends the second service data to the first storage server, including:
calling the second service data reading instruction, wherein the second service data reading instruction comprises a first service identity and first data generation time;
judging whether the second service data is archived according to the first service identity, if so, forwarding a second service data reading instruction to a tertiary storage server, wherein the second service data reading instruction is used for triggering the tertiary storage server to call the second service data according to the first service identity and the first data generation time, and sending the second service data to the secondary storage server;
and receiving the second service data sent by the third-level storage server, backing up the second service data, and sending the second service data to the first-level storage server.
In a third aspect, an embodiment of the present application provides a block chain data multi-level storage system, where the system is applied to any node in a block chain network, and the node includes:
the node server is used for processing the service data;
the primary storage server is used for storing first data generated when the node server operates within a first time period and deleting the first data after the first time period;
the secondary storage server is used for monitoring second data generated when the primary storage server operates in a second time period, sending service data corresponding to a service identity identifier in a filing instruction to the tertiary storage server according to the filing instruction of the primary storage server, and then deleting the service data corresponding to the local service identity identifier;
and the IO interface of the secondary storage server is connected with the IO interface of the tertiary storage server and is used for receiving and archiving the service data corresponding to the service identity identifier sent by the secondary server.
In a fourth aspect, the present application provides a block link dot data storage and reading apparatus, where the apparatus includes data.
In a fifth aspect, embodiments of the present application provide a block link dot data storage and reading apparatus, which includes a memory and a processor. The memory is used for storing a computer program; the processor is used for realizing the steps of the block link point data storage and reading method when executing the computer program.
In a sixth aspect, the present application provides a readable storage medium, where a computer program is stored, and when the computer program is executed by a processor, the steps of the above block link point data storing and reading method are implemented.
The invention has the beneficial effects that:
the invention stores the service data with different timeliness by utilizing the multi-level storage system, stores the instantaneity data generated in a short period on the primary storage server with high-speed read-write performance, deletes the instantaneity data after the validity period (the first time period) is over, and simultaneously backs up the instantaneity data on the primary storage server by utilizing the secondary server, thereby effectively solving the problem of insufficient space of the primary storage server caused by data growth;
secondly, the invention carries out data filing on the service data on the secondary storage server, thereby clearing the service data which is subjected to service aging in the secondary storage server, further simplifying the memory of the secondary storage server, improving the data reading operation of the secondary storage server responding to the node server, and improving the efficiency of the block chain node server and the operation.
Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by the practice of the embodiments of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present invention and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained according to the drawings without inventive efforts.
FIG. 1 is a flow chart illustrating a block link point data storage method according to an embodiment of the present invention;
FIG. 2 is a schematic structural diagram of a block link point data reading apparatus according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of a block link point data storage system according to an embodiment of the present invention.
Fig. 4 is a schematic structural diagram of a block link point data storage and reading apparatus according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be 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, but not all, embodiments of the present invention. The components of embodiments of the present invention generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present invention, presented in the figures, is not intended to limit the scope of the invention, as claimed, but is merely representative of selected embodiments of the 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.
It should be noted that: like reference numbers or letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined or explained in subsequent figures. Meanwhile, in the description of the present invention, the terms "first", "second", and the like are used only for distinguishing the description, and are not to be construed as indicating or implying relative importance.
Example 1
As shown in fig. 1, the present embodiment provides a method for storing block link point data, which is applicable to any node in a block link network, where the node includes a node server, a primary storage server, a secondary storage server, and a tertiary storage server, and the present embodiment discloses a data archiving storage method, which is used to archive and store a type of service data that has been stale into the tertiary storage server, so as to facilitate later query on the service data, and at the same time, effectively prevent stale service data from hindering the primary storage server and the secondary storage server that occupy high cost and operate at a high speed, and the method includes step S1, step S2, step S3, step S4, and step S5.
The method comprises the following steps that S1, a node server receives filing operation data, wherein the filing operation data comprise service identity marks, the filing operation data are used for triggering the node to execute service data filing operation, and the service identity marks are used for enabling a secondary storage server to identify corresponding service data in a local storage hard disk;
s2, the node server generates a filing instruction according to the filing operation data and sends the filing instruction to the primary storage server;
step S3, the primary storage server marks the filing instruction as a to-be-executed state, the to-be-executed state of the filing instruction is used for triggering the secondary storage server to execute the filing operation, it should be noted that the primary storage server does not execute the filing instruction, the filing instruction can only be executed by the secondary storage server, and the marking of the filing instruction as the to-be-executed state is used for triggering the secondary storage server to identify the instruction and preventing the secondary storage server from storing the filing instruction as general data without executing the instruction;
s4, the secondary storage server monitors a filing instruction of a to-be-executed state in the primary storage server, wherein the to-be-executed filing instruction comprises a service identity;
and S5, the secondary storage server sequentially executes data migration operation and data clearing operation according to the archiving instruction of the state to be executed, wherein the data migration operation is that the secondary storage server archives all the service data corresponding to the service identity into a tertiary storage server, and the data clearing operation is that the secondary storage server clears all the service data corresponding to the service identity in the local database cluster.
Example 2
As shown in fig. 2, the present embodiment provides a method for reading chunk link point data, which is applied to any node in a chunk link network, where the node includes a node server and a primary storage server, and includes steps S6 and S711:
s6, a primary storage server acquires a first service data reading request sent by the node server, wherein the service data reading request comprises a first service identity and first data generation time;
step 711, the primary storage server determines whether first service data is stored in the primary storage server according to the first data generation time, and if the first service data is stored in the primary storage server, sends the corresponding first service data to the node server according to the service data reading request.
The implementation discloses a scheduling method when business data are stored in a primary storage server, which judges whether the business data exist in the primary storage server by detecting the time of generating first business data.
Example 3
Based on embodiment 2, this embodiment provides a method for reading service data when the absolute difference between the generation time of the service data to be read and the current time is greater than the first time period, that is, the service data to be read is no longer in the first service storage server, where the method includes steps S721 and S722:
step S721, the primary storage server judges whether the first service data is stored in the primary storage server according to the first data generation time, that is, the absolute difference between the generation time of the service data to be read and the current time is greater than the first time period, and then judges that the service data to be read is not stored in the primary storage server, if the first service data is not stored in the primary storage server, the first service data reading request is marked as an immediate execution state, so as to obtain a second service data reading instruction, and the second service data reading instruction is sent to the secondary storage server;
step s722, the secondary storage server calls second service data corresponding to the second service data reading instruction according to the second service data reading instruction, and sends the second service data to the primary storage server.
In step S722, the specific operation of the secondary storage server calling the second service data corresponding to the second service data reading instruction according to the second service data reading instruction and sending the second service data to the primary storage server may be:
step S7221, calling a second service data reading instruction, wherein the second service data reading instruction comprises a first service identity and first data generation time;
step S7222, determining whether the second service data is archived according to the first service identity, if the second service data is not archived, calling the second service data in a local memory according to the first data generation time, and sending the second service data to the primary storage server, where the second service data is used to trigger the primary storage server to send the second service data to the node server.
Example 4
Based on embodiment 2, this embodiment provides a method for reading service data when the absolute difference between the generation time of the service data to be read and the current time is greater than the first time period, that is, the service data to be read is no longer in the first service storage server, and the service data to be read is also archived data, the method includes step S731, step S732, and step S733:
step S731, calling the second service data reading instruction, wherein the second service data reading instruction comprises a first service identity and first data generation time;
step S732, according to the first service identity, determining whether the second service data is archived, if so, forwarding a second service data reading instruction to a tertiary storage server, where the second service data reading instruction is used to trigger the tertiary storage server to call the second service data according to the first service identity and the first data generation time, and sending the second service data to the secondary storage server;
and S733, receiving the second service data sent by the third-level storage server, backing up the second service data, and sending the second service data to the first-level storage server.
Example 5
As shown in fig. 3, the present embodiment provides a blockchain data multilevel storage system, which is applicable to any node in a blockchain network, where the node includes:
the node server is used for processing the service data;
the primary storage server is used for storing first data generated when the node server operates within a first time period and deleting the first data after the first time period;
the secondary storage server is used for monitoring second data generated when the primary storage server operates in a second time period, sending service data corresponding to a service identity identifier in a filing instruction to the tertiary storage server according to the filing instruction of the primary storage server, and then deleting the service data corresponding to the local service identity identifier;
and the IO interface of the secondary storage server is connected with the IO interface of the tertiary storage server and is used for receiving and archiving the service data corresponding to the service identity identifier sent by the secondary server.
Example 6
Corresponding to the above method embodiments, the embodiments of the present disclosure further provide a block link point data storage and reading device, and a block link point data storage and reading device described below and a block link point data storage and reading method described above may be referred to in correspondence with each other.
Fig. 4 is a block diagram illustrating a block-link dot data storage and reading apparatus 800 according to an exemplary embodiment. As shown in fig. 3, the electronic device 800 may include: a processor 801, a memory 802. The electronic device 800 may also include one or more of a multimedia component 803, an input/output (I/O) interface 804, and a communications component 805.
The processor 801 is configured to control the overall operation of the electronic apparatus 800, so as to complete all or part of the steps in the above-mentioned block link data storage and reading method. The memory 402 is used to store various types of data to support operation at the electronic device 800, such as instructions for any application or method operating on the electronic device 800 and application-related data, such as contact data, transmitted and received messages, pictures, audio, video, and so forth. The Memory 802 may be implemented by any type of volatile or non-volatile Memory device or combination thereof, such as Static Random Access Memory (SRAM), Electrically Erasable Programmable Read-Only Memory (EEPROM), Erasable Programmable Read-Only Memory (EPROM), Programmable Read-Only Memory (PROM), Read-Only Memory (ROM), magnetic Memory, flash Memory, magnetic disk or optical disk. The multimedia components 803 may include screen and audio components. Wherein the screen may be, for example, a touch screen and the audio component is used for outputting and/or inputting audio signals. For example, the audio component may include a microphone for receiving external audio signals. The received audio signal may further be stored in the memory 802 or transmitted through the communication component 805. The audio assembly also includes at least one speaker for outputting audio signals. The I/O interface 804 provides an interface between the processor 801 and other interface modules, such as a keyboard, mouse, buttons, etc. These buttons may be virtual buttons or physical buttons. The communication component 805 is used for wired or wireless communication between the electronic device 800 and other devices. Wireless communication, such as Wi-Fi, bluetooth, Near Field Communication (NFC), 2G, 3G, or 4G, or a combination of one or more of them, so that the corresponding communication component 805 may include: Wi-Fi module, bluetooth module, NFC module.
In an exemplary embodiment, the electronic Device 800 may be implemented by one or more Application Specific Integrated Circuits (ASICs), Digital Signal Processors (DSPs), Digital Signal Processing Devices (DSPDs), Programmable Logic Devices (PLDs), Field Programmable Gate Arrays (FPGAs), controllers, microcontrollers, microprocessors or other electronic components, and is used for executing the above block link data storage and reading methods.
In another exemplary embodiment, a computer readable storage medium comprising program instructions which, when executed by a processor, implement the steps of the above-described block link data storage and reading method is also provided. For example, the computer readable storage medium may be the memory 802 comprising program instructions executable by the processor 801 of the electronic device 800 to perform the block link data storage and reading method.
Example 4
Corresponding to the above method embodiments, the embodiments of the present disclosure further provide a readable storage medium, and a readable storage medium described below and a block link point data storage and reading method described above may be referred to in correspondence with each other.
A readable storage medium, on which a computer program is stored, the computer program, when executed by a processor, implementing the steps of the block link point data storage and reading method of the above method embodiments.
The readable storage medium may be a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and various other readable storage media capable of storing program codes.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (6)

1. A block chain link data storage method is characterized in that the method is suitable for any node in a block chain network, the node comprises a node server, a primary storage server, a secondary storage server and a tertiary storage server, and the method comprises the following steps:
the node server receives archiving operation data, wherein the archiving operation data comprise a service identity identifier, and the archiving operation data are used for triggering the node to execute service data archiving operation;
the node server generates a filing instruction according to the filing operation data and sends the filing instruction to the primary storage server;
the primary storage server marks the archiving instruction as a to-be-executed state, and the to-be-executed state of the archiving instruction is used for triggering the secondary storage server to execute archiving operation;
the secondary storage server monitors a filing instruction of a to-be-executed state in the primary storage server, wherein the to-be-executed filing instruction comprises a service identity;
and the secondary storage server sequentially executes data migration operation and data clearing operation according to the archiving instruction in the state to be executed, wherein the data migration operation is that the secondary storage server archives all the business data corresponding to the business identity into a tertiary storage server, and the data clearing operation is that the secondary storage server clears all the business data corresponding to the business identity in a local database cluster.
2. A block link data reading method according to claim 1, wherein the method is applied to any node in a block chain network, the node including a node server and a primary storage server, and comprises:
a primary storage server acquires a first service data reading request sent by the node server, wherein the service data reading request comprises a first service identity and first data generation time;
and the primary storage server judges whether the first service data is stored in the primary storage server according to the first data generation time, and if the first service data is stored in the primary storage server, the corresponding first service data is sent to the node server according to the service data reading request.
3. The method for reading block link point data according to claim 2, wherein after the primary storage server obtains the first service data reading request sent by the node server, the method further comprises:
the primary storage server judges whether first service data are stored in the primary storage server according to the first data generation time, if the first service data are not stored in the primary storage server, the first service data reading request is marked to be in an immediate execution state, a second service data reading instruction is obtained, and the second service data reading instruction is sent to the secondary storage server;
and the secondary storage server calls second service data corresponding to the second service data reading instruction according to the second service data reading instruction and sends the second service data to the primary storage server.
4. The block link data reading method according to claim 3, wherein the secondary storage server retrieves the second service data corresponding to the second service data reading instruction according to the second service data reading instruction and sends the second service data to the primary storage server, including:
calling the second service data reading instruction, wherein the second service data reading instruction comprises a first service identity and first data generation time;
and judging whether the second service data is archived according to the first service identity, if not, calling the second service data in a local memory according to the first data generation time, sending the second service data to the primary storage server, and triggering the primary storage server to send the second service data to the node server.
5. The block link data reading method according to claim 3, wherein the secondary storage server retrieves the second service data corresponding to the second service data reading instruction according to the second service data reading instruction and sends the second service data to the primary storage server, including:
calling the second service data reading instruction, wherein the second service data reading instruction comprises a first service identity and first data generation time;
judging whether the second service data is archived according to the first service identity, if so, forwarding a second service data reading instruction to a tertiary storage server, wherein the second service data reading instruction is used for triggering the tertiary storage server to call the second service data according to the first service identity and the first data generation time, and sending the second service data to the secondary storage server;
and receiving the second service data sent by the third-level storage server, backing up the second service data, and sending the second service data to the first-level storage server.
6. A blockchain data multi-level storage system, the system being adapted to any node in a blockchain network, the node comprising:
the node server is used for processing the service data;
the primary storage server is used for storing first data generated when the node server operates within a first time period and deleting the first data after the first time period;
the secondary storage server is used for monitoring second data generated when the primary storage server operates in a second time period, sending service data corresponding to a service identity identifier in a filing instruction to the tertiary storage server according to the filing instruction of the primary storage server, and then deleting the service data corresponding to the local service identity identifier;
and the IO interface of the secondary storage server is connected with the IO interface of the tertiary storage server and is used for receiving and archiving the service data corresponding to the service identity identifier sent by the secondary server.
CN202111418272.XA 2021-11-26 2021-11-26 Block link point data storage and reading method and storage system Pending CN114090691A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111418272.XA CN114090691A (en) 2021-11-26 2021-11-26 Block link point data storage and reading method and storage system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111418272.XA CN114090691A (en) 2021-11-26 2021-11-26 Block link point data storage and reading method and storage system

Publications (1)

Publication Number Publication Date
CN114090691A true CN114090691A (en) 2022-02-25

Family

ID=80304710

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111418272.XA Pending CN114090691A (en) 2021-11-26 2021-11-26 Block link point data storage and reading method and storage system

Country Status (1)

Country Link
CN (1) CN114090691A (en)

Similar Documents

Publication Publication Date Title
CN112507027B (en) Kafka-based incremental data synchronization method, device, equipment and medium
CN108874558B (en) Message subscription method of distributed transaction, electronic device and readable storage medium
CN110532322B (en) Operation and maintenance interaction method, system, computer readable storage medium and equipment
CN109600375A (en) Message tracing method, device, electronic equipment and storage medium
CN112214519B (en) Data query method, device, equipment and readable medium
CN113254445B (en) Real-time data storage method, device, computer equipment and storage medium
CN111240940B (en) Real-time service monitoring method and device, electronic equipment and storage medium
CN112184169A (en) Dynamic planning method, device, equipment and storage medium for user backlogs
CN112217684A (en) API gateway monitoring method, device and system
CN108241616B (en) Message pushing method and device
CN111488117B (en) Method, electronic device, and computer-readable medium for managing metadata
CN109600250B (en) Service system fault notification method, device, electronic device and storage medium
CN114090691A (en) Block link point data storage and reading method and storage system
CN113986840A (en) Block chain data multilevel storage and reading method and storage system
CN115826980A (en) Data processing method, data processing device, storage medium and electronic equipment
CN111080250B (en) Flow backspacing compensation method and device, storage medium and electronic equipment
CN109542609B (en) Deduction-based repayment method and device, computer equipment and storage medium
CN114827157A (en) Cluster task processing method, device and system, electronic equipment and readable medium
CN110515978B (en) State database transaction signature verification implementation method
US9240968B1 (en) Autogenerated email summarization process
CN113852686B (en) Block chain network communication method, device, equipment and readable storage medium
CN114900531B (en) Data synchronization method, device and system
CN117453665B (en) Data processing method, device, equipment and storage medium
CN114281525A (en) Transaction task asynchronous deletion method, device, equipment and readable storage medium
CN115827050A (en) Data calling method and device, electronic equipment and storage medium

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