CN112612816B - Service result query method, device, equipment and medium of Ethernet alliance chain - Google Patents
Service result query method, device, equipment and medium of Ethernet alliance chain Download PDFInfo
- Publication number
- CN112612816B CN112612816B CN202011413141.8A CN202011413141A CN112612816B CN 112612816 B CN112612816 B CN 112612816B CN 202011413141 A CN202011413141 A CN 202011413141A CN 112612816 B CN112612816 B CN 112612816B
- Authority
- CN
- China
- Prior art keywords
- service
- identifier
- queried
- chain
- client
- 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.)
- Active
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
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Computational Linguistics (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Computing Systems (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Technology Law (AREA)
- General Business, Economics & Management (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The application provides a service result query method, device, equipment and medium of an Ethernet alliance chain, and relates to the technical field of block chains. The method comprises the following steps: acquiring a service identifier to be queried; 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 chain node of the Ethernet alliance chain, acquiring a service result corresponding to the service identifier to be queried from the local cache of the client, wherein the first block identifier of the chain node of the Ethernet alliance chain is the maximum block identifier corresponding to the service result locally cached by the client. In the scheme, the service result corresponding to the service identifier to be queried is obtained from the local cache of the client according to the service identifier to be queried, and the query of the service result is converted from the link point of the Ethernet alliance chain to the local cache of the client, so that the empty query caused when the service result query is performed in the database of the link point is effectively avoided, and the service processing performance is effectively improved.
Description
Technical Field
The application relates to the technical field of blockchains, in particular to a business result query method, device, equipment and medium of an Ethernet alliance chain.
Background
At present, a alliance chain based on an Ethernet architecture is characterized in that a client initiates a transaction to a link point, and a transaction result inquiry request is initiated to the link point according to a transaction identifier returned by the link point so as to acquire a transaction result.
In the prior art, when a client terminal inquires a link point to acquire a transaction result, a transaction result inquiry request is issued to the link point at fixed time through a transaction identifier so as to inquire and acquire the transaction result from a transaction list stored in a link point database. When the number of the transactions initiated by the client in the timing time interval is greater than the number of the transactions packaged by the blocks in the link points, the transaction results cannot be obtained according to the transaction identification in the next time interval because part of the transactions initiated are not packaged, so that an empty query is generated.
In the prior art, due to the generation of the empty query, when the data volume in the link point database is continuously increased, the time consumption of the empty query is relatively large, which results in slower and slower execution speed of the transaction, thereby reducing transaction processing performance.
Disclosure of Invention
The invention aims to provide a service result query method, device, equipment and medium of an Ethernet alliance chain aiming at the defects in the prior art so as to solve the problems of low service processing efficiency and lower service processing performance caused by empty query in the prior art.
In order to achieve the above purpose, the technical solution adopted in the embodiment of the present application is as follows:
in a first aspect, an embodiment of the present application provides a service result query method of an ethernet alliance chain, including:
acquiring a service identifier to be queried;
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 chain node of the Ethernet 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 chain node of the Ethernet alliance chain is the maximum block identifier corresponding to the service result of the local cache of the client.
Optionally, the method further comprises:
if the block identifier corresponding to the service identifier to be queried is larger than the first block identifier of the chain node of the Ethernet alliance chain, storing the service result in the chain link point database of the Ethernet alliance chain to the local cache of the client according to the second block identifier of the chain node of the Ethernet alliance chain, wherein the second block identifier of the chain node of the Ethernet alliance chain is the maximum block identifier on the current chain node;
and acquiring a service result corresponding to the service identifier to be queried from the local cache of the client according to the service identifier to be queried.
Optionally, the storing, according to the second block identifier of the chain node of the ethernet alliance chain, the service result in the link point database of the ethernet alliance chain to the local cache of the client includes:
acquiring a service result list corresponding to a plurality of blocks between the first block identifier of the chain link point and the second block identifier of the chain node from a chain link point database of the Ethernet alliance chain according to the first block identifier of the chain node of the Ethernet alliance chain and the second block identifier of the chain node of the Ethernet alliance chain;
traversing the service result list, obtaining a service result and storing the service result in a local cache of the client.
Optionally, the traversing the service result list, obtaining a service result and saving the service result to the local cache of the client, includes:
traversing the service result list to obtain mapping relations between a plurality of groups of service identifiers and service results recorded in the service result list;
and storing a plurality of groups of mapping relations between the service identifiers and the service results 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 queried from a local cache of the client according to the service identifier to be queried and the mapping relation between the service identifier and the service result.
Optionally, the mapping relation between the service identifier and the service result is represented by a key value pair;
the obtaining the service result corresponding to the service identifier to be queried from the local cache of the client according to the service identifier to be queried and the mapping relation between the service identifier and the service result comprises the following steps:
and according to the service identifier to be queried, reading a service result corresponding to the service identifier to be queried from a plurality of key value pairs stored in the local cache of the client.
Optionally, the obtaining the service identifier to be queried includes:
sending a service request to a chain link of the Ethernet alliance chain;
receiving a service identifier returned by the chain link point of the Ethernet alliance chain according to the service request;
and taking the service identifier as the service identifier to be queried.
In a second aspect, an embodiment of the present application further provides a service result query device 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 the service identifier to be queried;
and the second acquisition module is used for acquiring the service result corresponding to the service identifier to be queried from the local cache of the client if the block identifier corresponding to the service identifier to be queried is smaller than or equal to the first block identifier of the chain node of the Ethernet alliance chain, wherein the first block identifier of the chain node of the Ethernet alliance chain is the maximum block identifier corresponding to the service result of the local cache of the client.
Optionally, the apparatus further comprises: a cache module;
the cache module is configured to store, 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 ethernet alliance chain, a service result in a link point database of the ethernet alliance chain to a local cache of the client according to the second block identifier of the chain node of the ethernet alliance chain, where the second block identifier of the chain node of the ethernet alliance chain is the maximum block identifier on the 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 a link point database of the ethernet alliance chain, a service result list corresponding to a plurality of blocks located between the first block identifier of the link point and the second block identifier of the link node according to the first block identifier of the link node of the ethernet alliance chain and the second block identifier of the link node of the ethernet alliance chain; traversing the service result list, obtaining a service result and storing the service result in a local cache of the client.
Optionally, the buffer module is specifically configured to traverse the service result list and obtain mapping relationships between multiple groups of service identifiers and service results recorded in the service result list; and storing a plurality of groups of mapping relations between the service identifiers and the service results to a local cache of the client.
Optionally, the second obtaining module is specifically configured to obtain, from the 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 relation between the service identifier and the service result is represented by a key value pair;
The second obtaining module is specifically configured to read, according to the service identifier to be queried, 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 point of the ethernet alliance chain; receiving a service identifier returned by the chain link point of the Ethernet alliance chain according to the service request; and taking the service identifier as the service identifier to be queried.
In a third aspect, embodiments of the present application provide a client device, including: the system comprises a processor, a storage medium and a bus, wherein the storage medium stores machine-readable instructions executable by the processor, when the client device runs, the processor communicates with the storage medium through the bus, and the processor executes the machine-readable instructions to execute the steps of the service result query method of the Ethernet alliance chain as provided in the first aspect.
In a fourth aspect, embodiments of the present application provide a storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of the business result query method of the ethernet alliance chain as provided in the first aspect.
The beneficial effects of this application are:
the application provides a service result query method, device, equipment and medium of an Ethernet alliance chain, wherein the method comprises the following steps: acquiring a service identifier to be queried; 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 chain node of the Ethernet alliance chain, acquiring a service result corresponding to the service identifier to be queried from the local cache of the client, wherein the first block identifier of the chain node of the Ethernet alliance chain is the maximum block identifier corresponding to the service result locally cached by the client. In the scheme, the service result corresponding to the service identifier to be queried is obtained from the local cache of the client according to the service identifier to be queried, and the query of the service result is converted from the link point of the Ethernet alliance chain to the local cache of the client, so that the blank query caused by the fact that the packing rate of the block is smaller than the initiation rate of the service request when the service result query is performed 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 list of each block stored in the link point database can be ensured to be acquired, data omission is avoided, and the service data result in the local cache of the client is more comprehensive. And when the block identifier corresponding to the service identifier to be identified is larger than the first block identifier, triggering to acquire a new maximum block identifier (second block identifier) again, acquiring a new service result from the database of the chain node and storing the new service result into the local cache of the client, and effectively reducing the number of times of data acquisition from the chain node database while ensuring that the service result acquired from the chain node database is more comprehensive, thereby improving the service processing performance.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the embodiments will be briefly described below, it being understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered limiting the scope, and that other related drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flow chart of a business result query method of an ethernet alliance chain according to an embodiment of the present application;
fig. 2 is a flow chart of another business result query method of an ethernet alliance chain according to an embodiment of the present application;
fig. 3 is a flow chart of a business result query method of another ethernet alliance chain according to an embodiment of the present application;
fig. 4 is a flow chart of another business result query method of an ethernet alliance chain according to an embodiment of the present application;
fig. 5 is a flow chart of a business result query method of another ethernet 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 a business result query device of another 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
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present application more clear, the technical solutions of the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application, and it should be understood that the accompanying drawings in the present application are only for the purpose of illustration and description, and are not intended to limit the protection scope of the present application. In addition, it should be understood that the schematic drawings are not drawn to scale. A flowchart, as used in this application, illustrates operations implemented according to some embodiments of the present application. It should be understood that the operations of the flow diagrams may be implemented out of order and that steps without logical context may be performed in reverse order or concurrently. Moreover, one or more other operations may be added to the flow diagrams and one or more operations may be removed from the flow diagrams as directed by those skilled in the art.
In addition, the described embodiments are only some, but not all, of the embodiments of the present application. The components of the embodiments of the present application, which are generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present application, as provided in the accompanying drawings, is not intended to limit the scope of the application, as claimed, but is merely representative of selected embodiments of the application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present application without making any inventive effort, are intended to be within the scope of the present application.
To enable one skilled in the art to use the present disclosure, the following embodiments are presented in connection with a specific application scenario "ethernet alliance chain". It will be apparent to those having ordinary skill 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 present application.
It should be noted that the term "comprising" will be used in the embodiments of the present application to indicate the presence of the features stated hereinafter, but not to exclude the addition of other features.
Before developing a specific description of the technical solution provided in the present application, a brief description is given of some terms related to the present application:
1. ethernet: ethernet (ethernet) is an open source, intelligent contract-enabled public blockchain platform through which dedicated cryptocurrency Ethernet (ETH) provides a decentralised EVM (Ethereum Virtual Machine, ethernet virtual machine) to handle point-to-point contracts.
2. Alliance chain: a federated chain remains a private chain in nature, except that it is larger than a private chain developed by a single small organization, but not as large as a public chain, and is understood to be a blockchain that is intermediate between the private and public chains.
The generation of each block is determined by all preselected nodes together, and other access nodes can participate in the transaction, but no accounting process is performed, and other third parties can perform limited inquiry through the open API of the blockchain. For better performance, the federation chain has certain requirements for the configuration of consensus or authentication nodes and the network environment. With the admission mechanism, transaction performance can be improved more easily, and problems caused by participants with irregular participation are avoided.
3. Block identification (block height): the blockchain stores transaction data together as one block over a period of time. The block is connected to the preceding and following blocks in time sequence. Thus, the blockchains are linked together from beginning to end. Considering that this is a vertical stack, for block numbers, the unit representing the height is called "block high", i.e. block identification, for uniquely distinguishing between different blocks.
4. Empty query: the out-block time of the chain node is about one second, assuming that under normal conditions, the packed transaction amount of one block is 1000, and the time interval at which the client periodically polls the chain node for the transaction result is 1s. When the client initiates more transactions per second to the link point, it is assumed to be 3000. The client obtains a transaction result (transaction) of one transaction (transaction) by means of timing polling, that is, two thousands of transactions which are not packaged cannot obtain the transaction result according to the transaction identifier (transaction hash) of the client after one second, and the blank inquiry is performed.
5. And (3) block discharging: the block is packaged, the link point executes the packaged transaction through the EVM, and the block consensus is successful.
The following is a brief description of the relevant background to which the present application relates:
currently, the service result query of the ethernet architecture alliance chain initiates a transaction request (service request) to the link point through the client (wed 3 sdk). When the link point receives a transaction request initiated by the client, it returns a unique identification of the transaction request: and (5) transaction identification. And then, the client side sends a transaction result inquiry request to the link point again through the transaction identifier returned by the link point, namely, obtains the transaction result. There are two communication protocols between the client and the link point, one is through http (HyperText Transfer Protocol ), and the other is rpc (Remote Procedure Call, remote procedure call), both of which are provided internally. On the one hand, it is known that the link points will be timed out of the block (substantially all within 1 second). In addition, the number of block-per-second packed transactions is approximately equivalent to tps of transactions (Transactions Per Second, the number of transactions transmitted per second). In other words, a transaction is considered successful in execution only after being blocked and consensus is successful, and a corresponding list of transaction results is generated. Since the client does not know when the link point can complete the corresponding transaction execution and generates the transaction result list, the current practice of the client is to initiate a transaction result query request to the link point at the transaction identification timing (per second) until the link point returns the transaction result list.
As mentioned above, the client initiates a transaction result query request to the link point at the transaction identifier timing, which results in a large number of null queries. The empty query can cause the execution speed of the transaction to be slower and slower along with the increase of the data quantity in the chain node database, so that the link point packing transaction number is reduced linearly, namely the transaction processing performance is reduced linearly.
Here again, parsing a blank query may lead to a decrease in performance of the transaction. The data generated during the chunking process (e.g., transaction results, etc.) is stored in a level db (high performance key-value database) storage engine, i.e., a link point database. Over time, the more blocks the consensus is completed, the more data is stored, and after the data reaches tens, billions and billions, an empty query can cause the leveldb to generate a behavior of scanning all records once, and the larger the data volume, the longer the time for scanning all records can be, so that the performance of reading requests from the leveldb is slower and slower. Whereas EVM execution transactions require a read operation that relies on leveldb, which in turn results in slower and slower execution of transactions by EVM and reduced performance of transaction execution.
The core of the technical scheme provided by the application is as follows: the corresponding service result list is pulled from the chain link point database through the inquiry of the highest block height of the chain node, and the service identification and the service result contained in the service result list are stored in the local cache of the client, so that the inquiry can be directly carried out from the local cache of the client when the service result inquiry is carried out according to the service identification, and the problem of service processing performance degradation caused by empty inquiry is effectively avoided.
In the following, the implementation principle and the generated beneficial effects of the service result query method of the ethernet alliance chain provided in the present application will be described through a plurality of specific embodiments.
Fig. 1 is a flow chart of a business result query method of an ethernet alliance chain according to an embodiment of the present application; the method may be performed by a client, which may be a device in communication with the link points of the chain of ethernet alliance. The Ethernet alliance chain can comprise a plurality of chain nodes, the client can initiate service requests to any chain link point, and after the chain link point receives the service requests, the chain link point can return service identifiers corresponding to the service requests to the client, so that the client can inquire corresponding service results from the chain nodes according to the service identifiers. As shown in fig. 1, the method may include:
S101, acquiring a service identifier to be queried.
Optionally, the business described in this embodiment refers to the transaction described in the foregoing background description, and it is understood that the transaction described in the blockchain is not a specific funds transaction, and is understood to be a data interaction in a broad sense. That is, the service in this embodiment may not be limited to the fund interaction, but may be other data interactions.
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 back the service identifier 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 queried is smaller than or equal to the first block identifier of the chain node of the Ethernet alliance chain, acquiring a service result corresponding to the service identifier to be queried from the local cache of the client, wherein the first block identifier of the chain node of the Ethernet 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 point packages the service request into blocks in sequence and performs consensus, and after the consensus is passed, the service request in the blocks is delivered to the ethernet virtual machine to perform processing, and finally, the blocks (out blocks) are generated according to the processing result, and the obtained processing result (service result) is stored in the link point database.
Each service identifier acquired by the client corresponds to one block, wherein the blocks corresponding to different service identifiers can 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. I.e. a many-to-one relationship between traffic identities and tiles.
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, in a certain period of time, the service result stored in the local cache is fixed, and the maximum block identifier in the block identifiers corresponding to the service result may be the first block identifier of the chain node of the ethernet alliance chain. When the service result query is executed, the query is continuously increased 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 smaller than or equal to the maximum block identifier corresponding to the service result locally cached by the client, the service result corresponding to the service identifier to be queried can be obtained from the local cache of the client through the service identifier to be queried.
In one implementation manner, a plurality of service results stored in a local cache of a client can be traversed through a 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 be obtained directly from a plurality of service results stored in the local cache of the client through the service identifier to be queried.
Optionally, whether the local cache of the client is traversed or the service result is directly obtained from the local cache of the client, compared with the prior art, the method converts the service result obtained from the link point of the Ethernet alliance chain into the service result obtained from the local cache of the client, thereby effectively avoiding the problem of service processing efficiency reduction caused by empty query and effectively improving service processing performance.
In summary, this embodiment provides a service result query method for an ethernet alliance chain, including: acquiring a service identifier to be queried; 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 chain node of the Ethernet alliance chain, acquiring a service result corresponding to the service identifier to be queried from the local cache of the client, wherein the first block identifier of the chain node of the Ethernet alliance chain is the maximum block identifier corresponding to the service result locally cached by the client. In the scheme, the service result corresponding to the service identifier to be queried is obtained from the local cache of the client according to the service identifier to be queried, and the query of the service result is converted from the link point of the Ethernet alliance chain to the local cache of the client, so that the blank query caused by the fact that the packing rate of the block is smaller than the initiation rate of the service request when the service result query is performed in the database of the link point is effectively avoided, and the service processing performance is effectively improved.
Fig. 2 is a flow chart of another business result query method of an ethernet 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 queried is larger than the first block identifier of the chain node of the Ethernet alliance chain, storing the service result in the chain link point database of the Ethernet alliance chain to the local cache of the client according to the second block identifier of the chain node of the Ethernet alliance chain, wherein the second block identifier of the chain node of the Ethernet alliance chain is the maximum block identifier on the current chain node.
In this embodiment, an explanation is given on how to obtain a service result from a link point database of the ethernet alliance chain and store the service result in a local cache of the client.
It should be noted that, the blocks in the blockchain are blocked according to the way of self-increasing of the block identifier (block height), and when the block identifier n is successfully blocked, that is, the service request packed by the block n is executed, a corresponding service result list is generated. The service result list is stored in the link point data base, and the service result list comprises service identifiers and service results. Because the chain node continuously receives new service requests and executes the service requests, the chain node continuously outputs blocks according to the self-increasing mode of the block identification.
Optionally, during the initialization of the client system, the first block identifier of the current chain node, that is, the maximum block identifier of the current chain node, may be obtained through a query interface getbllocknum () provided by the link point of the ethernet alliance chain, for example: the current chain node has already gone out of blocks 5, i.e. goes out of blocks to block 5, then the maximum block identification of the current chain node is block 5.
Optionally, the service result list of the block identified by the first block identifier and the plurality of block identifiers before the first block identifier may be obtained from the link point database by using the obtained first block identifier of the current link node, and the service result stored in the service result list is stored in the local cache of the client.
When the block identifier corresponding to the service identifier to be queried is larger than the first block identifier, since the service result contained in the new block is not stored in the local cache of the client, at this time, the corresponding service result is not queried from the local cache of the client through the service identifier to be queried, and then the maximum block identifier of the current chain node, namely the second block identifier, needs to be re-acquired, and new service result data is acquired from the link point database according to the second block identifier and is stored in the local cache of the client, so that the query effectiveness is ensured.
It should be noted that, in the first block identifier and the second block identifier, the first block identifier and the second block identifier are only used for distinguishing the maximum block identifier acquired in two adjacent times, and when the first block identifier is the maximum block identifier of the current chain node, the second block identifier is the maximum block identifier of the link point acquired next time, which corresponds to the first block identifier.
For example: when initializing, the maximum block identifier of the current chain node is 5, and the service result list corresponding to the block 1-block 5 can be obtained from the chain link point database according to the maximum block identifier 5, so that the service result contained in the service result list is stored in the local cache of the client. And simultaneously, the client 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 identifiers 1-5 to be queried correspond to the block 1, the service identifiers 6-10 to be queried correspond to the block 2, and the like, so that the service result query is sequentially performed. 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 local cache of the client does not store the service result corresponding to the block 6, at this time, the getlocknum () provided by the link point itself again can be triggered to obtain the maximum block identifier of the current link node, and assuming that the maximum block identifier of the current link node is 8, then new service result data can be obtained from the link point database according to the maximum block identifier of the current link node according to the method, and stored into the local cache of the client, thus being circularly executed.
Exemplary codes involved in this embodiment are provided as follows:
s202, according to the service identification to be queried, acquiring a service result corresponding to the service identification to be queried 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, without obtaining the corresponding service result from the link point database by traversing the query according to the service identifier to be queried as in the prior art, thereby avoiding the problem of service processing performance reduction caused by empty query.
Optionally, how to obtain the corresponding service result from the local cache of the client according to the service identifier to be queried can be understood with reference to the following specific embodiments.
Fig. 3 is a flow chart of a business result query method of another ethernet alliance chain according to an embodiment of the present application; optionally, as shown in fig. 3, in step S201, storing, according to the second block identifier of the chain node of the ethernet alliance chain, the service result in the link point database of the ethernet alliance chain to the local cache of the client may include:
S301, acquiring a service result list corresponding to a plurality of blocks between the first block identifier of the chain node and the second block identifier of the chain node from a chain link point database of the Ethernet alliance chain according to the first block identifier of the chain node of the Ethernet alliance chain and the second block identifier of the chain node of the Ethernet alliance chain.
Optionally, when the service result list corresponding to the plurality of blocks between the first block identifier of the chain node and the second block identifier of the chain node is acquired, the service result list corresponding to the first block identifier is not included because the service result list corresponding to the first block identifier has already been acquired.
Optionally, when initializing the client, only the maximum block identifier of the current chain node can be obtained, and then, according to the current maximum block identifier, a service result list corresponding to a plurality of blocks between the minimum block identifier and the maximum block identifier is obtained.
For example: when the client is initialized, the obtained maximum block identifier of the current chain node is 5, and the obtained minimum block identifier of the chain node is 1, and a service result list corresponding to the block 1-block 5 can be obtained from the chain 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 chain node can be obtained again, and if the block identifier is 8, the service result list corresponding to the block 6-block 8 can be obtained from the chain link point data base. And so on, when the maximum block identifier of the next acquired chain node is 12, the service result list corresponding to the block 7-block 12 can be acquired from the chain link point data base.
Optionally, by acquiring a plurality of service result lists corresponding to a plurality of blocks 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 point database can be acquired, data omission is avoided, and service data results in a local cache of the client are more comprehensive. In addition, when the block identifier corresponding to the service identifier to be identified is larger than the first block identifier, triggering to acquire a new maximum block identifier (second block identifier) again, acquiring a new service result from a database of the chain node and storing the new service result into a local cache of the client, and effectively reducing the number of times of data acquisition from the chain node database while ensuring that the service result acquired from the chain node database is more comprehensive, thereby improving service processing performance.
S302, traversing the service result list, obtaining the service result and storing the service result in a local cache of the client.
In some embodiments, the service result list may include related data of 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 it may be avoided that too much data unrelated to the service result is stored in the local cache of the client, so as to reduce the data volume in the local cache of the client.
Fig. 4 is a flow chart of another business result query method of an ethernet 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 saving the service result to the local cache of the client may include:
s401, traversing the service result list, and obtaining the mapping relation between a plurality of groups of service identifiers 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, each service result list includes a plurality of service results and service identifiers corresponding to each service result, and the mapping relationship between the service results and the plurality of groups of service identifiers 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 obtained mapping relationship between the 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 the step S202, according to the service identifier to be queried, the obtaining, from the local cache of the client, the service result corresponding to the service identifier to be queried may include: and acquiring the service result corresponding to the service identifier to be queried from the local cache of the client according to the service identifier to be queried and the mapping relation between the service identifier and the service result.
Optionally, service identifier matching may be performed in a local cache of the client according to the service identifier to be queried, and a service result mapped by the service identifier obtained by matching is used as a service result corresponding to the service identifier to be queried.
Optionally, in the step S401, the mapping relationship between the service identifier and the service result is represented by a key value pair. According to the service identifier to be queried and the mapping relation between the service identifier and the service result, acquiring the service result corresponding to the service identifier to be queried from the local cache of the client side can comprise: and reading the service result corresponding to the service identifier to be queried from a plurality of key value pairs stored in the local cache of the client according to the service identifier to be queried.
In some embodiments, the mapping between the service identifier and the service result may be represented in the form of key-value pairs, i.e.: service identification: and the service result can be stored in the form of key value pairs when the mapping relation between the service identifier and the service result is stored in the local cache of the client. And 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 and the service identifier in each key value pair can be matched, 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 mapping relationship is recorded by two rows and two columns of tables, where the first column represents the service identifier and the second column represents the service result, and when the service result is queried by 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, and the service result corresponding to the service identifier to be queried is obtained.
Of course, in practical application, the mapping relationship between the service identifier and the service result may not be limited to the above-listed representation forms, which is not specifically limited in the present application.
Fig. 5 is a flow chart of a business result query method of another ethernet alliance chain according to an embodiment of the present application; optionally, as shown in fig. 5, in step S101, acquiring the service identifier to be queried may include:
s501, sending a service request to a chain link of the Ethernet alliance chain.
S502, receiving a service identifier returned by the chain link point of the Ethernet alliance chain according to the service request.
S503, using the service identifier as the service identifier to be queried.
Optionally, the specific method for obtaining the service identifier to be queried has been described in detail in the foregoing embodiments, which are not described in detail herein, and can be understood by referring to the foregoing explanation.
In summary, an embodiment of the present application provides a service result query method of an ethernet alliance chain, including: acquiring a service identifier to be queried; 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 chain node of the Ethernet alliance chain, acquiring a service result corresponding to the service identifier to be queried from the local cache of the client, wherein the first block identifier of the chain node of the Ethernet alliance chain is the maximum block identifier corresponding to the service result locally cached by the client. In the scheme, the service result corresponding to the service identifier to be queried is obtained from the local cache of the client according to the service identifier to be queried, and the query of the service result is converted from the link point of the Ethernet alliance chain to the local cache of the client, so that the blank query caused by the fact that the packing rate of the block is smaller than the initiation rate of the service request when the service result query is performed 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 list of each block stored in the link point database can be ensured to be acquired, data omission is avoided, and the service data result in the local cache of the client is more comprehensive. And when the block identifier corresponding to the service identifier to be identified is larger than the first block identifier, triggering to acquire a new maximum block identifier (second block identifier) again, acquiring a new service result from the database of the chain node and storing the new service result into the local cache of the client, and effectively reducing the number of times of data acquisition from the chain node database while ensuring that the service result acquired from the chain node database is more comprehensive, thereby improving the service processing performance.
The following describes a device, equipment, a storage medium, etc. for executing the service result query method of the ethernet alliance chain provided in the present application, and specific implementation processes and technical effects of the device and the equipment are referred to above, which are not described in detail below.
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, where a function implemented by the service result query device of the ethernet alliance chain corresponds to a step executed by the method described above. The device may be understood as the above-mentioned client, or a processor of the client, or may be understood as a component that implements the functions of the present application under the control of the client, independent of the above-mentioned client or processor, and optionally, as shown in fig. 6, the service result query device of the ethernet alliance chain includes: a first acquisition module 601 and a second acquisition module 602;
A first obtaining module 601, configured to obtain a service identifier to be queried;
the second obtaining module 602 is configured to obtain, from the local cache of the client, a service result corresponding to the service identifier to be queried, where the first block identifier of the chain node of the ethernet alliance chain is a maximum block identifier corresponding to the service result locally cached by the client, if the block identifier corresponding to the service identifier to be queried is less than or equal to the first block identifier of the chain node of the ethernet alliance chain.
Optionally, as shown in fig. 7, the apparatus further includes: a cache module 603;
the caching module 603 is configured to store, according to a second block identifier of a chain node of the ethernet alliance chain, a service result in a link point database of the ethernet alliance chain to a local cache of the client, where the second block identifier of the chain node of the ethernet alliance chain is a maximum block identifier on a current chain node, if a block identifier corresponding to the service identifier to be queried is greater than the first block identifier of the chain node of the ethernet alliance chain;
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 caching module 603 is specifically configured to obtain, from a link point database of the ethernet alliance chain, a service result list corresponding to a plurality of blocks located between the first block identifier of the chain node and the second block identifier of the chain node according to the first block identifier of the chain node of the ethernet alliance chain and the second block identifier of the chain node of the ethernet alliance chain; traversing the service result list, obtaining the service result and storing the service result in a local cache of the client.
Optionally, the buffer module 603 is specifically configured to traverse the service result list, and obtain mapping relationships between multiple 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, from the 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 relation between the service identifier and the service result is represented by a key value pair;
the second obtaining module 602 is specifically configured to read, according to the service identifier to be queried, 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 of the ethernet alliance chain; receiving a service identifier returned by a chain link point of the Ethernet alliance chain according to the service request; and taking the service identifier as the service identifier to be queried.
The foregoing apparatus is used for executing the method provided in the foregoing embodiment, and its implementation principle and technical effects are similar, and are not described herein again.
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 (Application Specific Integrated Circuit, abbreviated as ASIC), or one or more microprocessors (digital singnal processor, abbreviated as DSP), or one or more field programmable gate arrays (Field Programmable Gate Array, abbreviated as FPGA), or the like. For another example, when a module above 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 (Central Processing Unit, CPU) or other processor that may invoke the program code. For another example, the modules may be integrated together and implemented in the form of a system-on-a-chip (SOC).
The modules may be connected or communicate with each other via wired or wireless connections. The wired connection may include a metal cable, optical cable, hybrid cable, or the like, or any combination thereof. The wireless connection may include a connection through a LAN, WAN, bluetooth, zigBee, or NFC, 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 will be clearly understood by those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described system and apparatus may refer to corresponding procedures in the method embodiments, which are not described in detail in this application.
It should be noted that these above modules may be one or more integrated circuits configured to implement the above methods, for example: one or more application specific integrated circuits (Application Specific Integrated Circuit, abbreviated as ASIC), or one or more microprocessors (Digital Singnal Processor, abbreviated as DSP), or one or more field programmable gate arrays (Field Programmable Gate Array, abbreviated as FPGA), or the like. For another example, when a module above 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 (Central Processing Unit, CPU) or other processor that may invoke the 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 according to an embodiment of the present application, optionally, as shown in fig. 8, the device may include: a processor 801, and a memory 802.
The memory 802 is used for storing a program, and the processor 801 calls the program stored in the memory 802 to execute the above-described method embodiment. The specific implementation manner and the technical effect are similar, and are not repeated here.
Therein, the memory 802 stores program code that, when executed by the processor 801, causes the processor 801 to perform various steps in the business result query method of the ethernet alliance chain according to various exemplary embodiments of the present application described in the above section of the present description.
The processor 801 may be a general purpose processor such as a Central Processing Unit (CPU), digital signal processor (Digital Signal Processor, DSP), application specific integrated circuit (Application Specific Integrated Circuit, ASIC), field programmable gate array (Field Programmable Gate Array, FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, and may implement or perform the methods, steps, and logic blocks disclosed in embodiments of the present application. The 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 embodied directly in a hardware processor for execution, or in a combination of hardware and software modules in the processor for execution.
Optionally, the present application also provides a program product, such as a computer readable storage medium, comprising a program for performing the above-described method embodiments when being executed by a processor.
In the several embodiments provided in this application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown 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 may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in hardware plus software functional units.
The integrated units implemented in the form of software functional units described above may be stored in a computer readable storage medium. The software functional unit 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, etc.) or a processor (english: processor) to perform part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: u disk, mobile hard disk, read-Only Memory (ROM), random access Memory (Random Access Memory, RAM), magnetic disk or optical disk, etc.
Claims (8)
1. The service result query method of the Ethernet alliance chain is characterized by comprising the following steps of:
Acquiring a service identifier to be queried;
if the block identifier corresponding to the service identifier to be queried is smaller than or equal to the first block identifier of the chain node of the Ethernet alliance chain, acquiring a service result corresponding to the service identifier to be queried from a local cache of a client, wherein the first block identifier of the chain node of the Ethernet alliance chain is the maximum block identifier corresponding to the service result of the local cache of the client;
the method further comprises the steps of:
if the block identifier corresponding to the service identifier to be queried is larger than the first block identifier of the chain node of the Ethernet alliance chain, storing the service result in the chain link point database of the Ethernet alliance chain to the local cache of the client according to the second block identifier of the chain node of the Ethernet alliance chain, wherein the second block identifier of the chain node of the Ethernet alliance chain is the maximum block identifier on the current chain node;
according to the service identifier to be queried, acquiring a service result corresponding to the service identifier to be queried from a local cache of the client;
the storing, according to the second block identifier of the chain node of the ethernet alliance chain, the service result in the chain link point database of the ethernet alliance chain to the local cache of the client, includes:
Acquiring a service result list corresponding to a plurality of blocks between the first block identifier of the chain link point and the second block identifier of the chain node from a chain link point database of the Ethernet alliance chain according to the first block identifier of the chain node of the Ethernet alliance chain and the second block identifier of the chain node of the Ethernet alliance chain;
traversing the service result list, obtaining a service result and storing the service result in a local cache of the client.
2. The method of claim 1, wherein traversing the business result list, obtaining business results and saving to the local cache of the client comprises:
traversing the service result list to obtain mapping relations between a plurality of groups of service identifiers and service results recorded in the service result list;
and storing a plurality of groups of mapping relations between the service identifiers and the service results to a local cache of the client.
3. The method according to claim 1 or 2, wherein the obtaining, according to the service identifier to be queried, the service result corresponding to the service identifier to be queried from the local cache of the client includes:
and acquiring 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 relation between the service identifier and the service result.
4. A method according to claim 3, wherein the mapping relationship between the service identifier and the service result is represented by a key value pair;
the obtaining the service result corresponding to the service identifier to be queried from the local cache of the client according to the service identifier to be queried and the mapping relation between the service identifier and the service result comprises the following steps:
and according to the service identifier to be queried, reading a service result corresponding to the service identifier to be queried from a plurality of key value pairs stored in the local cache of the client.
5. The method of claim 1, wherein the obtaining the service identifier to be queried comprises:
sending a service request to a chain link of the Ethernet alliance chain;
receiving a service identifier returned by the chain link point of the Ethernet alliance chain according to the service request;
and taking the service identifier as the service identifier to be queried.
6. A business result query device of an ethernet alliance chain, comprising: the device comprises a first acquisition module and a second acquisition module;
the first acquisition module is used for acquiring the service identifier to be queried;
the second obtaining module is configured to obtain, from a local cache of a 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 a first block identifier of a chain node of an ethernet alliance chain, where the first block identifier of the chain node of the ethernet alliance chain is a maximum block identifier corresponding to the service result of the local cache of the client;
The apparatus further comprises: a cache module;
the cache module is configured to store, 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 ethernet alliance chain, a service result in a link point database of the ethernet alliance chain to a local cache of the client according to the second block identifier of the chain node of the ethernet alliance chain, where the second block identifier of the chain node of the ethernet alliance chain is the maximum block identifier on the 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;
the cache module is specifically configured to obtain, from a link point database of the ethernet alliance chain, a service result list corresponding to a plurality of blocks located between the first block identifier of the link point and the second block identifier of the link node according to the first block identifier of the link node of the ethernet alliance chain and the second block identifier of the link node of the ethernet alliance chain; traversing the service result list, obtaining a service result and storing the service result in a local cache of the client.
7. A client device, comprising: the method comprises a processor, a storage medium and a bus, wherein the storage medium stores program instructions executable by the processor, when a client device runs, the processor and the storage medium are communicated through the bus, and the processor executes the program instructions to execute the steps of the service result query method of the Ethernet alliance chain according to any one of claims 1 to 5.
8. A computer readable storage medium, wherein a computer program is stored on the storage medium, which when executed by a processor performs the steps of the business result query method of the ethernet alliance chain according to any of claims 1 to 5.
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 CN112612816A (en) | 2021-04-06 |
| CN112612816B true 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) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113807968B (en) * | 2021-09-22 | 2024-02-23 | 网易（杭州）网络有限公司 | Block chain user request processing method and device, entrusting server and storage medium |
| CN115314530B (en) * | 2022-06-30 | 2024-01-05 | 中国第一汽车股份有限公司 | Information processing method and device and vehicle |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019100991A1 (en) * | 2017-11-27 | 2019-05-31 | 北京京东金融科技控股有限公司 | Information processing method, device and system, storage medium, and electronic device |
| CN110162543A (en) * | 2019-05-29 | 2019-08-23 | 北京奇艺世纪科技有限公司 | A kind of information query method and device |
| WO2020035090A2 (en) * | 2019-11-08 | 2020-02-20 | Alipay (Hangzhou) Information Technology Co., Ltd. | Lightweight decentralized application platform |
| 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 |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10176481B2 (en) * | 2015-12-21 | 2019-01-08 | Beston Technologies Pty Ltd | Method and apparatus for managing and providing provenance of product using blockchain |
| CN110009510A (en) * | 2019-01-22 | 2019-07-12 | 阿里巴巴集团控股有限公司 | Transaction processing system, method, calculating equipment and storage medium based on block chain |
| CN110753084B (en) * | 2019-09-06 | 2023-04-07 | 平安普惠企业管理有限公司 | Uplink data reading method, cache server and computer readable storage medium |
| CN110597835B (en) * | 2019-09-17 | 2024-02-27 | 深圳前海微众银行股份有限公司 | Transaction data deleting method and device based on blockchain |
| CN110830581B (en) * | 2019-11-12 | 2022-11-22 | 金蝶软件（中国）有限公司 | 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 |
-
2020
- 2020-12-01 CN CN202011413141.8A patent/CN112612816B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019100991A1 (en) * | 2017-11-27 | 2019-05-31 | 北京京东金融科技控股有限公司 | Information processing method, device and system, storage medium, and electronic device |
| 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 |
| WO2020035090A2 (en) * | 2019-11-08 | 2020-02-20 | Alipay (Hangzhou) Information Technology Co., Ltd. | Lightweight decentralized application platform |
| CN111488349A (en) * | 2020-04-08 | 2020-08-04 | 北京瑞策科技有限公司 | Data query method and device based on service data block chain |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112612816A (en) | 2021-04-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2019114128A1 (en) | Block chain transaction block processing method, electronic device and readable storage medium | |
| CN112612816B (en) | Service result query method, device, equipment and medium of Ethernet alliance chain | |
| CN111274252B (en) | Block chain data uplink method and device, storage medium and server | |
| EP2898655B1 (en) | System and method for small batching processing of usage requests | |
| CN104125163B (en) | Data processing method and device and terminal | |
| EP4300323A1 (en) | Data processing method and apparatus for blockchain network, computer device, computer readable storage medium, and computer program product | |
| WO2016134590A1 (en) | Transaction processing method, processing node, central node and cluster | |
| WO2020177536A1 (en) | Transaction deduplication method, transaction construction method, device and storage medium | |
| US20190042100A1 (en) | Apparatus and methods for a distributed memory system including memory nodes | |
| CN111159219B (en) | Data management method, device, server and storage medium | |
| CN102710763A (en) | Method and system for pooling, slicing and fault transfer of distributed cache | |
| CN114398520A (en) | Data retrieval method, system, device, electronic equipment and storage medium | |
| US7933962B1 (en) | Reducing reliance on a central data store while maintaining idempotency in a multi-client, multi-server environment | |
| CN101753561B (en) | Business cluster processing method and cluster system | |
| CN109660589B (en) | Request processing method and device and electronic equipment | |
| CN111209263A (en) | Data storage method, device, equipment and storage medium | |
| CN107277088B (en) | High-concurrency service request processing system and method | |
| CN114238500A (en) | Block chain transaction storage method and device, electronic equipment and readable storage medium | |
| EP2732576A1 (en) | Variable-length nonce generation | |
| CN113744013A (en) | Order number generation method, device, server and storage medium | |
| CN116302178B (en) | Acceleration processing method and device for column storage data | |
| CN118075059B (en) | Gateway execution method, device and equipment based on MySQL protocol | |
| CN113507464B (en) | Data access method, device, equipment and storage medium based on virtual equipment | |
| CN108762666B (en) | Access method, system, medium and device of storage system | |
| CN115640360A (en) | Dynamic compression type distributed data storage method, storage system and device |
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 |