CN112732775A - Method and device for processing block node data, computer equipment and storage medium - Google Patents
Method and device for processing block node data, computer equipment and storage medium Download PDFInfo
- Publication number
- CN112732775A CN112732775A CN202011537841.8A CN202011537841A CN112732775A CN 112732775 A CN112732775 A CN 112732775A CN 202011537841 A CN202011537841 A CN 202011537841A CN 112732775 A CN112732775 A CN 112732775A
- Authority
- CN
- China
- Prior art keywords
- data
- target
- block node
- query
- 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
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/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2471—Distributed queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- 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/60—Protecting data
- G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
Abstract
The invention discloses a method and a device for processing block node data, computer equipment and a storage medium. The method comprises the following steps: determining target block nodes for storing target data on each block node in response to a query condition carried in a query request of a user; analyzing the performance of the target block node by adopting a distributed probing route analysis method to obtain a performance analysis result; and according to the performance analysis result and the query condition, performing query processing on the storage data at least comprising the target data uploaded to the distributed cloud storage server to obtain the target data meeting the query condition. Therefore, by adopting the embodiment of the application, the target block nodes stored by the target data can be determined in each block node row according to the query conditions carried in the query request, so that the target data meeting the query request of the user can be rapidly and accurately queried, the processing efficiency of the data stored in the block nodes is effectively improved, and the user experience is improved.
Description
Technical Field
The present invention relates to the field of block storage technologies, and in particular, to a method and an apparatus for processing block node data, a computer device, and a storage medium.
Background
In the current block chain technology, data stored on each block node in a block chain cannot be queried and previewed in advance, the data to be queried needs to be downloaded to the local, and the downloaded data needs to be checked on terminal equipment of a user, so that the data downloaded by the user in a large amount of time is not the data required by the user, precious memory resources are wasted, precious time of the user is also wasted, and user experience is poor.
The technical problem to be solved is how to improve the processing efficiency of the data stored on the block nodes and quickly and accurately query the data required by the user, aiming at the problem that the existing processing method of the data stored on the block nodes is too lagged.
Disclosure of Invention
In view of the above, it is necessary to provide a method and an apparatus for processing block node data, a computer device, and a storage medium, for solving the problem of low processing efficiency of data stored in each block on a block chain.
In a first aspect, an embodiment of the present application provides a method for processing block node data, where the method includes:
determining target block nodes for storing target data on each block node in response to a query condition carried in a query request of a user, wherein the query request is used for querying the target data;
analyzing the performance of the target block nodes by adopting a distributed probing route analysis method to obtain a performance analysis result;
and according to the performance analysis result and the query condition, performing query processing on stored data at least comprising the target data uploaded to a distributed cloud storage server to obtain the target data meeting the query condition, wherein the target data comprises target abstract data meeting the query condition and target full-text data meeting the query condition.
In one embodiment, the query condition includes at least one target keyword and a valid time period of data for querying the target data, and the query processing of the storage data uploaded to the distributed cloud storage server and including at least the target data includes:
screening data matched with at least one target keyword from the stored data as candidate data according to the at least one target keyword;
and screening the data in the valid time period of the data from the candidate data as target data according to the valid time period of the data.
In one embodiment, the screening, from the stored data, data matching at least one target keyword as candidate data according to the at least one target keyword includes:
and screening data matched with at least one target keyword from the summary data of the stored data according to the at least one target keyword and the target summary data to serve as the candidate data.
In one embodiment, the screening, from the stored data, data matching at least one target keyword as candidate data according to the at least one target keyword further includes:
and screening data matched with at least one target keyword from the full-text data of the stored data as the candidate data according to the at least one target keyword and the target full-text data.
In one embodiment, the performance analysis result includes a block hash value of the target block node and a target storage amount in which the target block node stores the target data.
In one embodiment, the method further comprises: and synchronizing the target abstract data, the target full-text data, the block hash value of the target block node and the target storage capacity of the target block node for storing the target data to the target block node.
In one embodiment, after the obtaining of the target data meeting the query condition, the method further includes:
downloading the target abstract data to the terminal equipment of the user, and/or,
and downloading the target full-text data to the terminal equipment of the user.
In a second aspect, an embodiment of the present application provides an apparatus for processing block node data, where the apparatus includes:
a determining unit, configured to determine, in response to a query condition carried in a query request of a user, a target block node where target data is stored on each block node, where the query request is used to query the target data;
a performance analysis unit, configured to analyze the performance of the target block node determined by the determination unit by using a distributed probe routing analysis method to obtain a performance analysis result;
and the processing unit is used for inquiring the stored data which is uploaded to the distributed cloud storage server and at least comprises the target data according to the performance analysis result analyzed by the performance analysis unit and the inquiry condition to obtain the target data which accords with the inquiry condition, wherein the target data comprises target abstract data which accords with the inquiry condition and target full-text data which accords with the inquiry condition.
In a third aspect, embodiments of the present application provide a computer device, including a memory and a processor, where the memory stores computer-readable instructions, and the computer-readable instructions, when executed by the processor, cause the processor to perform the above-mentioned method steps.
In a fourth aspect, embodiments of the present application provide a storage medium storing computer-readable instructions, which, when executed by one or more processors, cause the one or more processors to perform the above-mentioned method steps.
The technical scheme provided by the embodiment of the application can have the following beneficial effects:
in the embodiment of the application, in response to a query condition carried in a query request of a user, determining a target block node for storing target data on each block node; analyzing the performance of the target block node by adopting a distributed probing route analysis method to obtain a performance analysis result; and according to the performance analysis result and the query condition, performing query processing on the storage data at least comprising the target data uploaded to the distributed cloud storage server to obtain the target data meeting the query condition. Therefore, by adopting the embodiment of the application, the target block nodes stored by the target data can be determined in each block node row according to the query conditions carried in the query request, so that the target data meeting the query request of the user can be rapidly and accurately queried, the processing efficiency of the data stored in the block nodes is effectively improved, and the user experience is improved. It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention, as claimed.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and together with the description, serve to explain the principles of the invention.
FIG. 1 is a diagram illustrating an exemplary embodiment of a method for processing node data of a block;
FIG. 2 is a block diagram showing an internal configuration of a computer device according to an embodiment;
fig. 3 is a flowchart illustrating a method for processing block node data according to an embodiment of the disclosure;
fig. 4 is a schematic structural diagram of a block node data processing apparatus according to an embodiment of the present disclosure.
Detailed Description
The following description and the drawings sufficiently illustrate specific embodiments of the invention to enable those skilled in the art to practice them.
It should be understood that the described embodiments are only some embodiments of the invention, and not all embodiments. 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.
Alternative embodiments of the present disclosure are described in detail below with reference to the accompanying drawings.
Fig. 1 is a diagram of an implementation environment of a block node data processing method according to an embodiment, as shown in fig. 1, in the implementation environment, including a computer device 110 and a terminal 120.
It should be noted that the terminal 120 and the computer device 110 may be, but are not limited to, a smart phone, a tablet computer, a notebook computer, a desktop computer, and the like. The computer device 110 and the terminal 110 may be connected through bluetooth, USB (Universal Serial Bus), or other communication connection methods, which is not limited herein.
FIG. 2 is a diagram showing an internal configuration of a computer device according to an embodiment. As shown in fig. 2, the computer device includes a processor, a non-volatile storage medium, a memory, and a network interface connected through a system bus. The non-volatile storage medium of the computer device stores an operating system, a database and computer readable instructions, the database can store control information sequences, and the computer readable instructions, when executed by the processor, can enable the processor to implement a method for processing block node data. The processor of the computer device is used for providing calculation and control capability and supporting the operation of the whole computer device. The memory of the computer device may have computer readable instructions stored therein, which when executed by the processor, may cause the processor to perform a method of processing block node data. The network interface of the computer device is used for connecting and communicating with the terminal. Those skilled in the art will appreciate that the architecture shown in fig. 2 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
As shown in fig. 3, an embodiment of the present disclosure provides a method for processing block node data, where the method for processing block node data is applied to a server side, and specifically includes the following steps:
s302: determining target block nodes for storing target data on each block node in response to a query condition carried in a query request of a user, wherein the query request is used for querying the target data;
in the embodiment of the application, the query conditions matched with the query request of the user can be configured according to the requirements of different users. The query condition includes at least one target keyword for querying the target data and a valid time period of the data. The target data includes not only target summary data conforming to the query condition but also target full-text data conforming to the query condition.
In a possible implementation manner, the method for processing block node data provided in the embodiment of the present disclosure further includes the following steps:
in a blockchain network, discovery of blockchain nodes is performed.
In the embodiment of the present application, the discovery of the block node may be divided into the discovery of the initial block node and the discovery of the block node after the start. The initial block node discovery, i.e., the block node is just downloaded, runs for the first time without any block node data in the block node. The discovery of a block node after startup indicates that the running wallet has been able to dynamically maintain available block nodes following the network.
Specifically, the discovery process of the initial block node is specifically as follows:
in a blockchain network, the discovery of initial blockchain nodes is achieved in two ways:
the first is a DNS seed, also known as a DNS seed block node. DNS is a centralized domain name query service.
The second is some addresses hard-coded in the code, which are called hard-coded seed block nodes. When all DNS seed block nodes fail, the full block node will try to connect to the hard coded seed block node.
The discovery process of the block node after starting is specifically as follows:
in a blockchain network, a blocknode can send a peer blocknode list maintained by itself to adjacent blocknodes, and after an initial blocknode is found, the current blocknode asks the other party for the blocknode list, namely, the blocknode list of the other party is copied. Therefore, every time a protocol message needs to be sent, it takes a fixed time to try to establish a connection with a block node in the stored block node list, and as long as any one block node can be connected before timeout, the address does not need to be acquired through the DNS seed block node.
In practical applications, if the number of all the block nodes is very large, the connection timeout of all the block nodes in the stored list is very unlikely.
S304: analyzing the performance of the target block node by adopting a distributed probing route analysis method to obtain a performance analysis result;
in this embodiment of the present application, the performance analysis result includes a block hash value of the target block node and a target storage amount of the target block node for storing the target data.
In addition to the block hash value of the listed target block node and the target storage amount of the target data stored in the target block node, other parameters may be introduced according to the requirements of different application scenarios, which is not described herein again.
In a possible implementation manner, the method for processing block node data provided in the embodiment of the present disclosure further includes the following steps:
node data stored on each block node of the block chain is analyzed using a distributed probe route analysis method.
In the blockchain network, the above-mentioned blocknode list is obtained, and the blocknode list adopts a mature algorithm in the P2P network protocol, KAD network. The KAD network uses DHTs to locate resources as a distributed hash table. The KAD network maintains a routing table for fast location of target block nodes, wherein the KAD network is based on UDP protocol. In the block chain network, the block node discovery is based on the UDP protocol, and after the block node is found, the data interaction is switched to the TCP protocol.
In the process of analyzing the node data on each block node of the memory block chain by adopting a distributed probing route analysis method, an interaction protocol among each block node is involved.
The interaction protocol process between the block nodes is specifically as follows:
once the connection is established between the block nodes, the interaction between the block nodes follows specific commands, which are written in the header of the message and in the body of the message content.
Commands are divided into two categories: one is a request command and one is a data exchange command.
The first thing to do after the block node connection is complete is a handshake operation. Through the above handshake operation, some brief information is obtained, for example, the version number is exchanged first to see whether it is compatible.
After the handshake is completed, the long connection needs to be maintained. To maintain a heartbeat for a long connection between the block nodes, PING/PONG types of messages are used.
Commands are generally divided into control commands and data transfer commands, for example, the getaddr command is used to obtain the other's list of available block nodes, and the inv command provides data transfer. The message body will contain a data vector.
In order to realize data sharing among the block nodes, block synchronization is adopted. The block synchronization mode is divided into two modes, the first mode is called HeaderFirst, the block head can be synchronized firstly, and the block bodies are obtained from other block nodes after synchronization is completed, so that a better interaction process is provided, and the burden of a block chain network is reduced; the second is called BlockFirst, which requires that blocks obtained from other block nodes are complete.
S306: and according to the performance analysis result and the query condition, performing query processing on the stored data at least comprising the target data uploaded to the distributed cloud storage server to obtain the target data meeting the query condition, wherein the target data comprises target abstract data meeting the query condition and target full-text data meeting the query condition.
In the embodiment of the application, the query condition includes at least one target keyword and an effective time period of data for querying the target data, and the query processing of the storage data at least including the target data uploaded to the distributed cloud storage server includes the following steps:
screening data matched with the at least one target keyword from the stored data as candidate data according to the at least one target keyword;
in one possible implementation manner, the step of screening data matched with at least one target keyword from the stored data as candidate data according to the at least one target keyword comprises the following steps:
and screening data matched with the at least one target keyword from the summary data of the stored data as candidate data according to the at least one target keyword and the target summary data.
In the embodiment of the present application, in order to save resources, when querying target data in stored data, only part of the stored data is often queried, for example, part of the stored data may be a hash value of a chunk, and part of the stored data may also be digest data of the stored data, where the digest data of the stored data may be a summary and a summary of full-text data corresponding to the stored data. Therefore, the user can judge whether the data stored in the current block has the target data required by the user in advance through the preview summary data. If the data stored in the current block comprises target data required by the user according to the abstract data, pushing the address information of the block node to terminal equipment of the user, so that the target block node stored in the target data meeting the user query condition is accurately positioned on the distributed cloud storage server according to the address information of the block node, and querying the target abstract data corresponding to the target data and the target full-text data corresponding to the target data on the target block node.
In the embodiment of the application, in order to improve the security of the query and download of the blockchain data, the user may also be allowed to provide the hash value of the target blockchain node storing the target data, and only when the hash value of the target blockchain node provided by the user is correct, the user is allowed to view or download the target summary data and the target full-text data corresponding to part of the data.
In a possible implementation manner, the step of screening data matched with at least one target keyword from the stored data as candidate data according to the at least one target keyword further comprises the following steps:
and screening data matched with the at least one target keyword from the full-text data of the stored data as candidate data according to the at least one target keyword and the target full-text data.
And screening the data in the valid time period of the data from the candidate data as target data according to the valid time period of the data.
In a possible implementation manner, the method for processing block node data provided in the embodiment of the present disclosure further includes the following steps:
and synchronizing the target abstract data, the target full-text data, the block hash value of the target block node and the target storage capacity of the target block node for storing the target data to the target block node.
In an embodiment of the application, the storage of the blockchain is based on a distributed database, the database being a data carrier of the blockchain.
In a block chain, each block has the hash value of the previous block, which is called the parent of the current block.
The data of the transaction is a single hash value and is stored in the block header. And the data security is improved through the hash value. The same hash value will be generated for the same message. The hash value can help to see if the data has been tampered with.
In the embodiment of the application, if the data is to be checked to see whether the data is tampered, the data can be run through a hash value algorithm, and the hash value of the data is compared with the hash value of the received data. And if the two hash values are the same, the data is not changed. And if the two hash values are not matched, the data is changed before the data is received.
In the embodiment of the present application, after the hash value of the chunk is determined not to be tampered, the hash value may be automatically synchronized to the chunk node.
In one possible implementation, after determining that the block hash value of the target block node is not tampered, the block hash value of the target block node may be automatically synchronized to the target block node.
In addition to automatically synchronizing hash values to the chunk nodes, digest data, or storage data, may also be automatically synchronized to the chunk nodes.
In one possible implementation, in addition to automatically synchronizing the block hash value of the target block node to the target block node, the target digest data, or the target full-text data, may also be automatically synchronized to the target block node.
In a possible implementation manner, the method for processing block node data provided in the embodiment of the present disclosure further includes the following steps:
downloading the target abstract data to terminal equipment of a user; therefore, the processing efficiency of the data stored on the block nodes can be effectively improved, and the target data can be further screened according to the target abstract data by downloading the target abstract data to the terminal equipment of the user, so that the target data can be accurately determined.
In a possible implementation manner, the method for processing block node data provided in the embodiment of the present disclosure further includes the following steps:
downloading target full-text data to terminal equipment of a user; therefore, the target full-text data is directly downloaded to the terminal equipment of the user, so that the user can quickly and accurately obtain the target data which accords with the query conditions of the user, the processing efficiency of the data stored in each block node is improved, and the user experience is finally improved.
In a possible implementation manner, the method for processing block node data provided in the embodiment of the present disclosure further includes the following steps:
downloading the target abstract data to the terminal equipment of the user, and downloading the target full-text data to the terminal equipment of the user; therefore, the user can conveniently review the target data according to the target abstract data, and directly view the target full-text data downloaded to the terminal equipment of the user when the target full-text data needs to be viewed.
In the embodiment of the present application, in order to further improve the security of data stored in the block node, a user having the function of viewing the target full-text data may be further configured to have a first right, and a user having the function of downloading the target full-text data may be further configured to have a second right, where the second right is higher than the first right.
In an actual application scenario, after a plurality of users provide the block hash value of the target block node, it is preliminarily determined that the plurality of users have a first authority to view the target full-text data.
In a possible implementation manner, the method for processing block node data provided in the embodiment of the present disclosure further includes the following steps:
the method comprises the steps of obtaining historical behavior data of a plurality of users, judging that the user sharing target associated data not only has a first permission of viewing the target full-text data but also has a second permission of downloading the target full-text data if the historical behavior data of the plurality of users shows that one of the users also shares the target associated data related to the target full-text data, and uploading the target associated data to a target block node.
In the embodiment of the disclosure, in response to a query condition carried in a query request of a user, determining a target block node of target data storage on each block node; analyzing the performance of the target block node by adopting a distributed probing route analysis method to obtain a performance analysis result; and according to the performance analysis result and the query condition, performing query processing on the storage data at least comprising the target data uploaded to the distributed cloud storage server to obtain the target data meeting the query condition. Therefore, by adopting the embodiment of the application, the target block nodes stored by the target data can be determined in each block node row according to the query conditions carried in the query request, so that the target data meeting the query request of the user can be rapidly and accurately queried, the processing efficiency of the data stored in the block nodes is effectively improved, and the user experience is improved.
The following is an embodiment of a processing apparatus for block node data according to the present invention, which can be used to execute the embodiment of the processing method for block node data according to the present invention. For details that are not disclosed in the embodiments of the apparatus for processing block node data of the present invention, refer to the embodiments of the method for processing block node data of the present invention.
Referring to fig. 4, a schematic structural diagram of a block node data processing apparatus according to an exemplary embodiment of the present invention is shown. The processing means of the block node data may be implemented as all or part of the terminal by software, hardware or a combination of both. The processing means of the block node data comprises a determination unit 402, a performance analysis unit 404 and a processing unit 406.
Specifically, the determining unit 402 is configured to determine, in response to an inquiry condition carried in an inquiry request of a user, a target block node where target data is stored on each block node, where the inquiry request is used to inquire the target data;
a performance analysis unit 404, configured to analyze the performance of the target block node determined by the determination unit 402 by using a distributed probe routing analysis method to obtain a performance analysis result;
the processing unit 406 is configured to perform query processing on the storage data at least including the target data uploaded to the distributed cloud storage server according to the performance analysis result and the query condition analyzed by the performance analysis unit 404, so as to obtain target data meeting the query condition, where the target data includes target abstract data meeting the query condition and target full-text data meeting the query condition.
Optionally, the query condition includes at least one target keyword for querying the target data and a valid time period of the data, and the processing unit 406 is configured to:
screening data matched with the at least one target keyword from the stored data as candidate data according to the at least one target keyword;
and screening the data in the valid time period of the data from the candidate data as target data according to the valid time period of the data.
Optionally, the processing unit 406 is specifically configured to: and screening data matched with the at least one target keyword from the summary data of the stored data as candidate data according to the at least one target keyword and the target summary data.
Optionally, the processing unit 406 is further specifically configured to: and screening data matched with the at least one target keyword from the full-text data of the stored data as candidate data according to the at least one target keyword and the target full-text data.
Optionally, the performance analysis result includes a block hash value of the target block node and a target storage amount of the target block node for storing the target data.
Optionally, the apparatus further comprises:
and a synchronization unit (not shown in fig. 4) for synchronizing the target digest data, the target full-text data, the block hash value of the target block node, and the target storage amount of the target block node for storing the target data onto the target block node.
Optionally, the apparatus further comprises:
a downloading unit (not shown in fig. 4) configured to download the target abstract data to the terminal device of the user or download the target full-text data to the terminal device of the user after the processing unit obtains the target data meeting the query condition;
and the downloading unit (not shown in fig. 4) is further configured to download the target summary data to the terminal device of the user and download the target full-text data to the terminal device of the user after the processing unit obtains the target data meeting the query condition.
It should be noted that, when the processing apparatus for block node data provided in the foregoing embodiment executes the processing method for block node data, the division of each functional module is merely used as an example, and in practical applications, the above function distribution may be completed by different functional modules according to needs, that is, the internal structure of the device may be divided into different functional modules, so as to complete all or part of the above described functions. In addition, the block node data processing apparatus and the block node data processing method provided in the foregoing embodiments belong to the same concept, and details of implementation processes are shown in the block node data processing method embodiments and are not described herein again.
In the embodiment of the present disclosure, the determining unit is configured to determine, in response to a query condition carried in a query request of a user, a target block node of a target data storage on each block node; the performance analysis unit is used for analyzing the performance of the target block node determined by the determination unit by adopting a distributed probing route analysis method to obtain a performance analysis result; and the processing unit is used for inquiring the storage data which is uploaded to the distributed cloud storage server and at least comprises the target data according to the performance analysis result and the inquiry condition analyzed by the performance analysis unit to obtain the target data which accords with the inquiry condition. Therefore, by adopting the embodiment of the application, the target block nodes stored by the target data can be determined in each block node row according to the query conditions carried in the query request, so that the target data meeting the query request of the user can be rapidly and accurately queried, the processing efficiency of the data stored in the block nodes is effectively improved, and the user experience is improved.
In one embodiment, a computer device is proposed, the computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the following steps when executing the computer program: determining target block nodes for storing target data on each block node in response to a query condition carried in a query request of a user, wherein the query request is used for querying the target data; analyzing the performance of the target block node by adopting a distributed probing route analysis method to obtain a performance analysis result; and according to the performance analysis result and the query condition, performing query processing on the stored data at least comprising the target data uploaded to the distributed cloud storage server to obtain the target data meeting the query condition, wherein the target data comprises target abstract data meeting the query condition and target full-text data meeting the query condition.
In one embodiment, a storage medium is provided that stores computer-readable instructions that, when executed by one or more processors, cause the one or more processors to perform the steps of: determining target block nodes for storing target data on each block node in response to a query condition carried in a query request of a user, wherein the query request is used for querying the target data; analyzing the performance of the target block node by adopting a distributed probing route analysis method to obtain a performance analysis result; and according to the performance analysis result and the query condition, performing query processing on the stored data at least comprising the target data uploaded to the distributed cloud storage server to obtain the target data meeting the query condition, wherein the target data comprises target abstract data meeting the query condition and target full-text data meeting the query condition.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a computer-readable storage medium, and can include the processes of the embodiments of the methods described above when the computer program is executed. The storage medium may be a non-volatile storage medium such as a magnetic disk, an optical disk, a Read-Only Memory (ROM), or a Random Access Memory (RAM).
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present invention, and the description thereof is more specific and detailed, but not construed as limiting the scope of the present invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the inventive concept, which falls within the scope of the present invention. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (10)
1. A method for processing block node data, the method comprising:
determining target block nodes for storing target data on each block node in response to a query condition carried in a query request of a user, wherein the query request is used for querying the target data;
analyzing the performance of the target block nodes by adopting a distributed probing route analysis method to obtain a performance analysis result;
and according to the performance analysis result and the query condition, performing query processing on stored data at least comprising the target data uploaded to a distributed cloud storage server to obtain the target data meeting the query condition, wherein the target data comprises target abstract data meeting the query condition and target full-text data meeting the query condition.
2. The method of claim 1, wherein the query condition comprises at least one target keyword and a valid time period of data for querying the target data, and the query processing of the storage data uploaded to the distributed cloud storage server and including at least the target data comprises:
screening data matched with at least one target keyword from the stored data as candidate data according to the at least one target keyword;
and screening the data in the valid time period of the data from the candidate data as target data according to the valid time period of the data.
3. The method of claim 2, wherein the filtering, according to the at least one target keyword, data matching the at least one target keyword from the stored data as candidate data comprises:
and screening data matched with at least one target keyword from the summary data of the stored data according to the at least one target keyword and the target summary data to serve as the candidate data.
4. The method of claim 2, wherein the filtering, according to the at least one target keyword, data matching the at least one target keyword from the stored data as candidate data further comprises:
and screening data matched with at least one target keyword from the full-text data of the stored data as the candidate data according to the at least one target keyword and the target full-text data.
5. The method of claim 1,
the performance analysis result comprises a block hash value of the target block node and a target storage amount of the target block node for storing the target data.
6. The method of claim 5, further comprising:
and synchronizing the target abstract data, the target full-text data, the block hash value of the target block node and the target storage capacity of the target block node for storing the target data to the target block node.
7. The method of claim 1, wherein after the obtaining the target data meeting the query condition, the method further comprises:
downloading the target abstract data to the terminal equipment of the user, and/or,
and downloading the target full-text data to the terminal equipment of the user.
8. An apparatus for processing block node data, the apparatus comprising:
a determining unit, configured to determine, in response to a query condition carried in a query request of a user, a target block node where target data is stored on each block node, where the query request is used to query the target data;
a performance analysis unit, configured to analyze the performance of the target block node determined by the determination unit by using a distributed probe routing analysis method to obtain a performance analysis result;
and the processing unit is used for inquiring the stored data which is uploaded to the distributed cloud storage server and at least comprises the target data according to the performance analysis result analyzed by the performance analysis unit and the inquiry condition to obtain the target data which accords with the inquiry condition, wherein the target data comprises target abstract data which accords with the inquiry condition and target full-text data which accords with the inquiry condition.
9. A computer device comprising a memory and a processor, the memory having stored therein computer-readable instructions which, when executed by the processor, cause the processor to carry out the steps of the processing method of any one of claims 1 to 7.
10. A storage medium having stored thereon computer-readable instructions which, when executed by one or more processors, cause the one or more processors to perform the steps of the processing method of any one of claims 1 to 7.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011537841.8A CN112732775A (en) | 2020-12-23 | 2020-12-23 | Method and device for processing block node data, computer equipment and storage medium |
| PCT/CN2021/126083 WO2022134830A1 (en) | 2020-12-23 | 2021-10-25 | Method and apparatus for processing block node data, computer device, and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011537841.8A CN112732775A (en) | 2020-12-23 | 2020-12-23 | Method and device for processing block node data, computer equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112732775A true CN112732775A (en) | 2021-04-30 |
Family
ID=75604399
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011537841.8A Pending CN112732775A (en) | 2020-12-23 | 2020-12-23 | Method and device for processing block node data, computer equipment and storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN112732775A (en) |
| WO (1) | WO2022134830A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022134830A1 (en) * | 2020-12-23 | 2022-06-30 | 深圳壹账通智能科技有限公司 | Method and apparatus for processing block node data, computer device, and storage medium |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117874060A (en) * | 2024-03-12 | 2024-04-12 | 北京市农林科学院信息技术研究中心 | Supply chain product traceability data multi-condition query method and device based on block chain |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| SG11201908957XA (en) * | 2017-05-15 | 2019-10-30 | Visa Int Service Ass | Techniques for secure blockchain routing |
| US11093558B2 (en) * | 2017-11-14 | 2021-08-17 | International Business Machines Corporation | Providing accountability of blockchain queries |
| CN108664222B (en) * | 2018-05-11 | 2020-05-15 | 北京奇虎科技有限公司 | Block chain system and application method thereof |
| CN109885583A (en) * | 2019-01-17 | 2019-06-14 | 平安城市建设科技(深圳)有限公司 | Data query method, apparatus, equipment and storage medium based on block chain |
| CN112732775A (en) * | 2020-12-23 | 2021-04-30 | 深圳壹账通智能科技有限公司 | Method and device for processing block node data, computer equipment and storage medium |
-
2020
- 2020-12-23 CN CN202011537841.8A patent/CN112732775A/en active Pending
-
2021
- 2021-10-25 WO PCT/CN2021/126083 patent/WO2022134830A1/en active Application Filing
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2022134830A1 (en) * | 2020-12-23 | 2022-06-30 | 深圳壹账通智能科技有限公司 | Method and apparatus for processing block node data, computer device, and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2022134830A1 (en) | 2022-06-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108650182B (en) | Network communication method, system, device, equipment and storage medium | |
| CN110703980B (en) | File transmission method and device | |
| KR20120018178A (en) | Swarm-based synchronization over a network of object stores | |
| CN110059055B (en) | File storage and reading method and device based on distributed private cloud | |
| CN103597471A (en) | Methods and systems for caching data communications over computer networks | |
| US20140143339A1 (en) | Method, apparatus, and system for resource sharing | |
| CN112732775A (en) | Method and device for processing block node data, computer equipment and storage medium | |
| CN111352716B (en) | Task request method, device and system based on big data and storage medium | |
| CN109561054B (en) | Data transmission method, controller and access device | |
| CN111461720B (en) | Identity verification method and device based on blockchain, storage medium and electronic equipment | |
| JP2020510891A (en) | Detection system, method and related device | |
| CN112055048A (en) | P2P network communication method and system for high-throughput distributed account book | |
| EP4221233A1 (en) | Data download method and apparatus, computer device and storage medium | |
| CN111224829B (en) | Method and device for accessing external node to block chain network, and block chain network | |
| CN110909030B (en) | Information processing method and server cluster | |
| CN110619022B (en) | Node detection method, device, equipment and storage medium based on block chain network | |
| CN115023919A (en) | Firewall rule updating method and device, server and storage medium | |
| CN110581784B (en) | Node health check method, device and equipment | |
| CN110602232A (en) | Terminal system version downloading method, device and system based on peer-to-peer network idea | |
| CN109639629B (en) | Data access processing method and device, computer equipment and storage medium | |
| CN113055444B (en) | File sharing method and related device thereof | |
| US20200410126A1 (en) | Database Access Method and Apparatus, Computing Device, and Computer Program Product | |
| CN115004657B (en) | Addressing method, addressing system and addressing device | |
| CN108733805B (en) | File interaction method, system, computer equipment and storage medium | |
| CN110324436B (en) | Proxy method and device for transport layer proxy |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 40049336 Country of ref document: HK |
|
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |