CN114579611B

CN114579611B - Data parallel query method and device of cross-link system

Info

Publication number: CN114579611B
Application number: CN202210478504.9A
Authority: CN
Inventors: 李斌; 孙福辉; 成雨蓉; 王晓燕; 张志威; 张艺璐; 袁野; 张娴; 王国仁
Original assignee: People's Court Information Technology Service Center; Beijing Institute of Technology BIT
Current assignee: People's Court Information Technology Service Center; Beijing Institute of Technology BIT
Priority date: 2022-05-05
Filing date: 2022-05-05
Publication date: 2022-07-05
Anticipated expiration: 2042-05-05
Also published as: CN114579611A

Abstract

The invention relates to the field of block chain data query, and provides a data parallel query method and a device of a cross-chain system, wherein the method comprises the following steps: analyzing a total query request sent by each source block chain to obtain an isomorphic total query request; splitting the query content in each isomorphic total query request into sub-query requests; modifying a query request management table and a query queue table according to the isomorphic total query request and the sub-query requests; converting the sub-query request type identifier and the sub-query request in the query queue list into a target block chain identification format and then sending the target block chain identification format to the target block chain; receiving a query result sent by a target block chain, and modifying a chain query request management table and a query queue table according to the query result; and according to the query request management table, summarizing and format converting the query results of which the sub-query request states corresponding to the isomorphic total query request are successful in query, and then sending the query results to the related source block chain. The method can realize efficient parallel processing of cross-chain block chain query, and guarantee consistency and safety.

Description

Data parallel query method and device of cross-link system

Technical Field

The present disclosure relates to the field of block chain data query, and in particular, to a method and an apparatus for parallel query of data in a cross-chain system.

Background

With the development of computer technology, blockchain (blockchain) technology is applied in the judicial field. The people's court, people's inspection institute, administrative organ of justice (abbreviated as law department) all build own application chain. The block chain technology is a technical scheme which does not depend on a third party and carries out storage, verification, transmission and communication of network data through self distributed nodes. Blockchain technology is a shared, non-tamperproof ledger that facilitates transaction logging and asset tracking procedures in a business network. A blockchain is a data recording system that stores a large number of data records in a distributed environment with a fully ordered relationship. Both data and operations on data are stored within blocks and managed at the granularity of the blocks.

In the prior art, there is a need for information interaction between multiple block chains, for example, a legal block chain, and currently, a mainstream cross-chain technology includes: notary mechanism, side chain mechanism, hash locking technique, distributed private key control technique. The notary mechanism performs cross-chain message validation and delivery by introducing trusted third parties, electing one or more organizations as notaries to automatically or on-demand monitor events on different blockchains as asset redemption and transfer occurs in different blockchains. The side chain mechanism is a cross-chain technology which can automatically check transaction data and has expandability, the side chain is relative to the main chain, the main chain does not know the existence of the side chain, but the side chain knows the existence of the main chain, and when more transactions need to be processed on the main chain or bottlenecks occur in performance, the transactions on the main chain can be transferred to the side chain for processing, so that the pressure of the main chain is relieved. The Hash locking technology is a cross-chain technical scheme for completing asset exchange between block chains through a Hash lock and a time lock under the condition of not needing a credible notary, but the Hash locking technology does not realize cross-chain transfer of assets and only realizes cross-chain exchange. The distributed private key control technology is characterized in that a distributed node is adopted to control private keys of various assets in a block chain, the use right and the use right of digital assets are separated, the control right of the assets on the chain can be safely transferred to a non-centralized system, meanwhile, the assets on an original chain are mapped to a cross chain, and asset circulation and value transfer among different block chains are achieved.

In order to improve the cross-chain query efficiency between different block chains, the following solutions appear in the prior art:

(1) the system comprises an EtherQL system and a block chain management system, wherein the EtherQL system is used for copying block chain data into an external database and managing the data by means of the function of the external database so as to improve the query efficiency of the block chain. The EtherQL system synchronizes the data of the block chain to an external database, so that the data in the block chain cannot be tampered, and the security guarantee cannot be met. According to the technology, data is required to be queried through an external database, query time is increased, and query flow is limited by a query interface between a block chain and the external database, so that query efficiency is low. For a cross-link query system with large query flow, the technology cannot effectively perform query, and system congestion is easily caused.

(2) The cloud computing query processing method based on the MapReduce framework realizes data connection and query through a standard re-partition algorithm. This kind of mode need be with data storage in high in the clouds, and some cross chain systems, in order to guarantee the ann of data all to store data in the intranet, store the security that can't guarantee data in high in the clouds. When the standard re-partition algorithm calculates the vector product for a certain connection key value, the data of the relevant table is all put into the memory for caching. When the number of the link key pairs is small or data inclination occurs, the data volume corresponding to a certain link key value is large, memory overflow and uneven distribution of computing resources are caused, and therefore query efficiency is affected.

(3) And (3) a query mode of the distributed database. When historical data of a chain-crossing system is managed by a database system, the old data can be covered by new data, the historical data cannot be permanently reserved, and the data cannot be traced. And for heterogeneous blockchains, the distributed database system cannot efficiently process heterogeneous data.

Disclosure of Invention

The method is used for solving the problems of long query time and low concurrency in cross-chain system query in the prior art.

In order to solve the above technical problem, a first aspect of the present disclosure provides a data parallel query method for a cross-chain system, which is applied to a relay chain that connects a plurality of heterogeneous blockchains, and includes:

analyzing a total query request sent by each source block chain to obtain a homogeneous total query request, wherein the homogeneous total query request comprises a source block chain identifier and query contents;

splitting query contents in each isomorphic total query request into sub-query requests;

modifying a query request management table and a query queue table according to the isomorphic general query request and the sub-query requests, wherein the query request management table records the association relationship between the isomorphic general query request and the sub-query request states, and the query queue table records the association relationship between the sub-query request type identifier and the constant information of the similar sub-query requests;

converting the sub-query request type identifier in the query queue list and the constant information of the sub-query request into a target block chain identification format, and then sending the target block chain to the target block chain so that the target block chain can judge whether a cache query path exists according to the sub-query request type identifier, and if so, querying data according to the cache query path and the constant information of the sub-query request;

receiving a query result sent by a target block chain, and modifying the query request management table and the query queue table according to the query result;

and according to the query request management table, summarizing and format converting the query results of which the sub-query request states corresponding to the isomorphic main query request are successful in query, and then sending the query results to the source block chain of the isomorphic main query request.

As a further embodiment herein, splitting each homogeneous total query request into sub-query requests comprises:

matching an isomorphic total query request from a preset dictionary, wherein the preset dictionary stores the isomorphic total query request and split sub-query requests thereof;

if the matching is successful, taking the sub-query request associated with the inquired isomorphic total query request as a splitting result;

and if the matching fails, splitting the isomorphic total query request according to a preset splitting rule.

As a further embodiment herein, if the matching fails, the isomorphic total query request and the split sub-query requests are recorded in a dictionary preparation queue; counting the times of entering the dictionary preparation queue by each type of isomorphic total query request and the split sub-query requests in a first preset time period;

and if the statistical times are more than the preset times, storing the isomorphic total query request and the split sub-query requests in a preset dictionary.

As a further embodiment herein, modifying the query request management table and the query queue table according to the isomorphic total query request and the sub-query requests comprises:

recording each isomorphic main query request and state, and sub query requests and states of the isomorphic main query request in a query request management table;

replacing the constant in the sub-query request by a predetermined amount, and calculating a hash value of the replaced request;

and recording the hash value as a sub-query request type identifier in a query queue list, and recording constant information in the sub-query request with the same hash value in the query queue list.

As a further embodiment herein, the data parallel query method of the cross-chain system further includes:

monitoring the time length of the isomorphic total query request and the sub-query requests thereof in the query incomplete state in the query request management table;

if the time length of a certain sub-query request exceeds a preset time threshold, setting the state of the isomorphic total query request corresponding to the sub-query request as query failure, and deleting the sub-query requests related to the sub-query request in the query queue list;

and if the time length of a certain isomorphic total query request exceeds the preset time threshold, setting the state of the isomorphic total query request as query failure, and deleting the sub-query requests related to the isomorphic total query request in the query queue list.

A second aspect of the present disclosure provides a data parallel query method for a cross-chain system, applied to a block chain, including:

sending a total query request to a relay chain;

receiving a sub-query request type identifier and constant information of a sub-query request sent by the relay chain;

and judging whether a cache query path exists according to the sub-query request type identifier, if so, performing query processing according to the cached query path and constant information in the sub-query request, if not, acquiring the query path according to the sub-query request, performing query processing according to the query path and the constant information in the sub-query request, caching the sub-query request type identifier and the corresponding query path, and sending a query result to the relay chain.

In a further embodiment herein, the method for data parallel query of a cross-chain system further includes:

counting the sub-query request quantity of each sub-query request type in a second preset time period;

and if the quantity of the sub-query requests is larger than the preset quantity, caching the data corresponding to the types of the sub-query requests into the memory.

A third aspect of the present disclosure provides a data parallel query apparatus for a cross-chain system, where the apparatus is applied to a relay chain, where the relay chain connects multiple heterogeneous blockchains, and the apparatus includes:

the system comprises an analysis unit, a query unit and a query unit, wherein the analysis unit is used for analyzing a total query request sent by each source block chain to obtain a homogeneous total query request, and the homogeneous total query request comprises a source block chain identifier and query contents;

the splitting unit is used for splitting the query content in each isomorphic total query request into sub-query requests;

the table management unit is used for modifying a query request management table and a query queue table according to the isomorphic total query request and the sub query requests, wherein the query request management table records the association relationship between the isomorphic total query request and the states of the sub query requests, and the query queue table records the association relationship between the type identification of the sub query requests and the constant information of the similar sub query requests;

the sending unit is used for converting the sub-query request type identifier in the query queue list and the constant information of the sub-query request into a target block chain identification format and then sending the target block chain to the target block chain so as to enable the target block chain to judge whether a cache query path exists according to the sub-query request type identifier, and if the cache query path exists, data is queried according to the cache query path and the constant information of the sub-query request;

the query result management unit is used for receiving a query result sent by a target block chain and modifying the query request management table and the query queue table according to the query result;

and the query result feedback unit is used for summarizing and format converting the query results of which the sub-query request states corresponding to the isomorphic total query request are successful in query according to the query request management table and then sending the query results to the related source block chain.

A fourth aspect of the present disclosure provides a data parallel query apparatus for a cross-chain system, applied to a block chain, including:

a request sending unit, configured to send a total query request to the relay link;

the request receiving unit is used for receiving the sub-query request type identifier sent by the relay chain and the constant information of the sub-query request;

and the query management unit is used for judging whether a cache query path exists according to the sub-query request type identifier, if so, performing query processing according to the cached query path and the constant information in the sub-query request, if not, acquiring the query path according to the sub-query request, performing query processing according to the query path and the constant information in the sub-query request, caching the sub-query request type identifier and the corresponding query path, and sending a query result to the relay chain.

A fifth aspect of the present disclosure provides a computer device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor implements the data parallel query method of the cross-chain system according to any of the foregoing embodiments when executing the computer program.

The data parallel query method and device of the cross-link system provided by the invention comprises the steps of setting a relay link among heterogeneous block chains, receiving a total query request sent by each block chain by the relay link, analyzing the total query request sent by each source block chain to obtain an isomorphic total query request, splitting the isomorphic total query request into a plurality of sub query requests, modifying a query request management table and a query queue table according to the isomorphic total query request and the sub query requests, recording the association relationship between the isomorphic total query request and the sub query request state in the query request management table, recording the association relationship between the sub query request type identifier and the constant information of the sub query request in the query queue table, distributing query information (the sub query request type identifier and the constant information of the sub query request) which can be identified by a target block chain according to the query request management table, the query results of which the query status is successful are collected and format-converted from the sub-query requests corresponding to the isomorphic total query request, and then the query results are sent to the related source area block chain, so that efficient parallel processing of cross-chain block chain query can be realized, and the consistency and safety requirements of cross-chain query can be ensured while the cross-chain query efficiency and the concurrency are improved.

The execution states of the total query request and the sub-query requests can be effectively managed by adopting a query request management table mode, and the query requests can be effectively executed. And the results obtained by each sub-query request can be effectively combined according to the query request management table to obtain the total result in the correct sequence.

In order to make the aforementioned and other objects, features and advantages of the present invention comprehensible, preferred embodiments accompanied with figures are described in detail below.

Drawings

In order to more clearly illustrate the embodiments or technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without creative efforts.

FIG. 1 is a block diagram illustrating an architecture of a forensic company cross-chain query system according to an embodiment herein;

fig. 2 shows a flowchart of a data parallel query method applied to a cross-chain system of a relay chain in the embodiments herein;

FIG. 3 illustrates a flow diagram of a homogeneous sub-query request splitting process according to an embodiment herein;

FIG. 4 is a flow chart illustrating a dictionary update process according to an embodiment herein;

FIG. 5 is a flow diagram illustrating a process for modifying a query request management table and a query queue table according to an embodiment herein;

FIG. 6 is a flowchart illustrating a data parallel query method applied to a block chain cross-chain system according to an embodiment of the present disclosure;

fig. 7 is a block diagram illustrating a data parallel query apparatus of a cross-link system applied to a relay link according to an embodiment of the present disclosure;

FIG. 8 is a block diagram illustrating a data parallel query apparatus of a cross-chain system applied to a blockchain according to an embodiment of the present disclosure;

fig. 9 shows a node structure diagram of the relay chain and the block chain in the embodiment of the present disclosure.

Description of the symbols of the drawings:

701. an analysis unit;

702. a splitting unit;

703. a table management unit;

704. a transmitting unit;

705. a query result management unit;

706. a query result feedback unit;

801. a request transmitting unit;

802. a request receiving unit;

803. a query management unit;

902. a computer device;

904. a processor;

906. a memory;

908. a drive mechanism;

910. an input/output module;

912. an input device;

914. an output device;

916. a presentation device;

918. a graphical user interface;

920. a network interface;

922. a communication link;

924. a communication bus.

Detailed Description

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 only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments herein without making any creative effort, shall fall within the scope of protection.

It should be noted that the terms "first," "second," and the like in the description and claims herein and in the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments herein described are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, apparatus, article, or device that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or device.

The present specification provides method steps as described in the examples or flowcharts, but may include more or fewer steps based on routine or non-inventive labor. The order of steps recited in the embodiments is merely one manner of performing the steps in a multitude of orders and does not represent the only order of execution. In the actual implementation of the system or the device product, the method according to the embodiments or shown in the drawings can be executed in sequence or in parallel.

It should be noted that the data parallel query method and apparatus of the cross-chain system can be used for cross-chain query of a forensic department block chain, and the forensic department block chain can query a forensic department block chain for the attorney's law enforcement qualifications and credit information at the same time from the forensic department block chain and the forensic department block chain. The method and the device for the parallel query of the data of the cross-chain system can also be used in any field except division detection, and the application field of the method and the device for the parallel query of the data of the cross-chain system is not limited.

It should be noted that the query data (including but not limited to user device information, user personal information, etc.) referred to herein are all information and data authorized by the user or sufficiently authorized by each party.

Taking the query data of the heterogeneous block chain of the cheque as an example, as shown in fig. 1, the structure of the cheque cross-chain query system is shown in fig. 1, and the cheque cross-chain query system has a three-layer structure. From bottom to top, the first layer is that each legal inspection department stores and manages non-uplink data through a downlink database; the second layer is a heterogeneous block chain of each house of the legal inspection department, which is used for storing and managing uplink data and can inquire and manage the data of a down-link database of each house; the third layer is a relay chain, and since the block chains of each department of the legal medical expert are heterogeneous block chains, data interaction cannot be directly performed, and cross-chain transactions and data transmission need to be performed by taking the relay chain as a middler. In the forensic department cross-link system, a relay chain continuously monitors cross-link query requests from a courtyard block chain, a survey courtyard block chain and a judicial administration block chain, sends the cross-link query requests to a destination block chain, and forwards a query result on the destination block chain to a source block chain.

Since the blockchains of each house of the French enterprise are heterogeneous blockchains, cross-chain query requests from other structural blockchains cannot be identified and processed. Therefore, after receiving the cross-link query request from the forensic blockchain, the relay chain converts the cross-link query request into a uniform format specified by the relay chain.

As shown in fig. 2, the data parallel query method applied to the cross-link system of the relay link includes:

step 201, analyzing a total query request sent by each source block chain to obtain a homogeneous total query request, where the homogeneous total query request includes a source block chain identifier and query content.

In this step, the formats of the corresponding isomorphic total query requests of each source block chain are the same, and the specific format may be set by a relay chain developer, and the specific format is not limited herein.

Step 202, splitting the query content in each isomorphic total query request into sub-query requests.

When the step is implemented, the query content in the total query request can be split into the sub-query requests according to the preset rule, and the preset rule can be set according to the requirement, which is not limited herein. For example, the total query request a is "lawyer qualification and credit information for query X", the total query request B is "lawyer qualification and credit information for query Y", the total query request a may be split into sub-query requests a1- "lawyer qualification for query X" and a2- "credit information for query X", and the total query request B is split into sub-query requests B1- "qualification for execution for query Y" and B2- "credit information for query Y".

Step 203, modifying the query request management table and the query queue table according to the isomorphic general query request and the sub-query requests, wherein the query request management table records the association relationship between the isomorphic general query request and the sub-query request state, and the query queue table records the association relationship between the sub-query request type identifier and the constant information of the similar sub-query request.

In this step, the query request management table and the query queue table may be constructed and managed according to a preset query request management contract. The inquiry request management contract specifies the specific construction and modification modes of the inquiry request management table and the inquiry queue table.

Step 204, converting the sub-query request type identifier and the sub-query request in the query queue list into a target block chain identification format, and then sending the target block chain to the target block chain, so that the target block chain judges whether a cache query path exists according to the sub-query request type identifier, and if so, querying data according to the cache query path and the constant information of the sub-query request in a cross-chain query request manner.

When the step is implemented, the relay chain can determine the target block chain according to the storage content type and the query content of each block chain. In specific implementation, the isomorphic total query request further includes a destination blockchain identifier.

And step 205, receiving the query result sent by the destination block chain, and modifying the query request management table and the query queue table according to the query result.

The method updates the constant information of the sub-query requests in the query queue list by updating the states of the isomorphic total query requests and the sub-query requests in the query request management table in time, and can ensure the consistency and the effectiveness of cross-chain query.

Specifically, if a certain sub-query request returns a query result, the state of the sub-query request in the query request management table is updated to be successful in query, and meanwhile, the constant information of the sub-query request in the query queue table is deleted. If a certain sub-query request does not return a query result, updating the state of the sub-query request in the query request management table to be query failure, and if the states of all sub-query requests corresponding to the isomorphic total query request are query success, modifying the state of the isomorphic total query request in the query request management table to be query success.

And step 206, summarizing and format-converting the query results of which the sub-query request states corresponding to the isomorphic main query request are successful according to the query request management table, and then sending the query results to the related source block chain.

In the embodiment, the total query request sent by each heterogeneous block chain is converted into the uniform homogeneous total query request, the homogeneous total query request is split into the sub-query requests, the query request management table records the association relationship between the homogeneous total query request and the sub-query request state, and the query pair list records the association relationship between the sub-query request type identifier and the sub-query request, so that efficient parallel processing of cross-chain block chain query can be realized, and the consistency and the safety requirements of cross-chain query are ensured.

In a further embodiment herein, as shown in fig. 3, for a homogeneous total query request, the homogeneous total query request is split into homogeneous sub-query requests according to the following process:

step 301, matching isomorphic total query requests from a preset dictionary, wherein the preset dictionary stores isomorphic query requests of various types and split sub-query requests thereof. If the matching is successful, step 302 is executed, and if the matching is failed, step 303 is executed.

In detail, the preset dictionary is shown in table 1, the preset dictionary may be set manually or obtained by analyzing a historical total query request, and the determination method of the preset dictionary is not limited herein.

TABLE 1

Step 302, taking the sub-query request associated with the queried isomorphic total query request as a split result. For example, the total query request Y in the predetermined format in Table 1, the corresponding split result is Y₁And y₂。

And 303, splitting the isomorphic total query request according to a preset splitting rule. In detail, the predetermined splitting rule may use an existing word segmentation algorithm, which is not limited herein.

According to the embodiment, the splitting efficiency and the correctness of the total query request in the preset format can be improved through the preset dictionary, and the efficiency and the precision of data query are further improved.

In this embodiment, as shown in fig. 4, when the matching in step 301 fails, the following dictionary updating step is further performed:

step 401, recording the isomorphic total query request and the split sub-query requests in a dictionary preparation queue;

step 402, counting the times of entering a dictionary preparation queue by each type of isomorphic total query request and the split sub-query requests in a first preset time period; and if the statistical times are more than the preset times, storing the isomorphic total query request and the split sub-query requests in a preset dictionary. The first predetermined time period may be set according to a requirement, and specific values thereof are not limited herein.

The embodiment can realize self-updating of the dictionary, and adapt to the change of the total query request caused by the change of the storage content of the block chain.

In an embodiment of the present invention, as shown in fig. 5, the step 203 of modifying the query request management table and the query queue table according to the isomorphic total query request and the sub-query requests includes:

step 501, recording each isomorphic total query request and status, and sub-query requests and status of the total query request in a query request management table.

In detail, the isomorphic total query request status and the sub-query request status include query incomplete (denoted by symbol p), query success (denoted by symbol s) and query failure (denoted by symbol f), and in the initial state, the isomorphic total query request status and the sub-query request status are both p. The query request management table is shown in table 2.

TABLE 2

Step 502, replacing the constant in the sub-query request with a predetermined amount, and calculating a hash value for the replaced request.

In this step, the constant in the query request refers to the specific content of the user query, for example, the lawyer qualifications of zhang san is queried, zhang san is the long constant in the query request, and in this step, zhang san is replaced by a predetermined amount (for example, ") and a hash value is calculated for the replaced information (for example, lawyer qualifications of zhang xi). The hash value calculation process can refer to the prior art, and is not detailed herein.

Step 503, the hash value is recorded in the query queue table as the type identifier of the sub-query request, and the constant information in the sub-query request with the same hash value is recorded in the query queue table.

The constant information in the sub-query request includes a sub-query request ID and a constant value, and the query queue table is shown in table 3.

TABLE 3

When step 503 is implemented, for the hash value calculated by each sub-query request in step 502, it is first determined whether the hash value exists in the query queue table, if so, the constant information of the sub-query request is added to the record of the hash value in the query queue table, and if not, a record is newly added to the query queue table, and the hash value and the constant information of the sub-query request are recorded in the record.

In a further embodiment, when the number of query requests corresponding to a hash value in the query queue table is zero, in order to prevent the query requests corresponding to the hash value from being input in a short time, the state with the number of zero is maintained for a period of time, the whole piece of data (the hash value and the hash value) is deleted from the query queue table, and a deletion hint (containing the hash value) is sent to a corresponding block chain, so that the corresponding block chain deletes corresponding information (the hash value and a cache query path) in the cache according to the hash value in the deletion hint, and the storage space is released.

In an embodiment of this document, the method for parallel query of data in a cross-chain system further includes, in addition to the foregoing steps:

and monitoring the duration of the isomorphic total query request and the sub-query requests thereof in the query incomplete state in the query request management table.

And if the time length of a certain sub-query request exceeds a preset time threshold t, setting the state of the isomorphic total query request corresponding to the sub-query request as query failure, and deleting the sub-query requests related to the sub-query request in the query queue list. And if the duration of a certain sub-query request does not exceed the preset time threshold t and the sub-query request fails to be executed, setting the state of the sub-query request as query failure. And if the time length of a certain sub-query request does not exceed the preset time threshold t and the sub-query request is successfully executed, setting the state of the sub-query request as the query success.

The predetermined time threshold may be determined according to the user's acceptance response, which is not limited herein. And adding the deleted sub-query requests into an offline query list, querying in an offline query mode, and sending the information to the source block chain after the information is queried.

And if the time length of a certain isomorphic total query request exceeds a preset time threshold t, setting the state of the isomorphic total query request as query failure, and deleting the sub-query requests related to the isomorphic total query request in the query queue list. And if the time length of a certain isomorphic total query request does not exceed a preset time threshold t and the states of the sub-query requests passing through the total query request are all query success, setting the state of the passing total query request as the query success.

By monitoring the duration of the total query request and the duration of the sub-query requests in the processing state, when the monitored duration is greater than the preset time threshold, the sub-query requests with abnormal response can be timely found, and the related sub-query requests in the query queue list can be timely deleted, so that the problems that the memory and network resources are wasted and the system is blocked and the query efficiency is further influenced due to the fact that one query request is responded for a long time can be avoided.

The following describes a specific implementation of the query request management table and the query queue table management by taking a legal suspection block chain as an example.

1) And inquiring the management mode of the request management table.

(1) The relay link receives a total query request a from the courtyard block chain, "attorney qualification and credit for query X". The total query request A will be split into sub-query request a1 "attorney qualification on attorney in query X" and sub-query request a2 "Credit information for query X". And the query requests a, a1, a2 are all initialized to a p (query not completed) state, the states of the total query request and the sub query requests are recorded on the query request management table, and a time threshold is set.

(2) The sub-query requests a1, a2 are updated from a p (query not completed) state to an s (query successful) state only if they are successfully executed within a set time threshold. When the execution of the sub-query request fails, or the time in the p (query incomplete) state exceeds a time threshold, the state is updated from the p (query incomplete) state to the f (query failure) state. The relay chain will continuously inquire the execution result of the sub-inquiry request, and when detecting that the sub-inquiry request state is f state, execute step (3). When the sub-query request state is detected as the s state, step 4 is executed.

(3) As long as the state of the sub-query request a1 or a2 is f (query failure), the relay chain updates the state of the total query request A to be f, which indicates that the query fails, and the query is ended.

(4) When the states of both sub-queries a1 and a2 are s, the state of the total query A is updated to be s. When the state of sub-query request a1 (a 2) is s and the state of sub-query request a2 (a 1) is p, the state of total query A does not change and remains p. When the time that the total query request A is in the p state exceeds a time threshold, the state of the total query request A is updated to be f.

(5) The relay link determines the status of the total query request. And when the state of the total query request is f, executing the step 3 and finishing the query. Otherwise, step (6) is executed.

(6) The relay link determines the status of the total query request. When the status of the total query request is queried as s, step 7 is executed. Otherwise, executing step (2) and continuing to update the query request state.

(7) And (4) finishing the inquiry after the inquiry is successful, and collecting the inquired sub-inquiry information into total inquiry information by the relay chain and then sending the total inquiry information to the corresponding court block chain.

2) And inquiring the management mode of the queue table.

(1) The relay link receives a total query request a from the courtyard block chain, "attorney qualification and credit for query X". The total query request A will be split into sub-query request a1 "attorney qualification on attorney in query X" and sub-query request a2 "Credit information for query X". The relay link receives a total query request B from the yard block chain, and the attorney qualification and credit information of query Y. The total query request B will be split into sub-query request B1 "attorney qualification on attorney" and sub-query request B2 "credit for query Y".

(2) The relay chain replaces the constant 'X' of the sub-query request a1 with 'X' to obtain 'lawyer qualification of query', and performs hash calculation on the replaced sub-query request to obtain a hash value h 1. Replacing the constant 'Y' of the sub-query request a1 with 'X' to obtain 'lawyer qualification of query', and performing hash calculation on the replaced sub-query request to obtain a hash value h 2. Here h1= h 2.

(3) The relay chain searches whether the same hash value h exists in the query queue table. And if the same h value is retrieved, adding constant information of the sub-query request in the sub-item of the corresponding item in the query pair list. Otherwise, a new record is added in the query queue list, and the hash value and the constant information of the sub query request are recorded.

Continuing with the example of step (2), the relay chain retrieves hash value h1 in the query queue table. Since the same hash value is not retrieved, a new entry is added to the query queue table, recording hash value h1 and sub-query request a 1. The hash value h2 is then retrieved in the query pair list. Since the same hash value h1 is retrieved, a sub-entry record sub-query request b1 is added to one entry of hash value h 1.

In an embodiment of this document, there is further provided a data parallel query method applied to a cross-chain system of a blockchain, as shown in fig. 6, including:

step 601, sending a total query request to the relay chain. Each block chain is of a heterogeneous structure, so the format of the total query request sent by each block chain is different.

Step 602, receiving the sub-query request type identifier and the constant information of the sub-query request sent by the relay link. The query request type identifier is used to indicate the type of query information, such as a hash value after replacing a variable with a constant for a sub-query request.

Step 603, determining whether a cache query path exists according to the sub-query request type identifier, if so, executing step 604, and if not, executing step 605. The cache records the queried sub-query request type identification and query path.

And step 604, performing query processing according to the cached query path and the constant information in the sub-query request. When the step is implemented, the cached query path is accessed first, and the data corresponding to the constant information is obtained from the cached query path.

Step 605, obtaining the query path according to the sub-query request, performing query processing according to the query path and the constant information in the sub-query request, caching the sub-query request type identifier and the corresponding query path, and sending the query result to the relay chain.

In some embodiments, step 601 and step 602 are performed by a node in the destination block chain capable of interacting with the relay chain, and after receiving the sub-query request type identifier and the sub-query request sent by the relay chain, the node distributes the sub-query request type identifier and the sub-query request sent by the relay chain to different block chain nodes in the block chain according to available resources of each node in the block chain, and the different block chain nodes perform the steps of step 604 and step 605. The method and the device can fully utilize the resources of each node of the block chain, and further improve the efficiency and the parallelism of the query request.

In a further embodiment, in order to further increase the data query speed, the data parallel query method applied to the inter-chain system of the block chain includes, in addition to steps 601 to 605:

step 606, counting the sub-query request amount of each sub-query request type in the second predetermined time period.

The data parallel query method of the cross-chain system provided by the embodiment is used in cooperation with the method shown in fig. 2, so that efficient parallel processing of cross-chain block chain query can be realized, and the consistency and safety requirements of cross-chain query can be ensured while the cross-chain query efficiency and the concurrency are improved.

Based on the same inventive concept, a data parallel query device applied to a cross-chain system of a relay chain is also provided, as described in the following embodiments. Because the principle of solving the problem of the data parallel query device applied to the relay chain cross-link system is similar to that of the data parallel query method applied to the relay chain cross-link system, the implementation of the data parallel query device applied to the relay chain cross-link system can refer to the data parallel query method applied to the relay chain cross-link system, and repeated parts are not described again.

Specifically, as shown in fig. 7, the data parallel query apparatus applied to the relay link cross-link system includes:

an analyzing unit 701, configured to analyze a total query request sent by each source block chain to obtain a homogeneous total query request, where the homogeneous total query request includes a source block chain identifier and query content;

a splitting unit 702, configured to split query contents in each isomorphic total query request into sub-query requests;

a table management unit 703, configured to modify a query request management table and a query queue table according to the isomorphic general query request and the sub query requests, where the query request management table records an association relationship between the isomorphic general query request and a sub query request state, and the query queue table records an association relationship between a sub query request type identifier and constant information of similar sub query requests;

a sending unit 704, configured to convert the sub-query request type identifier in the query queue list and the constant information of the sub-query request into a destination block chain identification format, and send the destination block chain to the destination block chain, so that the destination block chain determines whether a cache query path exists according to the sub-query request type identifier, and if the cache query path exists, queries data according to the cache query path and the constant information of the sub-query request;

a query result management unit 705, configured to receive a query result sent by a destination block chain, and modify the query request management table and the query queue table according to the query result;

and the query result feedback unit 706 is configured to, according to the query request management table, summarize and format-convert query results in which the sub-query request states corresponding to the isomorphic total query request are all query results that are successful, and then send the query results to the related source block chain.

Based on the same inventive concept, a data parallel query apparatus applied to a block chain cross-chain system is also provided herein, as described in the following embodiments. Because the principle of solving the problem of the data parallel query device applied to the block chain cross-chain system is similar to that of the data parallel query method applied to the block chain cross-chain system, the implementation of the data parallel query device applied to the block chain cross-chain system can refer to the data parallel query method applied to the block chain cross-chain system, and repeated parts are not described again.

Specifically, as shown in fig. 8, the data parallel query apparatus applied to the inter-chain system of the block chain includes:

a request sending unit 801, configured to send a total query request to the relay chain;

a request receiving unit 802, configured to receive a sub-query request type identifier and constant information of the sub-query request sent by the relay link;

the query management unit 803 is configured to determine whether a cache query path exists according to the sub-query request type identifier, perform query processing according to the cached query path and the constant information in the sub-query request if the cache query path exists, acquire the query path according to the sub-query request if the cache query path does not exist, perform query processing according to the query path and the constant information in the sub-query request, cache the sub-query request type identifier and the corresponding query path, and send a query result to the relay link.

The parallel data query device of the cross-chain system provided in fig. 7 and 8 can achieve the following technical effects:

(1) the cross-chain total query request is firstly split into the sub-query requests, and then the sub-query requests of the same type are split together for query, so that the query request efficiency and the query request parallelism can be improved.

(2) The query request state is managed by constructing and maintaining a query request management table, so that the consistency of cross-chain query can be ensured.

In an embodiment herein, also provided is a node of a relay chain and a blockchain, which is referred to as a computer device in this embodiment as shown in fig. 9, and the computer device 902 may include one or more processors 904, such as one or more Central Processing Units (CPUs), each of which may implement one or more hardware threads. The computer device 902 may also include any memory 906 for storing any kind of information, such as code, settings, data, etc. For example, and without limitation, memory 906 may include any one or more of the following in combination: any type of RAM, any type of ROM, flash memory devices, hard disks, optical disks, etc. More generally, any memory may use any technology to store information. Further, any memory may provide volatile or non-volatile retention of information. Further, any memory may represent fixed or removable components of computer device 902. In one case, when the processor 904 executes the associated instructions, which are stored in any memory or combination of memories, the computer device 902 can perform any of the operations of the associated instructions. The computer device 902 also includes one or more drive mechanisms 908, such as a hard disk drive mechanism, an optical disk drive mechanism, etc., for interacting with any memory.

Computer device 902 may also include an input/output module 910 (I/O) for receiving various inputs (via input device 912) and for providing various outputs (via output device 914)). One particular output mechanism may include a presentation device 916 and an associated graphical user interface 918 (GUI). In other embodiments, input/output module 910 (I/O), input device 912, and output device 914 may also be excluded, acting as only one computer device in a network. Computer device 902 may also include one or more network interfaces 920 for exchanging data with other devices via one or more communication links 922. One or more communication buses 924 couple the above-described components together.

Communication link 922 may be implemented in any manner, such as over a local area network, a wide area network (e.g., the Internet), a point-to-point connection, etc., or any combination thereof. Communication link 922 may include any combination of hardwired links, wireless links, routers, gateway functions, name servers, etc., governed by any protocol or combination of protocols.

Corresponding to the methods in fig. 2-6, the embodiments herein also provide a computer-readable storage medium having stored thereon a computer program, which, when executed by a processor, performs the steps of the above-described method.

Embodiments herein also provide computer readable instructions, wherein when executed by a processor, a program thereof causes the processor to perform the method as shown in fig. 2-6.

It should be understood that, in various embodiments herein, the sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments herein.

It should also be understood that, in the embodiments herein, the term "and/or" is only one kind of association relation describing an associated object, meaning that three kinds of relations may exist. For example, a and/or B, may represent: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.

Those of ordinary skill in the art will appreciate that the various illustrative components and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the components and steps of the various examples have been described above generally in terms of their functionality in order to clearly illustrate this interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.

It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.

In the several embodiments provided herein, it should be understood that the disclosed system, apparatus, and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may also be an electric, mechanical or other form of connection.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purposes of the embodiments herein.

In addition, functional units in the embodiments herein may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit may be implemented in the form of hardware, or may also be implemented in the form of a software functional unit.

The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the present invention may be implemented in a form of a software product, which is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the methods described in the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.

The principles and embodiments of this document are explained herein using specific examples, which are presented only to aid in understanding the methods and their core concepts; meanwhile, for the general technical personnel in the field, according to the idea of this document, there may be changes in the concrete implementation and the application scope, in summary, this description should not be understood as the limitation of this document.

Claims

1. A data parallel query method of a cross-chain system is applied to a relay chain, wherein the relay chain is connected with a plurality of heterogeneous block chains, and the method comprises the following steps:

and according to the query request management table, summarizing and format converting the query results of which the sub-query request states corresponding to the isomorphic main query request are successful in query, and then sending the query results to the related source block chain.

2. The method of claim 1, wherein splitting each homogeneous total query request into sub-query requests comprises:

querying an isomorphic total query request from a preset dictionary, wherein the preset dictionary stores various types of isomorphic total query requests and split sub-query requests thereof;

3. The method of claim 2, wherein if the matching fails, the isomorphic total query request and the split sub-query requests are further recorded in a dictionary preparation queue;

counting the times of entering the dictionary preparation queue by each type of isomorphic total query request and the split sub-query requests in a first preset time period;

and if the statistical times are more than the preset times, storing the isomorphic total query request and the split sub-query requests in the preset dictionary.

4. The method of claim 1, wherein modifying a query request management table and a query queue table based on the isomorphic total query request and the sub-query requests comprises:

and recording the hash value as a sub-query request type identifier in a query queue list, and recording the sub-query request and constant information of the same hash value in the query queue list.

5. The method of claim 1, further comprising:

6. A data parallel query method of a cross-chain system is applied to a block chain and comprises the following steps:

sending a total query request to a relay chain;

7. The method of claim 6, further comprising:

8. A data parallel query device of a cross-chain system is applied to a relay chain, wherein the relay chain connects a plurality of heterogeneous block chains, and the device comprises:

the table management unit is used for modifying a query request management table and a query queue table according to the isomorphic general query request and the sub-query requests, wherein the query request management table records the association relationship between the isomorphic general query request and the sub-query request states, and the query queue table records the association relationship between the sub-query request type identifier and the constant information of the similar sub-query requests;

9. The data parallel query device of the cross-chain system is applied to a block chain and comprises the following components:

10. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method of any one of claims 1 to 7 when executing the computer program.