CN104954263B - A kind of searching method and device of complex network destination node - Google Patents
A kind of searching method and device of complex network destination node Download PDFInfo
- Publication number
- CN104954263B CN104954263B CN201510359633.6A CN201510359633A CN104954263B CN 104954263 B CN104954263 B CN 104954263B CN 201510359633 A CN201510359633 A CN 201510359633A CN 104954263 B CN104954263 B CN 104954263B
- Authority
- CN
- China
- Prior art keywords
- node
- maximum degree
- target
- searching
- nodes
- 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
- 238000000034 method Methods 0.000 title claims abstract description 39
- 238000010187 selection method Methods 0.000 claims description 4
- 238000010586 diagram Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention proposes a kind of searching method and device of complex network destination node, and method includes：When initial, user chooses source node and destination node；Since source node, its surrounding neighbours node is searched for, and compares the number of degrees of the surrounding neighbours node of source node, selects maximal degree node and time maximal degree node；Judge to whether there is destination node in surrounding neighbours node, if so, merging the node on all levels, exports searching route；Otherwise, maximal degree node is recorded, and continues search for its surrounding neighbours node since maximal degree node, then records time maximal degree node, and continue search for its surrounding neighbours node since secondary maximal degree node；The number of degrees for comparing each node in the surrounding neighbours node of maximal degree node and the surrounding neighbours node of time maximal degree node, select maximal degree node and time maximal degree node, and return.The searching method and device for implementing the complex network destination node of the present invention, have the advantages that：Search speed is very fast.
Description
Technical Field
The invention relates to the field of node searching, in particular to a searching method and a searching device for a complex network target node.
Background
Complex network search strategies are often described in terms of a messaging process. Starting from a given source node, a query message is passed to one or more of its neighbors according to certain rules in order to find the required information. If the neighbor nodes that receive the query do not contain the information needed by the active node, then the neighbor nodes pass the query to their respective neighbors, and the process is repeated until the target node that stores the specified information is found. The target node then passes the information to the source node.
In the traditional method, traversal is performed through a BFS strategy, and when a source node searches a target node t by applying the BFS strategy, the source node firstly judges whether the target node is in own neighbor nodes or not. If yes, stopping searching; and if not, inquiring whether the target node exists in the neighbor nodes of the neighbor nodes or not from each neighbor. This process is repeated until any neighbor of the target node is found. If the network size is quite large, the processing mode can generate a large amount of query message traffic, network congestion is caused, the query speed is seriously influenced, and the searching speed is slow.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a method and an apparatus for searching a complex network target node with a fast search speed, aiming at the defect of the slow search speed in the prior art.
The technical scheme adopted by the invention for solving the technical problems is as follows: a searching method for constructing a target node of a complex network comprises the following steps:
A) initially, a user selects a source node and a target node;
B) starting from the source node, searching neighbor nodes around the source node, comparing degrees of the neighbor nodes around the source node, and selecting a maximum degree node and a secondary maximum degree node;
C) judging whether the target node exists in the surrounding neighbor nodes or not, if so, executing step F); otherwise, executing step D);
D) recording the maximum degree node, continuously searching the neighbor nodes around the maximum degree node from the maximum degree node, then recording the secondary maximum degree node, and continuously searching the neighbor nodes around the secondary maximum degree node from the secondary maximum degree node;
E) c, comparing the degree of each node in the neighbor nodes around the maximum degree node and the neighbor nodes around the secondary maximum degree node, selecting the maximum degree node and the secondary maximum degree node, and returning to the step C);
F) and combining the nodes on all the layers and outputting the search path.
In the method for searching for a target node of a complex network according to the present invention, the step F) further includes:
F1) after the target node is found, the nodes on all the previous layers are orderly placed into a point set according to the layers;
F2) a link is generated from the set of points accordingly.
In the searching method of the target node of the complex network, the surrounding neighbor nodes are nodes which are separated from the current node by one edge.
In the searching method of the target node of the complex network, the number of the source node is one, and the number of the target node is at least one.
The invention also relates to a device for realizing the searching method of the complex network target node, which comprises the following steps:
a node selection unit: the method comprises the steps that a user selects a source node and a target node at the beginning;
a neighbor node search comparison unit: the node selection method comprises the steps of searching neighbor nodes around the source node from the source node, comparing degrees of the neighbor nodes around the source node, and selecting a maximum degree node and a secondary maximum degree node;
a target node judgment unit: the target node is used for judging whether the target node exists in the surrounding neighbor nodes or not;
a record search unit: the system is used for recording the maximum degree node, continuously searching the neighbor nodes around the maximum degree node from the maximum degree node, then recording the secondary maximum degree node, and continuously searching the neighbor nodes around the secondary maximum degree node from the secondary maximum degree node;
degree comparison selection unit: the node degree selection method comprises the steps of comparing degrees of each node in neighboring nodes around the maximum degree node and neighboring nodes around the secondary maximum degree node, and selecting the maximum degree node and the secondary maximum degree node;
a node merging output unit: and the search path is output by combining nodes on all the layers.
In the apparatus of the present invention, the node-merging output unit further includes:
the node orderly storage module: after the target node is found, the nodes on all the previous layers are orderly placed into a point set according to the layers;
a link generation module: for generating a link from said set of points accordingly.
In the apparatus of the present invention, the neighboring node is a node that is one edge away from the current node.
In the apparatus of the present invention, the number of the source nodes is one, and the number of the destination nodes is at least one.
The method and the device for searching the target node of the complex network have the following beneficial effects: since the maximum degree node and the secondary maximum degree node are selected, then the neighbor nodes around the maximum degree node are searched continuously from the maximum degree node and the neighbor nodes around the maximum degree node are searched continuously from the secondary maximum degree node, the path from the source node to the target node is searched by the branch maximum degree searching method, the searching speed is higher, and the searching speed is higher.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a flowchart of a method in one embodiment of a method and apparatus for searching for a target node of a complex network according to the present invention;
FIG. 2 is a specific flowchart of merging nodes at all levels and outputting a search path in the embodiment;
fig. 3 is a schematic structural diagram of the device in the embodiment.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In the embodiment of the method and the device for searching for the target node of the complex network, a flow chart of the method for searching for the target node of the complex network is shown in fig. 1. In fig. 1, the searching method of the target node of the complex network includes the following steps:
step S01 is initial, where the user selects a source node and a target node: in this step, the user selects a source node and a target node, and the system acquires the initial source node and target node by querying the database and records the attribute information of the source node and target node. It should be noted that the number of the source nodes is one, and the number of the target nodes is at least one.
Step S02 is to search neighboring nodes around the source node from the source node, compare degrees of the neighboring nodes around the source node, and select a maximum degree node and a sub-maximum degree node: in this step, starting from a source node, neighbor nodes around the source node are searched, degrees of the neighbor nodes around the source node are compared, and a maximum degree node and a secondary maximum degree node are selected. It is worth mentioning that the surrounding neighbor nodes refer to nodes that are one edge away from the current node. For example: the neighboring nodes around the source node are nodes which are separated from the source node by an edge.
Specifically, if there is an edge between two points, the two points are adjacent to each other. The number of edges associated with a point v is called v degrees (degree) or valence (valence). In particular, if the network graph G is not a multigraph, it is equal to the number of neighbors of this point. One vertex is called an isolated vertex, and its degree is 0.
Minimum degree of G is notedWherein,(G) is the minimum degree of G, V is the point, V is the set of points, d (V) is the derivative,
the maximum degree of G is denoted as Δ (G) ═ max { d (V) | V ∈ V }, where Δ (G) is the maximum degree of G.
When all vertices of the network graph G have the same vertex degree k, G is said to be k-regular.
It is worth mentioning that the same node can be accessed multiple times, but the same edge can only be accessed once, and if all edges connected to the current node are accessed, the previous node is returned.
Step S03 judges whether there is a target node in the surrounding neighbor nodes: in this step, it is determined whether a target node exists in the neighboring nodes, and if the determination result is yes, the relationship between the source node and the target node is found to be an adjacent relationship, and step S06 is executed; otherwise, step S04 is executed.
Step S04 records the maximum node, and continues searching its surrounding neighbor nodes from the maximum node, then records the next maximum node, and continues searching its surrounding neighbor nodes from the next maximum node: if the judgment result of the above step S03 is no, the present step is executed. In the step, a maximum degree node is recorded, neighbor nodes around the maximum degree node are continuously searched from the maximum degree node, a secondary maximum degree node is recorded, and neighbor nodes around the secondary maximum degree node are continuously searched from the secondary maximum degree node. After the present step is executed, step S05 is executed.
Step S05 compares the degree of each node in the neighboring nodes around the maximum degree node and the neighboring nodes around the second maximum degree node, and selects the maximum degree node and the second maximum degree node: in this step, the degrees of each of the neighboring nodes around the maximum degree node and the neighboring nodes around the second maximum degree node are compared, the maximum degree node and the second maximum degree node are selected, that is, the degrees of the neighboring nodes around the maximum degree node and the second maximum degree node are compared, the maximum degree node with the maximum degree is found out and used as the maximum degree node, the second maximum degree node with the second maximum degree is found out and used as the second maximum degree node, and the currently found maximum degree node and the second maximum degree node are respectively substituted for the previously selected maximum degree node and the second maximum degree node.
Step S06 merges nodes on all levels, and outputs a search path: if the judgment result of the above step S03 is yes, the present step is executed. In this step, the nodes on all levels are merged and the search path is output, so that the relationship between the source node and the target node is found. Compared with the traditional complex network searching method, the searching method for the complex network target node of the embodiment is used for searching the path from the source node to the target node, the searching speed is higher, and in a complex network diagram with the node number of 1000 ten thousand, the searching method for the complex network target node is improved by 30% compared with the traditional searching speed.
For the present embodiment, the step S06 can be further refined, and the detailed flowchart is shown in fig. 2. In fig. 2, the step S06 further includes:
step S61, after finding the target node, putting the nodes in all previous layers into a point set according to the order of the layers: in this step, after the target node is found, the nodes on all previous layers are orderly placed into a point set according to the layers.
Step S62 generates a link from the point set: in this step, a link is generated from the point set.
It is worth mentioning that if a compromise method is taken on the network bandwidth and the searching speed, and a complex network model of BA is combined, the combination of maximum degree plus broadcasting can be used for searching the target node.
The embodiment also relates to a device of the searching method of the target node of the complex network, and the structure of the device is schematically shown in fig. 3. In fig. 3, the apparatus includes a node selection unit 1, a neighbor node search comparison unit 2, a target node judgment unit 3, a record search unit 4, a degree comparison selection unit 5, and a node merge output unit 6; the node selection unit 1 is used for selecting a source node and a target node by a user at the beginning; the neighbor node searching and comparing unit 2 is used for searching neighbor nodes around the source node from the source node, comparing degrees of the neighbor nodes around the source node, and selecting a maximum degree node and a secondary maximum degree node; the target node judging unit 3 is used for judging whether a target node exists in surrounding neighbor nodes; the record searching unit 4 is used for recording the maximum degree node, continuously searching the neighbor nodes around the maximum degree node from the maximum degree node, then recording the secondary maximum degree node, and continuously searching the neighbor nodes around the secondary maximum degree node from the secondary maximum degree node; the degree comparison selection unit 5 is used for comparing the degree of each node in the neighboring nodes around the maximum degree node and the neighboring nodes around the secondary maximum degree node, and selecting the maximum degree node and the secondary maximum degree node; the node merging output unit 6 is configured to merge nodes on all levels and output a search path. Compared with the traditional complex network searching method, the searching method for the complex network target node of the embodiment is used for searching the path from the source node to the target node, the searching speed is higher, and in a complex network diagram with the node number of 1000 ten thousand, the searching method for the complex network target node is improved by 30% compared with the traditional searching speed.
It should be noted that, in this embodiment, the neighboring nodes are nodes that are separated from the current node by an edge. The number of the source nodes is one, and the number of the target nodes is at least one. In this embodiment, the node merge output unit 6 further includes a node ordered storage module 61 and a link generation module 62; the node ordered storage module 61 is used for placing the nodes on all previous layers into a point set in order according to the layers after the target node is found; the link generation module 62 is used to generate a link from the point set. Thus, the relationship between the source node and the target node is quickly found.
In summary, in this embodiment, if the maximum node is used for searching only, the searching speed is slower, and the method of searching the neighboring nodes around the maximum node and the next maximum node respectively through branch searching greatly provides the searching speed, but the required bandwidth is higher.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.
Claims (8)
1. A searching method of a target node of a complex network is characterized by comprising the following steps:
A) initially, a user selects a source node and a target node;
B) starting from the source node, searching neighbor nodes around the source node, comparing degrees of the neighbor nodes around the source node, and selecting a maximum degree node and a secondary maximum degree node;
C) judging whether the target node exists in the surrounding neighbor nodes or not, if so, executing step F); otherwise, executing step D);
D) recording the maximum degree node, continuously searching the neighbor nodes around the maximum degree node from the maximum degree node, then recording the secondary maximum degree node, and continuously searching the neighbor nodes around the secondary maximum degree node from the secondary maximum degree node;
E) comparing the degrees of each node in the neighbor nodes around the maximum degree node and the neighbor nodes around the secondary maximum degree node, selecting the maximum degree node and the secondary maximum degree node, respectively replacing the currently found maximum degree node and the secondary maximum degree node with the previously selected maximum degree node and returning to the step C);
F) and orderly putting the nodes on all the layers into a point set according to the layers, and outputting links correspondingly generated according to the point set as search paths.
2. The searching method of the target node of the complex network according to claim 1, wherein the step F) further comprises:
F1) after the target node is found, the nodes on all the previous layers are orderly placed into a point set according to the layers; F2) a link is generated from the set of points accordingly.
3. The method of claim 2, wherein the neighboring nodes are nodes that are one edge away from the current node.
4. The method according to any one of claims 1 to 3, wherein the number of the source nodes is one, and the number of the target nodes is at least one.
5. An apparatus for implementing the searching method of the target node of the complex network as claimed in claim 1, comprising:
a node selection unit: the method comprises the steps that a user selects a source node and a target node at the beginning;
a neighbor node search comparison unit: the node selection method comprises the steps of searching neighbor nodes around the source node from the source node, comparing degrees of the neighbor nodes around the source node, and selecting a maximum degree node and a secondary maximum degree node;
a target node judgment unit: the target node is used for judging whether the target node exists in the surrounding neighbor nodes or not;
a record search unit: the system is used for recording the maximum degree node, continuously searching the neighbor nodes around the maximum degree node from the maximum degree node, then recording the secondary maximum degree node, and continuously searching the neighbor nodes around the secondary maximum degree node from the secondary maximum degree node;
degree comparison selection unit: the node selection method comprises the steps of comparing the degrees of each node in the neighbor nodes around the maximum degree node and the neighbor nodes around the secondary maximum degree node, selecting the maximum degree node and the secondary maximum degree node, and replacing the currently found maximum degree node and the secondary maximum degree node with the previously selected maximum degree node and secondary maximum degree node respectively;
a node merging output unit: and the system is used for orderly placing the nodes on all the layers into a point set according to the layers and outputting the link correspondingly generated according to the point set as a search path.
6. The apparatus of claim 5, wherein the node merge output unit further comprises: the node orderly storage module: after the target node is found, the nodes on all the previous layers are orderly placed into a point set according to the layers;
a link generation module: for generating a link from said set of points accordingly.
7. The apparatus of claim 6, wherein the surrounding neighbor node is a node that is one edge away from a current node.
8. The apparatus according to any one of claims 5 to 7, wherein the number of the source nodes is one, and the number of the target nodes is at least one.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510359633.6A CN104954263B (en) | 2015-06-24 | 2015-06-24 | A kind of searching method and device of complex network destination node |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510359633.6A CN104954263B (en) | 2015-06-24 | 2015-06-24 | A kind of searching method and device of complex network destination node |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104954263A CN104954263A (en) | 2015-09-30 |
| CN104954263B true CN104954263B (en) | 2018-07-31 |
Family
ID=54168628
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510359633.6A Active CN104954263B (en) | 2015-06-24 | 2015-06-24 | A kind of searching method and device of complex network destination node |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104954263B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106712995B (en) * | 2015-11-16 | 2019-11-29 | 杭州华为数字技术有限公司 | A kind of acquisition methods and device of multi-hop neighbor node |
| CN107203946B (en) * | 2016-03-15 | 2020-08-07 | 阿里巴巴集团控股有限公司 | Positioning method of community group, positioning method of risk group and positioning device of risk group |
| CN108090644A (en) * | 2016-11-22 | 2018-05-29 | 浙江科技学院 | Complicated supply chain network node searching model and its implementation |
| CN109002523A (en) * | 2018-07-12 | 2018-12-14 | 苏州工业职业技术学院 | Node inquiring method is affected based on time contact network |
| CN115550240B (en) * | 2022-11-24 | 2023-03-10 | 云账户技术(天津)有限公司 | Network routing method, system, electronic device and readable storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101330417A (en) * | 2008-07-24 | 2008-12-24 | 安徽大学 | Quotient space overlay model for calculating network shortest path and building method thereof |
| CN104093166A (en) * | 2014-07-08 | 2014-10-08 | 南京信息工程大学 | Wireless sensor network connection recovery method based on minimum movement of nodes |
| CN104202766A (en) * | 2014-09-03 | 2014-12-10 | 北京邮电大学 | Selecting method and system for network probing node of wireless sensor |
| CN104391907A (en) * | 2014-11-17 | 2015-03-04 | 四川汇源吉迅数码科技有限公司 | Variable resolution rapid path searching method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100459534C (en) * | 2002-10-07 | 2009-02-04 | 日本电信电话株式会社 | Layer network node and network constituted throuth said nodes, the node and layer network thereof |
-
2015
- 2015-06-24 CN CN201510359633.6A patent/CN104954263B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101330417A (en) * | 2008-07-24 | 2008-12-24 | 安徽大学 | Quotient space overlay model for calculating network shortest path and building method thereof |
| CN104093166A (en) * | 2014-07-08 | 2014-10-08 | 南京信息工程大学 | Wireless sensor network connection recovery method based on minimum movement of nodes |
| CN104202766A (en) * | 2014-09-03 | 2014-12-10 | 北京邮电大学 | Selecting method and system for network probing node of wireless sensor |
| CN104391907A (en) * | 2014-11-17 | 2015-03-04 | 四川汇源吉迅数码科技有限公司 | Variable resolution rapid path searching method |
Non-Patent Citations (5)
| Title |
|---|
| 《How to search a social network》;L Adamic等;《Social Networks》;20031231;第187-203页 * |
| 《Search in power-law networks》;LA Adamic等;《Physical Review E》;20011231;第1-20页 * |
| 《基于二分度的P2P优先搜索策略研究》;夏建华等;《西北民族大学学报（自然科学版）》;20111231;第32卷(第84期);第27-30页 * |
| 《基于无标度网络的最大度二分度搜索策略》;朱恒超等;《西北民族大学学报（自然科学版）》;20140630;第35卷(第94期);第28-31页、第42页 * |
| 《基于最大度和随机游走的混合搜索算法》;温巧林等;《海军航空工程学院学报》;20101231;第25卷(第5期);第577-580页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104954263A (en) | 2015-09-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104954263B (en) | A kind of searching method and device of complex network destination node | |
| US7072304B2 (en) | Network path selection based on bandwidth | |
| US7860106B2 (en) | System and method for routing table computation and analysis | |
| CN104462260B (en) | A kind of community search method in social networks based on k- cores | |
| WO2016184029A1 (en) | Storage and lookup methods and apparatuses supporting hash lookup and routing lookup, and storage medium | |
| US20150327135A1 (en) | Apparatus and method for dynamic hybrid routing in sdn networks to avoid congestion and balance loads under changing traffic load | |
| EP3276501B1 (en) | Traffic classification method and device, and storage medium | |
| CN101399688A (en) | Publishing method and device for distributed region lookup zone | |
| CN102405623B (en) | Method and device for storing routing table entry | |
| CN105404690A (en) | Database querying method and apparatus | |
| US20140029614A1 (en) | Forwarding a multicast message | |
| CN102891872B (en) | The method and system of data storage and query in a kind of peer-to-peer network | |
| CN105335402A (en) | Search method, index data generation method and device on the basis of static Cache | |
| US20120317275A1 (en) | Methods and devices for node distribution | |
| KR101480670B1 (en) | Method for searching shortest path in big graph database | |
| CN102187642A (en) | Method and device for adding, searching for and deleting key in hash table | |
| CN101420440B (en) | String matching processing method and apparatus | |
| US20160292274A1 (en) | Operation method of node considering packet characteristic in content-centered network and node | |
| KR102279323B1 (en) | Method and device for grape spasification using edge prunning | |
| JPWO2013108745A1 (en) | Storage device, control method thereof, and program | |
| JP5383776B2 (en) | Graph index update device | |
| CN111385195A (en) | Information processing method, device and storage medium | |
| EP3793171B1 (en) | Message processing method, apparatus, and system | |
| JP5595342B2 (en) | Multiple path search method and apparatus | |
| WO2020022374A1 (en) | Packet search device, packet search method, and packet search program |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: 2708, 2, 2709, 511011 and 2710, Da Nan Road, Guangzhou, Guangdong, Yuexiu District Applicant after: GUANGDONG INTELLIGENT DATA TECHNOLOGY CO.,LTD. Address before: 2708, 2, 2709, 511011 and 2710, Da Nan Road, Guangzhou, Guangdong, Yuexiu District Applicant before: GUANGZHOU SHIYUN INFORMATION TECHNOLOGY Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| CB03 | Change of inventor or designer information |
Inventor after: Chen Lehua Inventor after: Tu Jilai Inventor after: Huang Xiaohui Inventor before: Chen Lehua Inventor before: Tu Jilai Inventor before: Huang Xiaohui Inventor before: Zhang Qing |
|
| CB03 | Change of inventor or designer information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP02 | Change in the address of a patent holder |
Address after: Room 606, No. 79, Wanbo Second Road, Nancun Town, Panyu District, Guangzhou, Guangdong 510000 Patentee after: GUANGDONG INTELLIGENT DATA TECHNOLOGY CO.,LTD. Address before: 511011 rooms 2708, 2709, 2710, No. 2, Danan Road, Yuexiu District, Guangzhou, Guangdong Province Patentee before: GUANGDONG INTELLIGENT DATA TECHNOLOGY CO.,LTD. |
|
| CP02 | Change in the address of a patent holder |