CN118277456B - Initiating node output method in MPP distributed system - Google Patents
Initiating node output method in MPP distributed system Download PDFInfo
- Publication number
- CN118277456B CN118277456B CN202410704629.8A CN202410704629A CN118277456B CN 118277456 B CN118277456 B CN 118277456B CN 202410704629 A CN202410704629 A CN 202410704629A CN 118277456 B CN118277456 B CN 118277456B
- Authority
- CN
- China
- Prior art keywords
- node
- hash
- computing
- computing node
- obtaining
- 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
- 230000000977 initiatory effect Effects 0.000 title claims abstract description 27
- 238000000034 method Methods 0.000 title claims abstract description 26
- 238000013507 mapping Methods 0.000 claims abstract description 27
- 239000011159 matrix material Substances 0.000 claims abstract description 25
- 239000012634 fragment Substances 0.000 claims abstract description 22
- 238000001914 filtration Methods 0.000 claims abstract description 12
- 238000013467 fragmentation Methods 0.000 claims abstract description 8
- 238000006062 fragmentation reaction Methods 0.000 claims abstract description 8
- 238000004364 calculation method Methods 0.000 claims abstract description 6
- 238000012163 sequencing technique Methods 0.000 claims abstract description 4
- 238000007726 management method Methods 0.000 description 17
- 239000000463 material Substances 0.000 description 2
- 101000822425 Arthrobacter sp. (strain KUJ 8602) Guanidinobutyrase Proteins 0.000 description 1
- 230000002159 abnormal effect Effects 0.000 description 1
- 230000005856 abnormality Effects 0.000 description 1
- 238000003491 array Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2471—Distributed queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2255—Hash tables
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
- H04L67/1023—Server selection for load balancing based on a hash applied to IP addresses or costs
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1029—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers using data related to the state of servers by a load balancer
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1061—Peer-to-peer [P2P] networks using node-based peer discovery mechanisms
- H04L67/1065—Discovery involving distributed pre-established resource-based relationships among peers, e.g. based on distributed hash tables [DHT]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- Signal Processing (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Computing Systems (AREA)
- Fuzzy Systems (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Computational Linguistics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides an originating node output method in an MPP distributed system, which relates to the technical field of databases, and comprises the following steps: collecting the number of nodes and the node IP in the database cluster, and sequencing according to the fragmentation information to obtain a first mapping relation of the node fragmentation and the node IP; collecting server information, creating an IP distance matrix of a computing node and a management node, and obtaining the distance matrix; distributing a plurality of hash buckets for each computing node, recording the corresponding relation between the computing node and the hash buckets, and acquiring a second mapping relation between the node fragments and the computing nodes according to nodedatamap table information and the corresponding relation; extracting hash keys in the filtering conditions of the query statement, and obtaining node IP of the computing node according to the hash key query; the distance matrix queries minimum values of the calculation node and the management node according to the node IP query result, and the corresponding node is output as the initiating node.
Description
Technical Field
The invention relates to the technical field of databases, in particular to an originating node output method in an MPP distributed system.
Background
In an MPP distributed system, the system generally comprises a management node and a computing node, wherein the management node is a task initiating node and is responsible for planning and scheduling tasks and receiving data returned from the computing node; the computing node is the node where the data is located, is responsible for executing the task, and returns the data needing to be returned to the initiating node; the originating node acts as a master scheduler and plays an important role.
When the network load is not heavy and the concurrent task number is not high, it seems that which management node is selected as the initiating node of the task is not critical, but in the case of high traffic load, the network bandwidth is extruded, the delay of the communication network crossing the network is high, the network becomes a performance bottleneck easily, thus causing the task backlog, and the scene traffic can not be completed timely, so how to correctly select the initiating node of the task is critical.
In the prior art, when a task initiating node is selected by the DBA, a random selection or sequential selection mode is generally adopted, but the influence of the network on the performance is not considered in the two methods, so that sql cannot operate on the optimal initiating node, and the abnormal performance caused by network bottleneck can possibly cause the influence on the use of users.
Disclosure of Invention
The present invention is directed to solving at least one of the technical problems existing in the related art. To this end, the present invention provides an originating node output method in an MPP distributed system.
The invention provides an originating node output method in an MPP distributed system, which comprises the following steps:
s1: collecting the number of nodes and the node IP in the database cluster, and sequencing according to the fragmentation information to obtain a first mapping relation of the node fragmentation and the node IP;
s2: collecting server information, creating an IP distance matrix of a computing node and a management node according to the server information, and obtaining a distance matrix;
S3: distributing a plurality of hash buckets for each computing node, recording the corresponding relation between the computing node and the hash buckets through a nodedatamap table of a management node, and acquiring a second mapping relation between the node fragments and the computing node according to nodedatamap table information and the corresponding relation;
S4: extracting hash keys in filtering conditions of query sentences, and obtaining node IP of a computing node corresponding to the query sentences according to the hash key query by using the second mapping relation and the first mapping relation to obtain a node IP query result;
s5: and inquiring and obtaining minimum values of the calculation node and the management node according to the node IP inquiry result by the distance matrix, and outputting the node corresponding to the minimum value as an initiating node.
According to the method for outputting the initiating node in the MPP distributed system provided by the invention, the first mapping relation in the step S1 is a one-dimensional array.
According to the method for outputting the initiating node in the MPP distributed system, the distance matrix in the step S2 is a two-dimensional matrix.
According to the method for outputting the initiating node in the MPP distributed system, in the distance matrix, when the IP of the computing node is the same as the IP of the management node, the distance between the computing node and the management node is 0, and when the IP of the computing node is different from the IP of the management node, the distance between the computing node and the management node is 1.
According to the method for outputting the initiating node in the MPP distributed system, in the step S3, when a plurality of hash buckets are distributed for each computing node, the distribution mode is uniformly distributed according to the total number of the hash buckets.
According to the method for outputting the initiating node in the MPP distributed system, the total number of hash buckets is 65536.
According to the method for outputting the originating node in the MPP distributed system provided by the present invention, step S4 further includes:
S41: extracting hash values of the distributed columns in the filtering conditions of the query statement;
s42: calculating according to the hash value to obtain a hash key;
s43: acquiring the fragments of the data corresponding to the query statement according to the hash key by the second mapping relation;
s44: and acquiring the node IP corresponding to the computing node according to the fragments of the data by the first mapping relation, and acquiring a node IP query result.
According to the method for outputting the initiating node in the MPP distributed system, in the step S4, the filtering condition is an accurate query statement containing a where condition exists in an equation distribution column.
The invention provides an originating node output method in MPP distributed system, which is used for solving the problem of network load aggravation caused by incorrect selection when the concurrent pressure is high and the network load is heavy, the method can automatically select the optimal originating node according to the MPP characteristic, the selected initiating node and the computing node are ensured to be the same machine, network overhead is saved, performance abnormality caused by incorrect selection of the initiating node is avoided, user service is completed more quickly, and user experience and use efficiency are improved.
Additional aspects and advantages of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention.
Drawings
In order to more clearly illustrate the invention or the technical solutions of the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described, and it is obvious that the drawings in the description below are some embodiments of the invention, and other drawings can be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flowchart of an output method of an originating node in an MPP distributed system provided by the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the present invention more apparent, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings, and it is apparent that the described embodiments are some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention. The following examples are illustrative of the invention but are not intended to limit the scope of the invention.
In the description of the present specification, a description referring to terms "one embodiment," "some embodiments," "examples," "specific examples," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the embodiments of the present invention. In this specification, schematic representations of the above terms are not necessarily directed to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, the different embodiments or examples described in this specification and the features of the different embodiments or examples may be combined and combined by those skilled in the art without contradiction.
An embodiment of the present invention is described below with reference to fig. 1.
The invention provides an originating node output method in an MPP distributed system, which comprises the following steps:
s1: collecting the number of nodes and the node IP in the database cluster, and sequencing according to the fragmentation information to obtain a first mapping relation of the node fragmentation and the node IP;
The first mapping relationship in step S1 is a one-dimensional array.
In this stage, the mapping relationship between the slices and the ip is first obtained, specifically, the number of nodes and the ip information in the database cluster are obtained, and the sequence is performed according to the slice information, so as to define N columns of one-dimensional arrays a, where N is the number of calculated nodes, and the expression is a [0] =ip1, a [1] =ip … a [ N-1] = ipN.
S2: collecting server information, creating an IP distance matrix of a computing node and a management node according to the server information, and obtaining a distance matrix;
wherein, the distance matrix in step S2 is a two-dimensional matrix.
In the distance matrix, when the IP of the computing node is the same as the IP of the management node, the distance between the computing node and the management node is 0, and when the IP of the computing node is different from the IP of the management node, the distance between the computing node and the management node is 1.
The purpose of this stage is to obtain a distance matrix between the computing node and the initiating node, specifically, firstly, according to server location information or ip information provided by a server administrator, a two-dimensional matrix M of n×n is defined, then, a distance matrix between the computing node and the managing node ip is created, when ip is the same, the distance is 0, and when ip is different, the distance is 1.
S3: distributing a plurality of hash buckets for each computing node, recording the corresponding relation between the computing node and the hash buckets through a nodedatamap table of a management node, and acquiring a second mapping relation between the node fragments and the computing node according to nodedatamap table information and the corresponding relation;
furthermore, the purpose of this stage is to obtain the relation between the fragments and the computing nodes, where N computing nodes of the MPP cluster have id ranges of N1-nN, and 65536/N hash buckets are allocated to each node, and the hash bucket ids are h0-h65535.
And nodedatamap (a system table used for recording the mapping between node fragments and data) in the MPP initiating node records the relation between the fragments and the hash buckets, each node corresponds to a plurality of hash buckets, and then the relation between the fragments and the computing node ip can be obtained through information in nodedatamap.
In step S3, when a plurality of hash buckets are allocated to each computing node, the allocation mode is that the hash buckets are uniformly allocated according to the total number of the hash buckets.
Wherein the total number of hash buckets is 65536.
In some embodiments, the GBase database corresponds to 65536 hash buckets.
S4: extracting hash keys in filtering conditions of query sentences, and obtaining node IP of a computing node corresponding to the query sentences according to the hash key query by using the second mapping relation and the first mapping relation to obtain a node IP query result;
wherein, step S4 further comprises:
S41: extracting hash values of the distributed columns in the filtering conditions of the query statement;
s42: calculating according to the hash value to obtain a hash key;
s43: acquiring the fragments of the data corresponding to the query statement according to the hash key by the second mapping relation;
s44: and acquiring the node IP corresponding to the computing node according to the fragments of the data by the first mapping relation, and acquiring a node IP query result.
Wherein, in step S4, the filtering condition is an accurate query statement containing a where condition and an equation distribution column exists.
In this stage, firstly, the hash value v in the filtering condition in the sql is extracted, the ip of the sql calculation node is determined, specifically, after the sql is obtained, the value v of the hash distribution column in the accurate query filtering condition is found, the sign is that the value v contains the where condition and the distribution column '=', after the value v is found, the crc32 (v)% 65536 is performed to calculate hashkey, wherein the crc is an encryption and decryption algorithm based on the crc checking principle, then the relation between the fragments and hashkey is obtained from nodedatamap information in the step S3, the fragment where the data is located is obtained, and the calculation node ip is obtained according to the mapping relation between the fragments and the ip obtained in the step S1.
S5: and inquiring and obtaining minimum values of the calculation node and the management node according to the node IP inquiry result by the distance matrix, and outputting the node corresponding to the minimum value as an initiating node.
The purpose of this stage is to obtain the optimal initiating node ip, find the minimum value of the distance matrix between the computing node and the initiating node obtained in step S2 according to the computing node ip obtained in step S4, min (M [ k, i ]), k is the slice value of the compute node ip, i is 0....the.n-1, and outputting the M node as a computing node.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and are not limiting; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims (7)
1. An originating node output method in an MPP distributed system, comprising:
s1: collecting the number of nodes and the node IP in the database cluster, and sequencing according to the fragmentation information to obtain a first mapping relation of the node fragmentation and the node IP;
s2: collecting server information, creating an IP distance matrix of a computing node and a management node according to the server information, and obtaining a distance matrix;
s3: a plurality of hash buckets are distributed for each computing node, the corresponding relation between the computing node and the hash buckets is recorded through a nodedatamap table of a management node, and a second mapping relation between the node fragments and the computing node is obtained according to nodedatamap table information and the corresponding relation, specifically comprising:
S31: assigning a plurality of hash buckets to each computing node;
s32: recording the corresponding relation between the computing node and the hash bucket through nodedatamap tables of the management nodes;
S33: recording the corresponding relation between the node fragments and the hash bucket through a nodedatamap table of the MPP initiating node;
S34: obtaining a hash bucket corresponding to a computing node through a nodedatamap table of a management node, obtaining node fragments corresponding to the hash bucket through a nodedatamap table of an MPP initiating node, and obtaining a second mapping relation between the node fragments and the computing node according to the hash bucket corresponding to the computing node and the node fragments corresponding to the hash bucket;
S4: extracting a hash key in a filtering condition of a query statement, and obtaining a node IP of a computing node corresponding to the query statement according to the hash key query by using the second mapping relation and the first mapping relation to obtain a node IP query result, wherein the method specifically comprises the following steps of:
S41: extracting hash values of the distributed columns in the filtering conditions of the query statement;
s42: calculating according to the hash value to obtain a hash key;
s43: obtaining node fragments corresponding to hash keys through a nodedatamap table of an MPP initiating node according to the second mapping relation, and obtaining the fragments corresponding to the query statement data according to the hash keys;
S44: acquiring node IP corresponding to a computing node according to the fragments of the data by the first mapping relation, and acquiring a node IP query result;
s5: and inquiring and obtaining minimum values of the calculation node and the management node according to the node IP inquiry result by the distance matrix, and outputting the node corresponding to the minimum value as an initiating node.
2. The method as claimed in claim 1, wherein the first mapping relation in step S1 is a one-dimensional array.
3. The method according to claim 1, wherein the distance matrix in step S2 is a two-dimensional matrix.
4. The method as set forth in claim 3, wherein in the distance matrix, when the IP of the computing node is the same as the IP of the management node, the distance between the computing node and the management node is 0, and when the IP of the computing node is different from the IP of the management node, the distance between the computing node and the management node is 1.
5. The method as set forth in claim 1, wherein in step S3, when a plurality of hash buckets are allocated to each computing node, the allocation is performed uniformly according to the total number of hash buckets.
6. An originating node output method in an MPP distributed system as defined in claim 5, wherein the hash buckets total 65536.
7. The method as set forth in claim 1, wherein in step S4, the filtering condition is an exact query statement containing a where condition and having an equation distribution column.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410704629.8A CN118277456B (en) | 2024-06-03 | 2024-06-03 | Initiating node output method in MPP distributed system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410704629.8A CN118277456B (en) | 2024-06-03 | 2024-06-03 | Initiating node output method in MPP distributed system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN118277456A CN118277456A (en) | 2024-07-02 |
| CN118277456B true CN118277456B (en) | 2024-09-20 |
Family
ID=91634412
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410704629.8A Active CN118277456B (en) | 2024-06-03 | 2024-06-03 | Initiating node output method in MPP distributed system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN118277456B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112135297A (en) * | 2020-09-22 | 2020-12-25 | 平安科技（深圳）有限公司 | Communication method, central server, equipment and medium of Internet of things |
| CN117971506A (en) * | 2024-03-29 | 2024-05-03 | 天津南大通用数据技术股份有限公司 | MPP database query task balancing method, system, equipment and medium |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP6951846B2 (en) * | 2017-03-07 | 2021-10-20 | 株式会社日立製作所 | Computer system and task allocation method |
| CN107330098B (en) * | 2017-07-06 | 2020-08-04 | 北京理工大学 | Query method, computing node and query system for custom report |
| CN117591608B (en) * | 2024-01-19 | 2024-04-30 | 恒辉信达技术有限公司 | Cloud primary database data slicing method based on distributed hash |
| CN118041925A (en) * | 2024-03-27 | 2024-05-14 | 中国工商银行股份有限公司 | Block chain network node, resource file positioning method and device |
-
2024
- 2024-06-03 CN CN202410704629.8A patent/CN118277456B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112135297A (en) * | 2020-09-22 | 2020-12-25 | 平安科技（深圳）有限公司 | Communication method, central server, equipment and medium of Internet of things |
| CN117971506A (en) * | 2024-03-29 | 2024-05-03 | 天津南大通用数据技术股份有限公司 | MPP database query task balancing method, system, equipment and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN118277456A (en) | 2024-07-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20090327218A1 (en) | Systems and Methods of Reverse Lookup | |
| US8150836B2 (en) | System, method, and computer-readable medium for reducing row redistribution costs for parallel join operations | |
| US20200242167A1 (en) | Graph database super vertex partitioning | |
| US20090248725A1 (en) | Compressability estimation of non-unique indexes in a database management system | |
| EP0875838A2 (en) | Cardinality-based join ordering | |
| Tsalouchidou et al. | Scalable dynamic graph summarization | |
| CN105512283A (en) | Data quality management and control method and device | |
| US20140214754A1 (en) | Scalable and Adaptive Evaluation of Reporting Window Functions | |
| CN1292125A (en) | Method and apparatus for optimizing query generation by selectively utilizing attributes or key values | |
| CN111782620A (en) | Credit link automatic tracking platform and method thereof | |
| Cheng et al. | Efficient event correlation over distributed systems | |
| CN101916281B (en) | Concurrent computational system and non-repetition counting method | |
| CN117574428A (en) | Hidden query method, device, equipment and medium for mass distributed storage | |
| CN111125199B (en) | Database access method and device and electronic equipment | |
| CN118277456B (en) | Initiating node output method in MPP distributed system | |
| Cao et al. | LogKV: Exploiting key-value stores for event log processing | |
| US8285752B1 (en) | System and method for maintaining a plurality of summary levels in a single table | |
| CN107016050B (en) | Data processing method and device | |
| KR101256922B1 (en) | Method for distributed decision tree induction algorithm for prediction and analysis | |
| CN112749197B (en) | Data fragment refreshing method, device, equipment and storage medium | |
| CN115525655A (en) | Method and system for data query slicing | |
| CN113032446B (en) | Data processing method and device of distributed query system | |
| CN114860851A (en) | Data processing method, device, equipment and storage medium | |
| CN114860806A (en) | Data query method and device of block chain, computer equipment and storage medium | |
| US12079250B2 (en) | Efficient evaluation of sets of resources |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| 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 | ||
| CP03 | Change of name, title or address |
Address after: Room 201-33, Unit 2, Building 2, No. 39 Gaoxin 6th Road, Binhai Science and Technology Park, Binhai New Area, Tianjin, China 300452 Patentee after: TIANJIN NANKAI UNIVERSITY GENERAL DATA TECHNOLOGIES Co.,Ltd. Country or region after: China Address before: 300384 building J, Haitai green industrial base, 6 Haitai development road, Huayuan Industrial Zone, Binhai New Area, Tianjin Patentee before: TIANJIN NANKAI UNIVERSITY GENERAL DATA TECHNOLOGIES Co.,Ltd. Country or region before: China |