CN112612816A - Service result query method, device, equipment and medium for Ether house alliance chain - Google Patents
Service result query method, device, equipment and medium for Ether house alliance chain Download PDFInfo
- Publication number
- CN112612816A CN112612816A CN202011413141.8A CN202011413141A CN112612816A CN 112612816 A CN112612816 A CN 112612816A CN 202011413141 A CN202011413141 A CN 202011413141A CN 112612816 A CN112612816 A CN 112612816A
- Authority
- CN
- China
- Prior art keywords
- service
- identifier
- client
- result
- chain
- 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.)
- Granted
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/2457—Query processing with adaptation to user needs
-
- 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/2453—Query optimisation
-
- 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/248—Presentation of query results
-
- 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
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The application provides a business result query method, a device, equipment and a medium of an EtherFang alliance chain, and relates to the technical field of block chains. The method comprises the following steps: acquiring a service identifier to be inquired; and if the block identifier corresponding to the service identifier to be queried is less than or equal to the first block identifier of the link point of the Etheng alliance chain, acquiring a service result corresponding to the service identifier to be queried from a local cache of the client, wherein the first block identifier of the link node of the Etheng alliance chain is the maximum block identifier corresponding to the service result of the local cache of the client. In the scheme, the service result corresponding to the service identifier to be inquired is obtained from the local cache of the client according to the service identifier to be inquired, and the inquiry of the service result is converted from the link point of the Ethengfang alliance chain to the local cache of the client, so that the idle inquiry caused when the service result is inquired in the database of the link point is effectively avoided, and the service processing performance is effectively improved.
Description
Technical Field
The present application relates to the field of block chain technologies, and in particular, to a method, an apparatus, a device, and a medium for querying a service result of an ethernet alliance chain.
Background
At present, an alliance chain based on an ethernet frame initiates a transaction to a chain node through a client, and initiates a transaction result query request to the chain node according to a transaction identifier returned by the chain node to obtain a transaction result.
In the prior art, when a client inquires a link node to obtain a transaction result, a transaction result inquiry request is periodically initiated to the link node through a transaction identifier, so as to inquire a transaction list stored in a link node database to obtain the transaction result. When the transaction quantity initiated by the client in the timing time interval is larger than the transaction quantity packaged by the blocks in the chain nodes, because part of the transactions initiated in the transactions are not packaged, the transaction result cannot be obtained according to the transaction identification in the next time interval, and therefore empty query is generated.
In the prior art, due to the generation of the null query, when the data amount in the link point database is continuously increased, the time consumption of the null query is large, the execution speed of the transaction is slower and slower, and the transaction processing performance is reduced.
Disclosure of Invention
An object of the present application is to provide a method, an apparatus, a device, and a medium for querying a service result of an ethernet alliance chain, so as to solve the problems of low service processing efficiency and low service processing performance caused by null query in the prior art.
In order to achieve the above purpose, the technical solutions adopted in the embodiments of the present application are as follows:
in a first aspect, an embodiment of the present application provides a method for querying a service result of an ethernet alliance chain, including:
acquiring a service identifier to be inquired;
and if the block identifier corresponding to the service identifier to be queried is smaller than or equal to the first block identifier of the link point of the Ether Fang alliance chain, acquiring the service result corresponding to the service identifier to be queried from a local cache of the client, wherein the first block identifier of the link node of the Ether Fang alliance chain is the maximum block identifier corresponding to the service result locally cached by the client.
Optionally, the method further comprises:
if the block identifier corresponding to the service identifier to be inquired is larger than the first block identifier of the link point of the Etheng alliance chain, storing the service result in the link point database of the Etheng alliance chain to a local cache of the client according to the second block identifier of the link node of the Etheng alliance chain, wherein the second block identifier of the link node of the Etheng alliance chain is the maximum block identifier of the current link point;
and acquiring a service result corresponding to the service identifier to be inquired from a local cache of the client according to the service identifier to be inquired.
Optionally, the storing, according to the second block identifier of the chain node of the ethernet workshop alliance chain, the service result in the chain node database of the ethernet workshop alliance chain to the local cache of the client includes:
acquiring a service result list corresponding to a plurality of blocks between a first block identifier of a chain node and a second block identifier of the chain node from a chain link point database of the EtherFang alliance chain according to the first block identifier of the chain link point of the EtherFang alliance chain and the second block identifier of the chain node of the EtherFang alliance chain;
and traversing the service result list, acquiring a service result and storing the service result to a local cache of the client.
Optionally, the traversing the service result list, obtaining a service result, and storing the service result in a local cache of the client includes:
traversing the service result list to obtain the mapping relation between the plurality of groups of service identifications and the service results recorded in the service result list;
and storing the mapping relation between the service identifications and the service results in a plurality of groups to a local cache of the client.
Optionally, the obtaining, according to the service identifier to be queried, a service result corresponding to the service identifier to be queried from a local cache of the client includes:
and acquiring a service result corresponding to the service identifier to be inquired from a local cache of the client according to the service identifier to be inquired and the mapping relation between the service identifier and the service result.
Optionally, the mapping relationship between the service identifier and the service result is represented by a key value pair;
the obtaining a service result corresponding to the service identifier to be queried from a local cache of the client according to the service identifier to be queried and the mapping relationship between the service identifier and the service result includes:
and reading a service result corresponding to the service identifier to be inquired from a plurality of key value pairs stored in a local cache of the client according to the service identifier to be inquired.
Optionally, the obtaining the service identifier to be queried includes:
sending a service request to a chain node of the EtherFang alliance chain;
receiving a service identifier returned by the link point of the EtherFang alliance chain according to the service request;
and taking the service identifier as the service identifier to be inquired.
In a second aspect, an embodiment of the present application further provides a device for querying a service result of an ethernet alliance chain, including: the device comprises a first acquisition module and a second acquisition module;
the first acquisition module is used for acquiring a service identifier to be inquired;
and the second obtaining module is used for obtaining a service result corresponding to the service identifier to be inquired from a local cache of the client if the block identifier corresponding to the service identifier to be inquired is smaller than or equal to the first block identifier of the link point of the Ether Fang alliance chain, wherein the first block identifier of the link node of the Ether Fang alliance chain is the maximum block identifier corresponding to the service result locally cached by the client.
Optionally, the apparatus further comprises: a cache module;
the cache module is configured to store, according to a second block identifier of a chain node of the etherhouse alliance chain, a service result in the chain node database of the etherhouse alliance chain to a local cache of the client if the block identifier corresponding to the service identifier to be queried is greater than the first block identifier of the chain node of the etherhouse alliance chain, where the second block identifier of the chain node of the etherhouse alliance chain is a maximum block identifier on a current chain node;
the second obtaining module is specifically configured to obtain, according to the service identifier to be queried, a service result corresponding to the service identifier to be queried from a local cache of the client.
Optionally, the cache module is specifically configured to obtain, from the link point database of the etherhouse alliance chain, a service result list corresponding to a plurality of blocks located between the first block identifier of the link node and the second block identifier of the link node according to the first block identifier of the link point of the etherhouse alliance chain and the second block identifier of the link node of the etherhouse alliance chain; and traversing the service result list, acquiring a service result and storing the service result to a local cache of the client.
Optionally, the cache module is specifically configured to traverse the service result list, and obtain a mapping relationship between a plurality of sets of service identifiers and service results recorded in the service result list; and storing the mapping relation between the service identifications and the service results in a plurality of groups to a local cache of the client.
Optionally, the second obtaining module is specifically configured to obtain, from a local cache of the client, a service result corresponding to the service identifier to be queried according to the service identifier to be queried and a mapping relationship between the service identifier and the service result.
Optionally, the mapping relationship between the service identifier and the service result is represented by a key value pair;
the second obtaining module is specifically configured to, according to the service identifier to be queried, read a service result corresponding to the service identifier to be queried from a plurality of key value pairs stored in a local cache of the client.
Optionally, the first obtaining module is specifically configured to send a service request to a link node of the ethernet alliance chain; receiving a service identifier returned by the link point of the EtherFang alliance chain according to the service request; and taking the service identifier as the service identifier to be inquired.
In a third aspect, an embodiment of the present application provides a client device, including: a processor, a storage medium and a bus, the storage medium storing machine-readable instructions executable by the processor, the processor and the storage medium communicating via the bus when the client device is running, the processor executing the machine-readable instructions to perform the steps of the business result query method of the etherhouse federation chain as provided in the first aspect.
In a fourth aspect, an embodiment of the present application provides a storage medium, where the storage medium stores a computer program, and the computer program is executed by a processor to perform the steps of the business result query method for the etherhouse alliance chain as provided in the first aspect.
The beneficial effect of this application is:
the application provides a business result query method, a device, equipment and a medium of an EtherFang alliance chain, wherein the method comprises the following steps: acquiring a service identifier to be inquired; and if the block identifier corresponding to the service identifier to be queried is less than or equal to the first block identifier of the link point of the Etheng alliance chain, acquiring a service result corresponding to the service identifier to be queried from a local cache of the client, wherein the first block identifier of the link node of the Etheng alliance chain is the maximum block identifier corresponding to the service result of the local cache of the client. In the scheme, the service result corresponding to the service identifier to be inquired is obtained from the local cache of the client according to the service identifier to be inquired, and the inquiry of the service result is converted from the link point of the Ethengfang alliance chain to the local cache of the client, so that the empty inquiry caused by the fact that the block packing rate is less than the service request initiating rate when the service result inquiry is carried out in the database of the link point is effectively avoided, and the service processing performance is effectively improved.
In addition, by acquiring a plurality of service result lists corresponding to a plurality of blocks between the first block identifier and the second block identifier, the service result lists of each block stored in the link node database can be acquired, data omission is avoided, and service data results in local cache of the client are more comprehensive. And when the block identifier corresponding to the service identifier to be identified is larger than the first block identifier, triggering to reacquire a new maximum block identifier (second block identifier), acquiring a new service result from the database of the link node and storing the new service result into a local cache of the client, so that the frequency of data acquisition from the link node database can be effectively reduced while the service result acquired from the link node database is relatively comprehensive, and the service processing performance is improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are required to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained from the drawings without inventive effort.
Fig. 1 is a schematic flowchart of a service result query method for an ethernet alliance chain according to an embodiment of the present application;
fig. 2 is a schematic flowchart of another service result query method for an etherhouse alliance chain according to an embodiment of the present application;
fig. 3 is a schematic flowchart of a service result query method for an etherhouse alliance chain according to an embodiment of the present application;
fig. 4 is a schematic flowchart of another service result query method for an etherhouse alliance chain according to an embodiment of the present application;
fig. 5 is a schematic flowchart of a service result query method for an etherhouse alliance chain according to an embodiment of the present application;
fig. 6 is a schematic diagram of a service result query device of an ethernet alliance chain according to an embodiment of the present application;
fig. 7 is a schematic diagram of another business result query device of an ethernet alliance chain according to an embodiment of the present application;
fig. 8 is a schematic structural diagram of a client device according to an embodiment of the present application.
Detailed Description
In order to make the purpose, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it should be understood that the drawings in the present application are for illustrative and descriptive purposes only and are not used to limit the scope of protection of the present application. Additionally, it should be understood that the schematic drawings are not necessarily drawn to scale. The flowcharts used in this application illustrate operations implemented according to some embodiments of the present application. It should be understood that the operations of the flow diagrams may be performed out of order, and steps without logical context may be performed in reverse order or simultaneously. One skilled in the art, under the guidance of this application, may add one or more other operations to, or remove one or more operations from, the flowchart.
In addition, the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. The components of the embodiments of the present application, generally described and illustrated in the figures herein, can be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present application, presented in the accompanying drawings, is not intended to limit the scope of the claimed application, but is merely representative of selected embodiments of the application. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present application without making any creative effort, shall fall within the protection scope of the present application.
To enable those skilled in the art to utilize the present disclosure, the following embodiments are presented in conjunction with a specific application scenario, "EtherFang alliance chain". It will be apparent to those skilled in the art that the general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the application.
It should be noted that in the embodiments of the present application, the term "comprising" is used to indicate the presence of the features stated hereinafter, but does not exclude the addition of further features.
Before the technical solutions provided in the present application are explained in detail, some of the noun terms referred to in the present application will be briefly explained:
1. the method comprises the following steps: ethereum (ETH) is an open-source, intelligent contract-enabled, common blockchain platform that provides decentralized EVM (ethernet Virtual Machine) to handle point-to-point contracts via its dedicated cryptocurrency ethernet (ETH, abbreviated as "ETH").
2. Federation chain: the federation chain remains essentially a private chain, except that it is larger than a private chain developed by a single small organization, but not as large as a public chain, with the understanding that it is a block chain between the private chain and the public chain.
Only aiming at members of a certain group and limited third parties, a plurality of preselected nodes are internally designated as bookers, the generation of each block is jointly determined by all the preselected nodes, other access nodes can participate in transactions, but the billing process is not asked, and other third parties can carry out limited inquiry through the API opened by the block chain. To achieve better performance, the federation chain places certain requirements on the configuration and network environment of the consensus or authentication node. With the admission mechanism, the transaction performance can be improved more easily, and problems caused by the participants with uneven participation can be avoided.
3. Block identification (block high): the block chain stores transaction data for a certain period of time together as one block. The block is connected to the previous and subsequent blocks in time sequence. Thus, the blockchains are connected together from end to end. Considering that this is a vertical stack, the unit representing height is called "block height" for block numbering, i.e. block identification, for uniquely distinguishing different blocks.
4. And (3) empty query: the block-out time of the link node is about one second, and it is assumed that under normal conditions, the packed transaction amount of one block is 1000, and the time interval for the client to periodically poll the link node for the transaction result is 1 s. When the client initiates more transactions to a chain node per second, it is assumed to be 3000. The client obtains a transaction result (transactionaccept) of a transaction (transaction) in a timed polling manner, that is, two thousand transactions which are not packaged cannot obtain the transaction result according to a transaction identifier (transaction hash) of the client after one second, which is called null query.
5. Block discharging: and (4) completing transaction packaging of the blocks, executing packaging transaction completion by the chain nodes through the EVM, and successfully identifying the blocks.
Next, a brief description of the related background to which the present application relates will be given:
currently, the business result query of the ether house alliance chain is to initiate a transaction request (business request) to a link node through a client (wed3 sdk). When the chain node receives a transaction request initiated by a client, the chain node returns the unique identifier of the transaction request: and (4) identifying the transaction. Then, the client side sends a transaction result query request to the chain node again through the transaction identification returned by the chain node, namely, the transaction result is obtained. Two communication Protocol modes of the client and the link point are provided, one is provided by http (HyperText Transfer Protocol) and the other is rpc (Remote Procedure Call), and the two modes are both provided in a built-in mode. On the one hand, it is known that the link points will time out blocks (all within substantially 1 second). In addition, the number of block packed Transactions Per Second is approximately equal to tps (Transactions Per Second, the number of Transactions transmitted Per Second) of Transactions. In other words, only after a transaction is block-packed and the consensus is successful, the transaction is considered to be successfully executed and a corresponding transaction result list is generated. Since the client does not know when the link node can complete the execution of the corresponding transaction and generate the transaction result list, the current practice of the client is to initiate a transaction result query request to the link node at regular time (every second) by the transaction identifier until the link node returns the transaction result list.
As mentioned above, the client periodically sends a transaction result query request to the chain node through the transaction identifier, which results in a large number of null queries. However, the empty query will cause the transaction execution speed to be slower and slower along with the increase of the data amount in the link point database, so that the linear decrease of the number of link point packed transactions, that is, the linear decrease of the transaction processing performance, is caused.
Here again, a null query is resolved for reasons that may lead to performance degradation in transaction execution. Data (such as transaction results) generated in the block outputting process are stored in a leveldb (high-performance key-value database) storage engine, namely a chain link database. As time goes on, that is, the more blocks that complete the consensus, the more data will be stored, and when the data reaches the level of ten million, billion or billion, a null query will cause the leveldb to generate a behavior of scanning all records once, while the larger the data amount, the longer the time consumption for scanning all records will be, and the slower the performance of reading requests from the leveldb will be. The EVM needs to rely on the read operation of leveldb to execute the transaction, so that the transaction execution speed of the EVM is slower and slower, and the transaction execution performance is reduced.
The core of the technical scheme provided by the application is as follows: through the query of the highest block height of the link node, a corresponding service result list is pulled from the link node database, and the service identifier and the service result contained in the service result list are stored in the local cache of the client, so that when the service result query is carried out according to the service identifier, the query can be directly carried out from the local cache of the client, and the problem of service processing performance reduction caused by empty query is effectively avoided.
The following describes the principle of implementing the business result query method of the etherhouse alliance chain and the beneficial effects thereof by using a plurality of specific embodiments.
Fig. 1 is a schematic flowchart of a service result query method for an ethernet alliance chain according to an embodiment of the present application; the execution subject of the method may be a client, which may be a device that communicates with each other with the chain of nodes of the etherhouse federation chain. The EtherFang alliance chain can comprise a plurality of chain nodes, the client can start a service request to any chain node, and the chain node can return a service identifier corresponding to the service request to the client after receiving the service request, so that the client can inquire a corresponding service result from the chain node according to the service identifier. As shown in fig. 1, the method may include:
s101, acquiring a service identifier to be inquired.
Optionally, the service in this embodiment also refers to the transaction in the above background description, and it should be understood that the transaction in the blockchain is not particularly referring to the fund transaction, but may be understood as a data interaction in a broad sense. That is, the service in this embodiment may not be limited to fund interaction, but may also be other data interaction.
Optionally, the client initiates a service request to a link point of the ethernet alliance chain, after receiving the service request, the link point performs information summarization operation according to the content of the service request to generate a service identifier, and feeds the service identifier back to the client, so that the client can initiate a service result query request again according to the acquired service identifier. The service identifier is used for uniquely identifying one service and distinguishing different services.
S102, if the block identifier corresponding to the service identifier to be inquired is smaller than or equal to the first block identifier of the link point of the Etheng alliance chain, acquiring the service result corresponding to the service identifier to be inquired from the local cache of the client, wherein the first block identifier of the link node of the Etheng alliance chain is the maximum block identifier corresponding to the service result locally cached by the client.
Optionally, after receiving the service request, the link node packages the service request into blocks in sequence and performs consensus, and after the consensus passes, the link node sends the service request in the blocks to the ethernet virtual machine for processing, and finally generates a block (out-of-block) according to a processing result, and stores the obtained processing result (service result) into the link node database.
Each service identifier acquired by the client corresponds to a block, wherein the blocks corresponding to different service identifiers may be the same or different. One block may contain a plurality of services, and similarly, one block may correspondingly contain a plurality of service identifiers. That is, there is a many-to-one relationship between the service identifier and the block.
In this embodiment, the service result stored in the local cache of the client may be obtained from a link point database of the ethernet alliance chain, where the service result stored in the local cache is fixed within a certain time, and a maximum block identifier of block identifiers corresponding to the service result may be a first block identifier of a link point of the ethernet alliance chain. When the service result query is executed, the query may be continuously incremented from the minimum block identifier according to the block identifier corresponding to the service identifier.
Optionally, when the block identifier corresponding to the service identifier to be queried is less than or equal to the maximum block identifier corresponding to the service result locally cached at the client, the service result corresponding to the service identifier to be queried may be obtained from the local cache of the client through the service identifier to be queried.
In an implementation manner, a plurality of service results stored in the local cache of the client may be traversed through the service identifier to be queried, and a service result corresponding to the service identifier to be queried is obtained therefrom.
In another implementation manner, the service result corresponding to the service identifier to be queried may also be obtained directly from the multiple service results stored in the local cache of the client through the service identifier to be queried.
Optionally, no matter traversing the local cache of the client or directly obtaining the service result from the local cache of the client, compared with the prior art, the method and the device convert the service result obtained from the link point of the etherhouse alliance chain into the service result obtained from the local cache of the client, thereby effectively avoiding the problem of reduced service processing efficiency caused by null query, and effectively improving the service processing performance.
In summary, the present embodiment provides a method for querying a service result of an ethernet alliance chain, including: acquiring a service identifier to be inquired; and if the block identifier corresponding to the service identifier to be queried is less than or equal to the first block identifier of the link point of the Etheng alliance chain, acquiring a service result corresponding to the service identifier to be queried from a local cache of the client, wherein the first block identifier of the link node of the Etheng alliance chain is the maximum block identifier corresponding to the service result of the local cache of the client. In the scheme, the service result corresponding to the service identifier to be inquired is obtained from the local cache of the client according to the service identifier to be inquired, and the inquiry of the service result is converted from the link point of the Ethengfang alliance chain to the local cache of the client, so that the empty inquiry caused by the fact that the block packing rate is less than the service request initiating rate when the service result inquiry is carried out in the database of the link point is effectively avoided, and the service processing performance is effectively improved.
Fig. 2 is a schematic flowchart of another service result query method for an etherhouse alliance chain according to an embodiment of the present application; optionally, as shown in fig. 2, the method of the present application may further include:
s201, if the block identifier corresponding to the service identifier to be inquired is larger than the first block identifier of the link point of the Etheng alliance chain, storing the service result in the link point database of the Etheng alliance chain to a local cache of the client according to the second block identifier of the link node of the Etheng alliance chain, wherein the second block identifier of the link node of the Etheng alliance chain is the maximum block identifier of the current link point.
In this embodiment, how to obtain a service result from a link point database of an ethernet alliance chain and store the service result in a local cache of a client is described.
It should be noted that, the blocks in the block chain are blocked in a way of increasing one by one block identifier (block height), and when the block with the block identifier n is successfully blocked, that is, all the service requests packed by the block n are completed, a corresponding service result list is generated. And storing the service result list into a link point database, wherein the service result list comprises the service identification and the service result. As the chain nodes continuously receive new service requests and execute the service requests, the chain nodes continuously output blocks in a self-increasing mode according to the block identifiers.
Optionally, when the client system is initialized, the first block identifier of the current link node, that is, the maximum block identifier of the current link node, may be obtained through a query interface getblockacknum () provided by a link node of the etherhouse federation chain, for example: the current link node has 5 blocks, that is, blocks go to block 5, and then the maximum block identifier of the current link node is block 5.
Optionally, the first block identifier of the current link node may be obtained, a service result list of the block identified by the first block identifier and a plurality of block identifiers before the first block identifier is obtained from the link point database, and the service result stored in the service result list is stored in a local cache of the client.
When the block identifier corresponding to the service identifier to be queried is larger than the first block identifier, because the service result included in the new block is not stored in the local cache of the client, at this time, the corresponding service result cannot be queried from the local cache of the client through the service identifier to be queried, then the maximum block identifier of the current link node, namely the second block identifier, needs to be obtained again, and new service result data is obtained from the link node database according to the second block identifier and stored in the local cache of the client, so as to ensure the validity of the query.
It should be noted that, of the first block identifier and the second block identifier, the first and the second block identifiers are only used for distinguishing the largest block identifier obtained in two adjacent times, and when the first block identifier is the largest block identifier of the current link node, the second block identifier is the largest block identifier of the next link node obtained currently.
For example: during initialization, if the maximum block identifier of the current link node is 5, the service result list corresponding to the blocks 1 to 5 may be obtained from the link point database according to the maximum block identifier 5, so that the service results included in the service result list are stored in the local cache of the client. Meanwhile, the client also queries corresponding service results from the service results stored in the local cache of the client according to the service identifier to be queried. The block identifier corresponding to the service identifier to be queried may be gradually increased from block 1 to block 5, for example: the service identifier 1-5 to be inquired corresponds to the block 1, the service identifier 6-10 to be inquired corresponds to the block 2 and the like, so that service result inquiry is sequentially carried out. When the block identifier corresponding to the service identifier to be queried is greater than the maximum block identifier corresponding to the service result stored in the local cache of the client, that is, greater than the block 5, if the block identifier corresponding to the service identifier to be queried is 6, then the service result corresponding to the block 6 is not stored in the local cache of the client at this time, the maximum block identifier of the current link node may be obtained by triggering getBlockNum () provided by the link node itself again, and if the maximum block identifier of the current link node is 8, then new service result data may be obtained from the link node database according to the maximum block identifier of the current link node and stored in the local cache of the client according to the above method, and the above-described loop execution is performed.
Exemplary code to which the present embodiments relate is provided as follows:
s202, according to the service identification to be inquired, acquiring a service result corresponding to the service identification to be inquired from a local cache of the client.
Optionally, since the service result obtained from the link point database is stored in the local cache of the client, the corresponding service result can be obtained from the local cache of the client according to the service identifier to be queried, and it is not necessary to obtain the corresponding service result from the link point database by traversing query according to the service identifier to be queried in the prior art, thereby avoiding the problem of service processing performance reduction caused by null query.
Optionally, how to obtain the corresponding service result from the local cache of the client according to the service identifier to be queried may be understood with reference to the following specific embodiments.
Fig. 3 is a schematic flowchart of a service result query method for an etherhouse alliance chain according to an embodiment of the present application; optionally, as shown in fig. 3, in the step S201, storing the service result in the chain node database of the etherhouse alliance chain to the local cache of the client according to the second block identifier of the chain node of the etherhouse alliance chain may include:
s301, acquiring a service result list corresponding to a plurality of blocks between the first block identifier of the link node and the second block identifier of the link node from the link point database of the EtherFang alliance chain according to the first block identifier of the link node of the EtherFang alliance chain and the second block identifier of the link node of the EtherFang alliance chain.
Optionally, when obtaining the service result lists corresponding to the multiple blocks located between the first block identifier of the chain node and the second block identifier of the chain node, because the service result list corresponding to the first block identifier has already been obtained, the service result list corresponding to the first block identifier is not included.
Optionally, when the client is initialized, only the maximum block identifier of the current link node may be obtained, and then, according to the current maximum block identifier, a service result list corresponding to multiple blocks located between the minimum block identifier and the maximum block identifier is obtained.
For example: when the client is initialized, if the obtained maximum block identifier of the current link node is 5 and the minimum block identifier of the link node is 1, the service result list corresponding to the block 1-the block 5 can be obtained from the link point database.
And when the block identifier corresponding to the service identifier to be queried is greater than 5, the current maximum block identifier (second block identifier) of the link point can be obtained again, and if the block identifier is 8, the service result list corresponding to the blocks 6-8 can be obtained from the link point database. By analogy, when the maximum block identifier of the next acquired link node is 12, the service result list corresponding to the blocks 7 to 12 can be acquired from the link point database.
Optionally, by obtaining a plurality of service result lists corresponding to a plurality of blocks located between the first block identifier and the second block identifier, it can be ensured that the service result list of each block stored in the link node database can be obtained, and data omission is avoided, so that the service data result in the local cache of the client is more comprehensive. In addition, when the block identifier corresponding to the service identifier to be identified is larger than the first block identifier, the new maximum block identifier (second block identifier) is triggered to be obtained again, and a new service result is obtained from the database of the link node and stored in the local cache of the client.
S302, traversing the service result list, obtaining the service result and storing the service result to a local cache of the client.
In some embodiments, the service result list may further include data related to the service request in addition to the service identifier and the service result, and in this embodiment, the service result may be obtained from the service result list by traversing the obtained service result list and stored in the local cache of the client, so that excessive data unrelated to the service result may be prevented from being stored in the local cache of the client, and the data amount in the local cache of the client may be reduced.
Fig. 4 is a schematic flowchart of another service result query method for an etherhouse alliance chain according to an embodiment of the present application; optionally, as shown in fig. 4, in the step S302, traversing the service result list, obtaining the service result, and storing the service result in the local cache of the client, may include:
s401, traversing the service result list, and acquiring a mapping relation between a plurality of groups of service identifications and service results recorded in the service result list.
Optionally, the obtained service result list is a service result list corresponding to a plurality of blocks, and each service result list includes a plurality of service results and a service identifier corresponding to each service result, so that the mapping relationship between a plurality of sets of service identifiers and service results can be obtained from the service result list by traversing the service result list.
S402, storing the mapping relation between the plurality of groups of service identifications and the service results to a local cache of the client.
Optionally, the service identifier and the service result may be stored in a local cache of the client according to the mapping relationship between the obtained service identifier and the service result. Therefore, the service result corresponding to the service identifier to be queried can be obtained from the local cache of the client according to the service identifier to be queried and the mapping relation between the stored service identifier and the service result.
Optionally, in step S202, obtaining a service result corresponding to the service identifier to be queried from a local cache of the client according to the service identifier to be queried may include: and acquiring a service result corresponding to the service identifier to be inquired from a local cache of the client according to the service identifier to be inquired and the mapping relation between the service identifier and the service result.
Optionally, according to the service identifier to be queried, service identifier matching may be performed in a local cache of the client, and a service result mapped by the service identifier obtained through matching is used as a service result corresponding to the service identifier to be queried.
Optionally, in step S401, the mapping relationship between the service identifier and the service result is represented by a key-value pair. Obtaining a service result corresponding to the service identifier to be queried from a local cache of the client according to the service identifier to be queried and a mapping relationship between the service identifier and the service result, which may include: and reading a service result corresponding to the service identifier to be inquired from a plurality of key value pairs stored in a local cache of the client according to the service identifier to be inquired.
In some embodiments, the mapping relationship between the service identifier and the service result may be represented by a key-value pair, that is: service identification: and the service result can be stored in a key value pair mode when the mapping relation between the service identifier and the service result is stored in a local cache of the client. Then, when the corresponding service result is queried from the local cache of the client according to the service identifier to be queried, the service identifier to be queried can be matched with the service identifier in each key value pair, and when the matching is successful, the service result corresponding to the matched service identifier is obtained, namely the service result corresponding to the service identifier to be queried is obtained.
In other embodiments, the mapping relationship between the service identifier and the service result may also be recorded in a form of a table, for example, the table includes two rows and two columns, the first column represents the service identifier, the second column represents the service result, when the service result is queried through the service identifier to be queried, the service identifier to be queried is also matched with the service identifier recorded in the table, and after the matching is successful, the service result corresponding to the matched service identifier is obtained, so as to obtain the service result corresponding to the service identifier to be queried.
Of course, in practical applications, the mapping relationship between the service identifier and the service result may not be limited to the above-listed representation form, and the application does not specifically limit this.
Fig. 5 is a schematic flowchart of a service result query method for an etherhouse alliance chain according to an embodiment of the present application; optionally, as shown in fig. 5, the obtaining of the service identifier to be queried in step S101 may include:
s501, sending a service request to a link node of the EtherFang alliance chain.
S502, receiving a service identifier returned by the link point of the EtherFang alliance chain according to the service request.
S503, the service identifier is used as the service identifier to be inquired.
Optionally, the specific method for acquiring the service identifier to be queried has been described in detail in the foregoing embodiment, and is not described herein any more, and can be understood by referring to the foregoing explanation.
To sum up, an embodiment of the present application provides a method for querying a service result of an ethernet alliance chain, including: acquiring a service identifier to be inquired; and if the block identifier corresponding to the service identifier to be queried is less than or equal to the first block identifier of the link point of the Etheng alliance chain, acquiring a service result corresponding to the service identifier to be queried from a local cache of the client, wherein the first block identifier of the link node of the Etheng alliance chain is the maximum block identifier corresponding to the service result of the local cache of the client. In the scheme, the service result corresponding to the service identifier to be inquired is obtained from the local cache of the client according to the service identifier to be inquired, and the inquiry of the service result is converted from the link point of the Ethengfang alliance chain to the local cache of the client, so that the empty inquiry caused by the fact that the block packing rate is less than the service request initiating rate when the service result inquiry is carried out in the database of the link point is effectively avoided, and the service processing performance is effectively improved.
In addition, by acquiring a plurality of service result lists corresponding to a plurality of blocks between the first block identifier and the second block identifier, the service result lists of each block stored in the link node database can be acquired, data omission is avoided, and service data results in local cache of the client are more comprehensive. And when the block identifier corresponding to the service identifier to be identified is larger than the first block identifier, triggering to reacquire a new maximum block identifier (second block identifier), acquiring a new service result from the database of the link node and storing the new service result into a local cache of the client, so that the frequency of data acquisition from the link node database can be effectively reduced while the service result acquired from the link node database is relatively comprehensive, and the service processing performance is improved.
The following describes a device, an apparatus, and a storage medium for executing the business result query method of the etherhouse alliance chain provided in the present application, and specific implementation processes and technical effects thereof are referred to above, and are not described again below.
Fig. 6 is a schematic diagram of a service result query device of an ethernet factory alliance chain according to an embodiment of the present application, where functions implemented by the service result query device of the ethernet factory alliance chain correspond to steps executed by the foregoing method. The device may be understood as the above-mentioned client, or a processor of the client, or may be understood as a component that is independent from the above-mentioned client or processor and implements the functions of the present application under the control of the client, and optionally, as shown in fig. 6, the service result query device of the ethernet alliance chain includes: a first obtaining module 601 and a second obtaining module 602;
a first obtaining module 601, configured to obtain a service identifier to be queried;
a second obtaining module 602, configured to obtain, from the local cache of the client, a service result corresponding to the service identifier to be queried if the block identifier corresponding to the service identifier to be queried is less than or equal to the first block identifier of the link point of the etherhouse federation chain, where the first block identifier of the link node of the etherhouse federation chain is a maximum block identifier corresponding to the service result locally cached by the client.
Optionally, as shown in fig. 7, the apparatus further includes: a caching module 603;
the cache module 603 is configured to store, according to a second block identifier of a link node of the etherhouse alliance chain, a service result in the link point database of the etherhouse alliance chain to a local cache of the client if the block identifier corresponding to the service identifier to be queried is greater than the first block identifier of the link point of the etherhouse alliance chain, where the second block identifier of the link node of the etherhouse alliance chain is a largest block identifier on a current link point;
the second obtaining module 602 is specifically configured to obtain, according to the service identifier to be queried, a service result corresponding to the service identifier to be queried from a local cache of the client.
Optionally, the cache module 603 is specifically configured to obtain, from the link point database of the etherhouse alliance chain, a service result list corresponding to a plurality of blocks located between the first block identifier of the link node and the second block identifier of the link node according to the first block identifier of the link point of the etherhouse alliance chain and the second block identifier of the link node of the etherhouse alliance chain; and traversing the service result list, acquiring the service result and storing the service result to a local cache of the client.
Optionally, the caching module 603 is specifically configured to traverse the service result list, and obtain a mapping relationship between a plurality of sets of service identifiers and service results recorded in the service result list; and storing the mapping relation between the plurality of groups of service identifications and the service results to a local cache of the client.
Optionally, the second obtaining module 602 is specifically configured to obtain, according to the service identifier to be queried and the mapping relationship between the service identifier and the service result, the service result corresponding to the service identifier to be queried from the local cache of the client.
Optionally, the mapping relationship between the service identifier and the service result is represented by a key value pair;
the second obtaining module 602 is specifically configured to, according to the service identifier to be queried, read a service result corresponding to the service identifier to be queried from a plurality of key value pairs stored in a local cache of the client.
Optionally, the first obtaining module 601 is specifically configured to send a service request to a link node of an ethernet alliance chain; receiving a service identifier returned by the link point of the Ether Fang alliance chain according to the service request; and using the service identifier as a service identifier to be inquired.
The above-mentioned apparatus is used for executing the method provided by the foregoing embodiment, and the implementation principle and technical effect are similar, which are not described herein again.
These above modules may be one or more integrated circuits configured to implement the above methods, such as: one or more Application Specific Integrated Circuits (ASICs), or one or more microprocessors (DSPs), or one or more Field Programmable Gate Arrays (FPGAs), among others. For another example, when one of the above modules is implemented in the form of a Processing element scheduler code, the Processing element may be a general-purpose processor, such as a Central Processing Unit (CPU) or other processor capable of calling program code. For another example, these modules may be integrated together and implemented in the form of a system-on-a-chip (SOC).
The modules may be connected or in communication with each other via a wired or wireless connection. The wired connection may include a metal cable, an optical cable, a hybrid cable, etc., or any combination thereof. The wireless connection may comprise a connection over a LAN, WAN, bluetooth, ZigBee, NFC, or the like, or any combination thereof. Two or more modules may be combined into a single module, and any one module may be divided into two or more units. It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the system and the apparatus described above may refer to corresponding processes in the method embodiments, and are not described in detail in this application.
It should be noted that the above modules may be one or more integrated circuits configured to implement the above methods, for example: one or more Application Specific Integrated Circuits (ASICs), or one or more microprocessors (DSPs), or one or more Field Programmable Gate Arrays (FPGAs), among others. For another example, when one of the above modules is implemented in the form of a Processing element scheduler code, the Processing element may be a general-purpose processor, such as a Central Processing Unit (CPU) or other processor capable of calling program code. For another example, the modules may be integrated together and implemented in the form of a System-on-a-chip (SOC).
Fig. 8 is a schematic structural diagram of a client device provided in an embodiment of the present application, and optionally, as shown in fig. 8, the device may include: a processor 801 and a memory 802.
The memory 802 is used for storing programs, and the processor 801 calls the programs stored in the memory 802 to execute the above-mentioned method embodiments. The specific implementation and technical effects are similar, and are not described herein again.
The memory 802 stores therein program code that, when executed by the processor 801, causes the processor 801 to perform various steps of the business result query method of the etherhouse federation chain according to various exemplary embodiments of the present application described in the "exemplary methods" section above in this specification.
The Processor 801 may be a general-purpose Processor, such as a Central Processing Unit (CPU), a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic device, discrete hardware components, and may implement or execute the methods, steps, and logic blocks disclosed in the embodiments of the present Application. A general purpose processor may be a microprocessor or any conventional processor or the like. The steps of a method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware processor, or may be implemented by a combination of hardware and software modules in a processor.
Optionally, the present application also provides a program product, such as a computer readable storage medium, comprising a program which, when being executed by a processor, is adapted to carry out the above-mentioned method embodiments.
In the several embodiments provided in the present application, it should be understood that the disclosed 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 be in an electrical, mechanical or other form.
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 purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application 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 can be realized in a form of hardware, or in a form of hardware plus a software functional unit.
The integrated unit implemented in the form of a software functional unit may be stored in a computer readable storage medium. The software functional unit is stored in a storage medium and includes several instructions for enabling a computer device (which may be a personal computer, a server, or a network device) or a processor (processor) to perform some steps of the methods according to the embodiments of the present application. 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.
Claims (10)
1. A business result query method of an EtherFang alliance chain is characterized by comprising the following steps:
acquiring a service identifier to be inquired;
and if the block identifier corresponding to the service identifier to be queried is smaller than or equal to the first block identifier of the link point of the Ether Fang alliance chain, acquiring the service result corresponding to the service identifier to be queried from a local cache of the client, wherein the first block identifier of the link node of the Ether Fang alliance chain is the maximum block identifier corresponding to the service result locally cached by the client.
2. The method of claim 1, further comprising:
if the block identifier corresponding to the service identifier to be inquired is larger than the first block identifier of the link point of the Etheng alliance chain, storing the service result in the link point database of the Etheng alliance chain to a local cache of the client according to the second block identifier of the link node of the Etheng alliance chain, wherein the second block identifier of the link node of the Etheng alliance chain is the maximum block identifier of the current link point;
and acquiring a service result corresponding to the service identifier to be inquired from a local cache of the client according to the service identifier to be inquired.
3. The method of claim 2, wherein the saving the business results in the chain-link database of the EtherFangFederation chain to a local cache of the client according to the second block identifier of the chain node of the EtherFangFederation chain comprises:
acquiring a service result list corresponding to a plurality of blocks between a first block identifier of a chain node and a second block identifier of the chain node from a chain link point database of the EtherFang alliance chain according to the first block identifier of the chain link point of the EtherFang alliance chain and the second block identifier of the chain node of the EtherFang alliance chain;
and traversing the service result list, acquiring a service result and storing the service result to a local cache of the client.
4. The method of claim 3, wherein traversing the service result list, obtaining the service result and saving the service result to the local cache of the client comprises:
traversing the service result list to obtain the mapping relation between the plurality of groups of service identifications and the service results recorded in the service result list;
and storing the mapping relation between the service identifications and the service results in a plurality of groups to a local cache of the client.
5. The method according to any one of claims 1 to 4, wherein the obtaining, according to the service identifier to be queried, the service result corresponding to the service identifier to be queried from a local cache of the client includes:
and acquiring a service result corresponding to the service identifier to be inquired from a local cache of the client according to the service identifier to be inquired and the mapping relation between the service identifier and the service result.
6. The method according to claim 5, wherein the mapping relationship between the service identifier and the service result is represented by a key-value pair;
the obtaining a service result corresponding to the service identifier to be queried from a local cache of the client according to the service identifier to be queried and the mapping relationship between the service identifier and the service result includes:
and reading a service result corresponding to the service identifier to be inquired from a plurality of key value pairs stored in a local cache of the client according to the service identifier to be inquired.
7. The method according to claim 1, wherein the obtaining the service identifier to be queried comprises:
sending a service request to a chain node of the EtherFang alliance chain;
receiving a service identifier returned by the link point of the EtherFang alliance chain according to the service request;
and taking the service identifier as the service identifier to be inquired.
8. A business result query device of an Ethernet workshop alliance chain is characterized by comprising the following components: the device comprises a first acquisition module and a second acquisition module;
the first acquisition module is used for acquiring a service identifier to be inquired;
and the second obtaining module is used for obtaining a service result corresponding to the service identifier to be inquired from a local cache of the client if the block identifier corresponding to the service identifier to be inquired is smaller than or equal to the first block identifier of the link point of the Ether Fang alliance chain, wherein the first block identifier of the link node of the Ether Fang alliance chain is the maximum block identifier corresponding to the service result locally cached by the client.
9. A client device, comprising: a processor, a storage medium and a bus, the storage medium storing program instructions executable by the processor, the processor and the storage medium communicating via the bus when a client device is running, the processor executing the program instructions to perform the steps of the business result query method of the etherhouse federation chain according to any one of claims 1 to 7.
10. A computer-readable storage medium, characterized in that the storage medium has stored thereon a computer program which, when being executed by a processor, performs the steps of the business result query method of the etherhouse federation chain according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011413141.8A CN112612816B (en) | 2020-12-01 | 2020-12-01 | Service result query method, device, equipment and medium of Ethernet alliance chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011413141.8A CN112612816B (en) | 2020-12-01 | 2020-12-01 | Service result query method, device, equipment and medium of Ethernet alliance chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112612816A true CN112612816A (en) | 2021-04-06 |
| CN112612816B CN112612816B (en) | 2023-06-30 |
Family
ID=75229061
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011413141.8A Active CN112612816B (en) | 2020-12-01 | 2020-12-01 | Service result query method, device, equipment and medium of Ethernet alliance chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112612816B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113807968A (en) * | 2021-09-22 | 2021-12-17 | 网易（杭州）网络有限公司 | Block chain user request processing method, device, request server and storage medium |
| CN115314530A (en) * | 2022-06-30 | 2022-11-08 | 中国第一汽车股份有限公司 | Information processing method and device and vehicle |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170262862A1 (en) * | 2015-12-21 | 2017-09-14 | Mohamed Alaa Aljawhari | Method and apparatus for managing and providing provenance of product using blockchain |
| WO2019100991A1 (en) * | 2017-11-27 | 2019-05-31 | 北京京东金融科技控股有限公司 | Information processing method, device and system, storage medium, and electronic device |
| CN110009510A (en) * | 2019-01-22 | 2019-07-12 | 阿里巴巴集团控股有限公司 | Transaction processing system, method, calculating equipment and storage medium based on block chain |
| CN110162543A (en) * | 2019-05-29 | 2019-08-23 | 北京奇艺世纪科技有限公司 | A kind of information query method and device |
| CN110597835A (en) * | 2019-09-17 | 2019-12-20 | 深圳前海微众银行股份有限公司 | Transaction data deleting method and device based on block chain |
| CN110753084A (en) * | 2019-09-06 | 2020-02-04 | 平安普惠企业管理有限公司 | Uplink data reading method, cache server and computer readable storage medium |
| WO2020035090A2 (en) * | 2019-11-08 | 2020-02-20 | Alipay (Hangzhou) Information Technology Co., Ltd. | Lightweight decentralized application platform |
| CN110830581A (en) * | 2019-11-12 | 2020-02-21 | 金蝶软件（中国）有限公司 | Method for improving block chain response speed, block chain application system and related equipment |
| CN111475704A (en) * | 2020-03-17 | 2020-07-31 | 平安科技（深圳）有限公司 | Intelligent domain name resolution method and device and computer readable storage medium |
| CN111488349A (en) * | 2020-04-08 | 2020-08-04 | 北京瑞策科技有限公司 | Data query method and device based on service data block chain |
| WO2020181985A1 (en) * | 2019-03-12 | 2020-09-17 | 深圳前海微众银行股份有限公司 | Blockchain multiple alliance chain load balancing method and device |
-
2020
- 2020-12-01 CN CN202011413141.8A patent/CN112612816B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170262862A1 (en) * | 2015-12-21 | 2017-09-14 | Mohamed Alaa Aljawhari | Method and apparatus for managing and providing provenance of product using blockchain |
| WO2019100991A1 (en) * | 2017-11-27 | 2019-05-31 | 北京京东金融科技控股有限公司 | Information processing method, device and system, storage medium, and electronic device |
| CN110009510A (en) * | 2019-01-22 | 2019-07-12 | 阿里巴巴集团控股有限公司 | Transaction processing system, method, calculating equipment and storage medium based on block chain |
| WO2020181985A1 (en) * | 2019-03-12 | 2020-09-17 | 深圳前海微众银行股份有限公司 | Blockchain multiple alliance chain load balancing method and device |
| CN110162543A (en) * | 2019-05-29 | 2019-08-23 | 北京奇艺世纪科技有限公司 | A kind of information query method and device |
| CN110753084A (en) * | 2019-09-06 | 2020-02-04 | 平安普惠企业管理有限公司 | Uplink data reading method, cache server and computer readable storage medium |
| CN110597835A (en) * | 2019-09-17 | 2019-12-20 | 深圳前海微众银行股份有限公司 | Transaction data deleting method and device based on block chain |
| WO2020035090A2 (en) * | 2019-11-08 | 2020-02-20 | Alipay (Hangzhou) Information Technology Co., Ltd. | Lightweight decentralized application platform |
| CN110830581A (en) * | 2019-11-12 | 2020-02-21 | 金蝶软件（中国）有限公司 | Method for improving block chain response speed, block chain application system and related equipment |
| CN111475704A (en) * | 2020-03-17 | 2020-07-31 | 平安科技（深圳）有限公司 | Intelligent domain name resolution method and device and computer readable storage medium |
| CN111488349A (en) * | 2020-04-08 | 2020-08-04 | 北京瑞策科技有限公司 | Data query method and device based on service data block chain |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113807968A (en) * | 2021-09-22 | 2021-12-17 | 网易（杭州）网络有限公司 | Block chain user request processing method, device, request server and storage medium |
| CN113807968B (en) * | 2021-09-22 | 2024-02-23 | 网易（杭州）网络有限公司 | Block chain user request processing method and device, entrusting server and storage medium |
| CN115314530A (en) * | 2022-06-30 | 2022-11-08 | 中国第一汽车股份有限公司 | Information processing method and device and vehicle |
| CN115314530B (en) * | 2022-06-30 | 2024-01-05 | 中国第一汽车股份有限公司 | Information processing method and device and vehicle |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112612816B (en) | 2023-06-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111522641B (en) | Task scheduling method, device, computer equipment and storage medium | |
| JP6626211B2 (en) | Method and apparatus for processing short link and short link server | |
| WO2019114128A1 (en) | Block chain transaction block processing method, electronic device and readable storage medium | |
| JP2019504412A (en) | Short link processing method, device, and server | |
| EP4300323A1 (en) | Data processing method and apparatus for blockchain network, computer device, computer readable storage medium, and computer program product | |
| CN112612816A (en) | Service result query method, device, equipment and medium for Ether house alliance chain | |
| WO2020173080A1 (en) | Method and apparatus for querying call chain information | |
| CN101694665A (en) | Method and device for data query of heterogeneous data source | |
| CN110110006A (en) | Data managing method and Related product | |
| CN110581893B (en) | Data transmission method and device, routing equipment, server and storage medium | |
| CN102710763A (en) | Method and system for pooling, slicing and fault transfer of distributed cache | |
| CN111159219A (en) | Data management method, device, server and storage medium | |
| WO2019153660A1 (en) | Transaction processing method and apparatus, and computer device and storage medium | |
| CN113900810A (en) | Distributed graph processing method, system and storage medium | |
| CN111666289A (en) | Data storage and query method and device, electronic equipment and readable storage medium | |
| CN109189808B (en) | Data query method and related equipment | |
| CN111400301A (en) | Data query method, device and equipment | |
| CN111209263A (en) | Data storage method, device, equipment and storage medium | |
| WO2017000540A1 (en) | Data query method and device | |
| CN108124021A (en) | Internet protocol IP address obtains, the method, apparatus and system of website visiting | |
| CN106446080B (en) | Data query method, query service equipment, client equipment and data system | |
| CN115470246A (en) | CDN-based request response method, electronic equipment and storage medium | |
| CN112148925B (en) | User identification association query method, device, equipment and readable storage medium | |
| JP2014524210A (en) | Generate variable length nonce | |
| CN113407562A (en) | Communication method and device of distributed database system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |