CN107870978A - Relational network topological method and application server - Google Patents
Relational network topological method and application server Download PDFInfo
- Publication number
- CN107870978A CN107870978A CN201710914559.9A CN201710914559A CN107870978A CN 107870978 A CN107870978 A CN 107870978A CN 201710914559 A CN201710914559 A CN 201710914559A CN 107870978 A CN107870978 A CN 107870978A
- Authority
- CN
- China
- Prior art keywords
- label
- node
- relation table
- initialization
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 34
- 230000015654 memory Effects 0.000 claims description 21
- 238000010586 diagram Methods 0.000 description 12
- 230000008859 change Effects 0.000 description 4
- 230000008901 benefit Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 3
- 238000004590 computer program Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000000638 solvent extraction Methods 0.000 description 1
- 230000003068 static effect Effects 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/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
- G06F16/285—Clustering or classification
-
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/01—Social networking
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Primary Health Care (AREA)
- Marketing (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- General Health & Medical Sciences (AREA)
- General Business, Economics & Management (AREA)
- Economics (AREA)
- Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a kind of relational network topological method, this method includes：Relation data between node in database generates the relation table of all nodes；Adjacent node is read from the relation table, and obtains each self-corresponding initialization label of each pair adjacent node；Compare the initialization label of each pair adjacent node, larger initialization label is replaced with less initialization label；Continue to compare the label after each pair adjacent node is replaced, larger label is replaced with less label, and loop iteration is carried out by this rule, until the label of all adjacent nodes is identical；All nodes are grouped by the label finally given.The present invention also provides a kind of application server and computer-readable recording medium.Relational network topological method, application server and computer-readable recording medium provided by the invention can be traveled through by simple table and successive ignition, and all related nodes are classified as into a group.
Description
Technical field
The present invention relates to data analysis technique field, more particularly to a kind of relational network topological method and application server.
Background technology
In the existing relevant database for client, the group relation between many clients and client be present, with declaration form
Exemplified by, someone be present is someone insurer, and someone is a variety of associations such as someone income people.In order in follow-up air control, take advantage of
This group relation is identified, it is necessary to which all related people are labeled as into one group in swindleness model, in order to take precautions against group's fraud etc.
Risk problem.Existing relational network algorithm is all based on graph theory or regulation engine, not yet passes through in relevant database
SQL is realized.
The content of the invention
In view of this, the present invention proposes a kind of relational network topological method and application server, how to solve in relation
The problem of in type database by SQL implementation relation network topologies.
First, to achieve the above object, the present invention proposes a kind of relational network topological method, and the method comprising the steps of：
Relation data between node in database generates the relation table of all nodes；
Adjacent node is read from the relation table, and obtains each self-corresponding initialization label of each pair adjacent node；
Compare the initialization label of each pair adjacent node, larger initialization label is replaced with less initialization label；
Continue to compare the label after each pair adjacent node is replaced, larger label is replaced with less label, and by this rule
Loop iteration is then carried out, until the label of all adjacent nodes is identical；And
All nodes are grouped by the label finally given
Alternatively, this method also includes step：
For all nodes in database, initialization label is set.
Alternatively, the relation table includes the first relation table and the second relation table, wherein, for all related sections
Point, first node, section point and incidence relation between the two are recorded in first relation table；Second relation table
For the data in first relation table, multiple incidence relations corresponding to each node and the node are recorded.
Alternatively, the adjacent node is related node, and recorded association is read from second relation table
Relation identical node, as a pair of adjacent nodes.
Alternatively, the node is the client recorded in relevant database.
In addition, to achieve the above object, the present invention also provides a kind of application server, including memory, processor, described
The relational network topological system that can be run on the processor is stored with memory, the relational network topological system is by institute
Following steps are realized when stating computing device：
Relation data between node in database generates the relation table of all nodes；
Adjacent node is read from the relation table, and obtains each self-corresponding initialization label of each pair adjacent node；
Compare the initialization label of each pair adjacent node, larger initialization label is replaced with less initialization label；
Continue to compare the label after each pair adjacent node is replaced, larger label is replaced with less label, and by this rule
Loop iteration is then carried out, until the label of all adjacent nodes is identical；And
All nodes are grouped by the label finally given.
Alternatively, the relational network topological system by the computing device when also realize step：
For all nodes in database, initialization label is set.
Alternatively, the relation table includes the first relation table and the second relation table, wherein, for all related sections
Point, first node, section point and incidence relation between the two are recorded in first relation table；Second relation table
For the data in first relation table, multiple incidence relations corresponding to each node and the node are recorded.
Alternatively, the adjacent node is related node, and recorded association is read from second relation table
Relation identical node, as a pair of adjacent nodes.
Further, to achieve the above object, the present invention also provides a kind of computer-readable recording medium, the computer
Readable storage medium storing program for executing is stored with relational network topological system, and the relational network topological system can be held by least one processor
OK, so that the step of at least one computing device relational network topological method described above.
Compared to prior art, relational network topological method proposed by the invention, application server and computer-readable
Storage medium, a kind of relational network based on SQL can be provided and transmit partitioning algorithm, can pass through simple table using the algorithm
Directly associated with table, travel through whole relational network, find associated node, while N-dimensional is found by successive ignition traversal
Relation.In addition, the label by comparing each pair adjacent node, and larger label is replaced with less label, by constantly
Loop iteration, you can all related nodes are classified as a group.
Brief description of the drawings
Fig. 1 is the schematic diagram of one optional hardware structure of application server of the present invention；
Fig. 2 is the program module schematic diagram of relational network topological system first embodiment of the present invention；
Fig. 3 (a) -3 (b) is the schematic diagram of the relation table in the present invention.
Fig. 4 (a) -4 (c) is the schematic diagram of the label of the node in the present invention；
Fig. 5 is the program module schematic diagram of relational network topological system second embodiment of the present invention；
Fig. 6 is the schematic flow sheet of relational network topological method first embodiment of the present invention；
Fig. 7 is the schematic flow sheet of relational network topological method second embodiment of the present invention.
Reference：
| Application server | 2 |
| Memory | 11 |
| Processor | 12 |
| Network interface | 13 |
| Relational network topological system | 200 |
| Generation module | 201 |
| Acquisition module | 202 |
| Comparison module | 203 |
| Grouping module | 204 |
| Setup module | 205 |
The realization, functional characteristics and advantage of the object of the invention will be described further referring to the drawings in conjunction with the embodiments.
Embodiment
In order to make the purpose , technical scheme and advantage of the present invention be clearer, it is right below in conjunction with drawings and Examples
The present invention is further elaborated.It should be appreciated that specific embodiment described herein is only to explain the present invention, not
For limiting the present invention.Based on the embodiment in the present invention, those of ordinary skill in the art are not before creative work is made
The every other embodiment obtained is put, belongs to the scope of protection of the invention.
It should be noted that the description for being related to " first ", " second " etc. in the present invention is only used for describing purpose, and can not
It is interpreted as indicating or implies its relative importance or imply the quantity of the technical characteristic indicated by indicating.Thus, define " the
One ", at least one this feature can be expressed or be implicitly included to the feature of " second ".In addition, the skill between each embodiment
Art scheme can be combined with each other, but must can be implemented as basis with those of ordinary skill in the art, when technical scheme
With reference to occurring conflicting or will be understood that the combination of this technical scheme is not present when can not realize, also not in application claims
Protection domain within.
As shown in fig.1, it is the schematic diagram of 2 one optional hardware structure of application server of the present invention.In the present embodiment, institute
Stating application server 2 may include, but be not limited only to, and connection memory 11, processor 12, net can be in communication with each other by system bus
Network interface 13.It is pointed out that Fig. 2 illustrate only the application server 2 with component 11-13, it should be understood that simultaneously
All components shown realistic are not applied, the more or less component of the implementation that can be substituted.
Wherein, the application server 2 can be rack-mount server, blade server, tower server or rack
The computing devices such as formula server, the application server 2 can be that independent server or multiple servers are formed
Server cluster.
The memory 11 comprises at least a type of readable storage medium storing program for executing, the readable storage medium storing program for executing include flash memory,
Hard disk, multimedia card, card-type memory (for example, SD or DX memories etc.), random access storage device (RAM), static random are visited
Ask memory (SRAM), read-only storage (ROM), Electrically Erasable Read Only Memory (EEPROM), programmable read-only deposit
Reservoir (PROM), magnetic storage, disk, CD etc..In certain embodiments, the memory 11 can be the application clothes
The internal storage unit of business device 2, such as the hard disk or internal memory of the application server 2.In further embodiments, the memory
11 can also be the plug-in type hard disk being equipped with the External memory equipment of the application server 2, such as the application server 2,
Intelligent memory card (Smart Media Card, SMC), secure digital (Secure Digital, SD) card, flash card (Flash
Card) etc..Certainly, the memory 11 can also both include the internal storage unit of the application server 2 or including outside it
Portion's storage device.In the present embodiment, the memory 11 is generally used for the operating system that storage is installed on the application server 2
With types of applications software, such as program code of relational network topological system 200 etc..In addition, the memory 11 can also be used
In temporarily storing the Various types of data that has exported or will export.
The processor 12 can be in certain embodiments central processing unit (Central Processing Unit,
CPU), controller, microcontroller, microprocessor or other data processing chips.The processor 12 is generally used for should described in control
With the overall operation of server 2, such as perform the control related with the mobile terminal 1 progress data interaction or communication and place
Reason etc..In the present embodiment, the processor 12 is used to run the program code stored in the memory 11 or processing data,
Such as run described relational network topological system 200 etc..
The network interface 13 may include radio network interface or wired network interface, and the network interface 13 is generally used for
Communication connection is established between the application server 2 and other electronic equipments.
So far, oneself is through describing the hardware configuration and function of the relevant device of each embodiment of the present invention in detail.Below, will
Based on above-mentioned relevant device, each embodiment of the invention is proposed.
First, the present invention proposes a kind of relational network topological system 200.
As shown in fig.2, it is the Program modual graph of the first embodiment of relational network topological system 200 of the present invention.This implementation
In example, described relational network topological system 200 includes a series of computer program instructions being stored on memory 11, when
When the computer program instructions are performed by processor 12, it is possible to achieve the relational network topology operation of various embodiments of the present invention.
In some embodiments, the specific operation realized based on the computer program instructions each several part, relational network topological system 200
One or more modules can be divided into.For example, in fig. 2, the relational network topological system 200 can be divided into life
Into module 201, acquisition module 202, comparison module 203, grouping module 204.Wherein：
The generation module 201, for generating the relation table of all nodes according to the relation data between node.
Specifically, for each node in relevant database, all sections are generated according to the relation data between node
The relation table of point.In the present embodiment, the node is a client.The relation table includes the first relation table and the second relation
Table.For all related nodes, record first node, the second section in first relation table (refering to shown in Fig. 3 (a))
Point and incidence relation (Rank) between the two.For example, it is relevant between client A and client B, also have between client A and client C
Association, then two records are corresponded in first relation table：First node is client A, and section point is that client B, Rank are
1；First node is client A, and section point is client C, Rank 2.Second relation table is root (refering to shown in Fig. 3 (b))
According to the data in the first relation table, multiple incidence relations (Rank) corresponding to each node and the node are recorded.For example, above-mentioned visitor
Rank corresponding to the A of family is 1 and 2, and Rank corresponding to client B is 1, and Rank corresponding to client C is 2, then in second relation table
Middle four records of correspondence：Node is client A, Rank 1；Node is client A, Rank 2；Node is client B, Rank 1；Section
Point is client C, Rank 2.
The acquisition module 202, for reading adjacent node from the relation table, and obtain each pair adjacent node each
Corresponding initialization label.
Specifically, the adjacent node refers to related node.In the present embodiment, can be from second relation table
It is middle to read recorded Rank identical nodes, as a pair of adjacent nodes.For example, client A and client B is a pair of adjacent segments
Point.After a pair of adjacent nodes are read out, initialization label corresponding to first node and section point is obtained respectively.For relation
Each node in type database, different initialization label (refering to shown in Fig. 4 (a)) can be set respectively in advance.For example, obtain
Client A initialization marked as 1 and client B initialization marked as 2.In the present embodiment, it is described marked as corresponding to client
Family number.
The comparison module 203, for comparing the initialization label of each pair adjacent node, replaced with less initialization label
Change larger initialization label.
Specifically, the initialization label of first node and the initialization of section point in a pair of adjacent nodes more every first
Label, a larger initialization label is replaced with wherein less initialization label.That is, when first node
When initialization label is less than the initialization label of section point, the label of section point is replaced with to the initialization mark of first node
Number；Conversely, when the initialization label of first node is more than the initialization label of section point, the label of first node is replaced
For the initialization label of section point.For example, client A initialization marked as 1, the initialization label 2 less than client B, then will
Client B label also replaces with 1.Refering to Fig. 4 (b) Suo Shi, after being replaced for the initialization label to the node in Fig. 4 (a)
Label schematic diagram.
The comparison module 203 is additionally operable to continue to compare the label after each pair adjacent node is replaced, and is replaced with less label
Larger label is changed, and loop iteration is carried out by this rule, until the label of all adjacent nodes is identical.
Specifically, after the replacement of the first round is completed, continue to compare the label after each pair adjacent node is replaced, if adjacent segments
When label after point replacement differs, the label after being replaced with wherein less one replaces the mark after larger one replaces
Number.Then continuous loop iteration said process, until the label all same of all adjacent nodes.For example, client C and client H are
A pair of adjacent nodes, client C replace after marked as 1, client H replace after marked as 3, then client H label is entered again
Row is replaced, and also replaces with 1.Refering to Fig. 4 (c) Suo Shi, to carry out what is obtained after repeatedly replacing to the label of the node in Fig. 4 (b)
The schematic diagram of final label.
The grouping module 204, for being grouped all nodes by the label finally given.
Specifically, after loop iteration is completed, the final label of related node is identical, therefore, according to finally giving
Label, you can all nodes are classified, obtain corresponding group.For example, all clients marked as 1 are classified as first group
Group, all clients marked as 2 are classified as second group etc..
As shown in fig.5, it is the Program modual graph of the second embodiment of relational network topological system 200 of the present invention.This implementation
In example, described relational network topological system 200 is except including the generation module 201, the acquisition module in first embodiment
202nd, outside comparison module 203, grouping module 204, in addition to setup module 205.
The setup module 205 is used to be all nodes setting initialization label in database.
Specifically, different initialization labels is set (to refer to Fig. 4 respectively for each node in relevant database
(a) shown in).For example, client A initialization is marked as 1, client B initialization marked as 2, client C initialization marked as 3,
By that analogy.
In addition, the present invention also proposes a kind of relational network topological method.
As shown in fig.6, it is the schematic flow sheet of relational network topological method first embodiment of the present invention.In the present embodiment
In, according to different demands, the execution sequence of the step in flow chart shown in Fig. 6 can change, and some steps can be omitted.
Step S700, the relation table of all nodes is generated according to the relation data between node.
Specifically, for each node in relevant database, all sections are generated according to the relation data between node
The relation table of point.In the present embodiment, the node is a client.The relation table includes the first relation table and the second relation
Table.For all related nodes, record first node, the second section in first relation table (refering to shown in Fig. 3 (a))
Point and incidence relation (Rank) between the two.For example, it is relevant between client A and client B, also have between client A and client C
Association, then two records are corresponded in first relation table：First node is client A, and section point is that client B, Rank are
1；First node is client A, and section point is client C, Rank 2.Second relation table is root (refering to shown in Fig. 3 (b))
According to the data in the first relation table, multiple incidence relations (Rank) corresponding to each node and the node are recorded.For example, above-mentioned visitor
Rank corresponding to the A of family is 1 and 2, and Rank corresponding to client B is 1, and Rank corresponding to client C is 2, then in second relation table
Middle four records of correspondence：Node is client A, Rank 1；Node is client A, Rank 2；Node is client B, Rank 1；Section
Point is client C, Rank 2.
Step S702, adjacent node is read from the relation table, and it is each self-corresponding initial to obtain each pair adjacent node
Change label.
Specifically, the adjacent node refers to related node.In the present embodiment, can be from second relation table
It is middle to read recorded Rank identical nodes, as a pair of adjacent nodes.For example, client A and client B is a pair of adjacent segments
Point.After a pair of adjacent nodes are read out, initialization label corresponding to first node and section point is obtained respectively.For relation
Each node in type database, different initialization label (refering to shown in Fig. 4 (a)) can be set respectively in advance.For example, obtain
Client A initialization marked as 1 and client B initialization marked as 2.In the present embodiment, it is described marked as corresponding to client
Family number.
Step S704, compare the initialization label of each pair adjacent node, with less initialization label replace it is larger just
Beginningization label.
Specifically, the initialization label of first node and the initialization of section point in a pair of adjacent nodes more every first
Label, a larger initialization label is replaced with wherein less initialization label.That is, when first node
When initialization label is less than the initialization label of section point, the label of section point is replaced with to the initialization mark of first node
Number；Conversely, when the initialization label of first node is more than the initialization label of section point, the label of first node is replaced
For the initialization label of section point.For example, client A initialization marked as 1, the initialization label 2 less than client B, then will
Client B label also replaces with 1.Refering to Fig. 4 (b) Suo Shi, after being replaced for the initialization label to the node in Fig. 4 (a)
Label schematic diagram.
Step S706, continue to compare the label after each pair adjacent node is replaced, larger label replaced with less label,
And loop iteration is carried out by this rule, until the label of all adjacent nodes is identical.
Specifically, after the replacement of the first round is completed, continue to compare the label after each pair adjacent node is replaced, if adjacent segments
When label after point replacement differs, the label after being replaced with wherein less one replaces the mark after larger one replaces
Number.Then continuous loop iteration said process, until the label all same of all adjacent nodes.For example, client C and client H are
A pair of adjacent nodes, client C replace after marked as 1, client H replace after marked as 3, then client H label is entered again
Row is replaced, and also replaces with 1.Refering to Fig. 4 (c) Suo Shi, to carry out what is obtained after repeatedly replacing to the label of the node in Fig. 4 (b)
The schematic diagram of final label.
Step S708, all nodes are grouped by the label finally given.
Specifically, after loop iteration is completed, the final label of related node is identical, therefore, according to finally giving
Label, you can all nodes are classified, obtain corresponding group.For example, all clients marked as 1 are classified as first group
Group, all clients marked as 2 are classified as second group etc..
As shown in fig. 7, it is the schematic flow sheet of the second embodiment of relational network topological method of the present invention.The present embodiment
In, the step S802-S810 of the relational network topological method and the step S700-S708 of first embodiment are similar, difference
It is that this method also includes step S800.
This method comprises the following steps：
Step S800, it is that all nodes in database set initialization label.
In the present embodiment, the node is a client, described marked as family number corresponding to client.
Specifically, different initialization labels is set (to refer to Fig. 4 respectively for each node in relevant database
(a) shown in).For example, client A initialization is marked as 1, client B initialization marked as 2, client C initialization marked as 3,
By that analogy.
Step S802, the relation table of all nodes is generated according to the relation data between node.
Specifically, for each node in relevant database, all sections are generated according to the relation data between node
The relation table of point.The relation table includes the first relation table and the second relation table.For all related nodes, described
Record first node in one relation table (refering to shown in Fig. 3 (a)), section point and incidence relation (Rank) between the two.Example
Such as, it is relevant between client A and client B, it is also relevant between client A and client C, then corresponding two in first relation table
Bar records：First node is client A, and section point is client B, Rank 1；First node is client A, and section point is client
C, Rank 2.Second relation table (refering to shown in Fig. 3 (b)) is the data in the first relation table, records each node
With the node corresponding to multiple incidence relations (Rank).For example, Rank corresponding to above-mentioned client A is 1 and 2, corresponding to client B
Rank is 1, and Rank corresponding to client C is 2, then corresponding four records in second relation table：Node is client A, Rank
For 1；Node is client A, Rank 2；Node is client B, Rank 1；Node is client C, Rank 2.
Step S804, adjacent node is read from the relation table, and it is each self-corresponding initial to obtain each pair adjacent node
Change label.
Specifically, the adjacent node refers to related node.In the present embodiment, can be from second relation table
It is middle to read recorded Rank identical nodes, as a pair of adjacent nodes.For example, client A and client B is a pair of adjacent segments
Point.After a pair of adjacent nodes are read out, initialization label corresponding to first node and section point is obtained respectively.For example, obtain
Take client A initialization marked as 1 and client B initialization is marked as 2.
Step S806, compare the initialization label of each pair adjacent node, with less initialization label replace it is larger just
Beginningization label.
Specifically, the initialization label of first node and the initialization of section point in a pair of adjacent nodes more every first
Label, a larger initialization label is replaced with wherein less initialization label.That is, when first node
When initialization label is less than the initialization label of section point, the label of section point is replaced with to the initialization mark of first node
Number；Conversely, when the initialization label of first node is more than the initialization label of section point, the label of first node is replaced
For the initialization label of section point.For example, client A initialization marked as 1, the initialization label 2 less than client B, then will
Client B label also replaces with 1.Refering to Fig. 4 (b) Suo Shi, after being replaced for the initialization label to the node in Fig. 4 (a)
Label schematic diagram.
Step S808, continue to compare the label after each pair adjacent node is replaced, larger label replaced with less label,
And loop iteration is carried out by this rule, until the label of all adjacent nodes is identical.
Specifically, after the replacement of the first round is completed, continue to compare the label after each pair adjacent node is replaced, if adjacent segments
When label after point replacement differs, the label after being replaced with wherein less one replaces the mark after larger one replaces
Number.Then continuous loop iteration said process, until the label all same of all adjacent nodes.For example, client C and client H are
A pair of adjacent nodes, client C replace after marked as 1, client H replace after marked as 3, then client H label is entered again
Row is replaced, and also replaces with 1.Refering to Fig. 4 (c) Suo Shi, to carry out what is obtained after repeatedly replacing to the label of the node in Fig. 4 (b)
The schematic diagram of final label.
Step S810, all nodes are grouped by the label finally given.
Specifically, after loop iteration is completed, the final label of related node is identical, therefore, according to finally giving
Label, you can all nodes are classified, obtain corresponding group.For example, all clients marked as 1 are classified as first group
Group, all clients marked as 2 are classified as second group etc..
The embodiments of the present invention are for illustration only, do not represent the quality of embodiment.
Through the above description of the embodiments, those skilled in the art can be understood that above-described embodiment side
Method can add the mode of required general hardware platform to realize by software, naturally it is also possible to by hardware, but in many cases
The former is more preferably embodiment.Based on such understanding, technical scheme is substantially done to prior art in other words
Going out the part of contribution can be embodied in the form of software product, and the computer software product is stored in a storage medium
In (such as ROM/RAM, magnetic disc, CD), including some instructions to cause a station terminal equipment (can be mobile phone, computer, clothes
Be engaged in device, air conditioner, or network equipment etc.) perform method described in each embodiment of the present invention.
The preferred embodiments of the present invention are these are only, are not intended to limit the scope of the invention, it is every to utilize this hair
The equivalent structure or equivalent flow conversion that bright specification and accompanying drawing content are made, or directly or indirectly it is used in other related skills
Art field, is included within the scope of the present invention.
Claims (10)
1. a kind of relational network topological method, applied to application server, it is characterised in that methods described includes step：
Relation data between node in database generates the relation table of all nodes；
Adjacent node is read from the relation table, and obtains each self-corresponding initialization label of each pair adjacent node；
Compare the initialization label of each pair adjacent node, larger initialization label is replaced with less initialization label；
Continue to compare the label after each pair adjacent node is replaced, larger label is replaced with less label, and enter by this rule
Row loop iteration, until the label of all adjacent nodes is identical；And
All nodes are grouped by the label finally given.
2. relational network topological method as claimed in claim 1, it is characterised in that this method also includes step：
For all nodes in database, initialization label is set.
3. relational network topological method as claimed in claim 1, it is characterised in that the relation table include the first relation table and
Second relation table, wherein, for all related nodes, first node, section point are recorded in first relation table
Incidence relation between the two；Second relation table is the data in first relation table, records each node
With the node corresponding to multiple incidence relations.
4. relational network topological method as claimed in claim 3, it is characterised in that the adjacent node is related section
Point, recorded incidence relation identical node, as a pair of adjacent nodes are read from second relation table.
5. relational network topological method as claimed in claim 1, it is characterised in that the node is to remember in relevant database
One client of record.
6. a kind of application server, it is characterised in that the application server includes memory, processor, on the memory
The relational network topological system that can be run on the processor is stored with, the relational network topological system is by the processor
Following steps are realized during execution：
Relation data between node in database generates the relation table of all nodes；
Adjacent node is read from the relation table, and obtains each self-corresponding initialization label of each pair adjacent node；
Compare the initialization label of each pair adjacent node, larger initialization label is replaced with less initialization label；
Continue to compare the label after each pair adjacent node is replaced, larger label is replaced with less label, and enter by this rule
Row loop iteration, until the label of all adjacent nodes is identical；And
All nodes are grouped by the label finally given.
7. application server as claimed in claim 6, it is characterised in that the relational network topological system is by the processor
Step is also realized during execution：
For all nodes in database, initialization label is set.
8. application server as claimed in claim 6, it is characterised in that the relation table includes the first relation table and second and closed
Be table, wherein, for all related nodes, recorded in first relation table first node, section point and both
Between incidence relation；Second relation table is the data in first relation table, records each node and the section
Multiple incidence relations corresponding to point.
9. application server as claimed in claim 8, it is characterised in that the adjacent node is related node, from institute
State the recorded incidence relation identical node of reading in the second relation table, as a pair of adjacent nodes.
10. a kind of computer-readable recording medium, the computer-readable recording medium storage has relation network topological system, institute
Stating enterprise's recommended program can be by least one computing device, so that at least one computing device such as claim 1-5
Any one of relational network topological method the step of.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710914559.9A CN107870978A (en) | 2017-09-30 | 2017-09-30 | Relational network topological method and application server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710914559.9A CN107870978A (en) | 2017-09-30 | 2017-09-30 | Relational network topological method and application server |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107870978A true CN107870978A (en) | 2018-04-03 |
Family
ID=61753030
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710914559.9A Pending CN107870978A (en) | 2017-09-30 | 2017-09-30 | Relational network topological method and application server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107870978A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109102393A (en) * | 2018-08-15 | 2018-12-28 | 阿里巴巴集团控股有限公司 | Training and the method and device for using relational network incorporation model |
| CN109634580A (en) * | 2018-10-31 | 2019-04-16 | 平安科技（深圳）有限公司 | Monitoring method, device, terminal and computer readable storage medium |
| CN109783568A (en) * | 2018-12-29 | 2019-05-21 | 咪咕文化科技有限公司 | A kind of generation method of network topological diagram, device and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101853428A (en) * | 2009-04-03 | 2010-10-06 | 范晓 | Remote characteristic query system and method |
| CN104537091A (en) * | 2015-01-06 | 2015-04-22 | 湖南科技大学 | Networked relational data query method based on hierarchical identification routing |
| CN106156294A (en) * | 2016-06-29 | 2016-11-23 | 福建富士通信息软件有限公司 | A kind of method of quick lookup associated data |
| CN106294524A (en) * | 2015-06-25 | 2017-01-04 | 阿里巴巴集团控股有限公司 | A kind for the treatment of method and apparatus of relation data |
| CN106355405A (en) * | 2015-07-14 | 2017-01-25 | 阿里巴巴集团控股有限公司 | Method and device for identifying risks and system for preventing and controlling same |
| CN106886524A (en) * | 2015-12-15 | 2017-06-23 | 天津科技大学 | A kind of community network community division method based on random walk |
-
2017
- 2017-09-30 CN CN201710914559.9A patent/CN107870978A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101853428A (en) * | 2009-04-03 | 2010-10-06 | 范晓 | Remote characteristic query system and method |
| CN104537091A (en) * | 2015-01-06 | 2015-04-22 | 湖南科技大学 | Networked relational data query method based on hierarchical identification routing |
| CN106294524A (en) * | 2015-06-25 | 2017-01-04 | 阿里巴巴集团控股有限公司 | A kind for the treatment of method and apparatus of relation data |
| CN106355405A (en) * | 2015-07-14 | 2017-01-25 | 阿里巴巴集团控股有限公司 | Method and device for identifying risks and system for preventing and controlling same |
| CN106886524A (en) * | 2015-12-15 | 2017-06-23 | 天津科技大学 | A kind of community network community division method based on random walk |
| CN106156294A (en) * | 2016-06-29 | 2016-11-23 | 福建富士通信息软件有限公司 | A kind of method of quick lookup associated data |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109102393A (en) * | 2018-08-15 | 2018-12-28 | 阿里巴巴集团控股有限公司 | Training and the method and device for using relational network incorporation model |
| CN109102393B (en) * | 2018-08-15 | 2021-06-29 | 创新先进技术有限公司 | Method and device for training and using relational network embedded model |
| CN109634580A (en) * | 2018-10-31 | 2019-04-16 | 平安科技（深圳）有限公司 | Monitoring method, device, terminal and computer readable storage medium |
| CN109634580B (en) * | 2018-10-31 | 2024-05-03 | 平安科技（深圳）有限公司 | Monitoring method, monitoring device, terminal and computer readable storage medium |
| CN109783568A (en) * | 2018-12-29 | 2019-05-21 | 咪咕文化科技有限公司 | A kind of generation method of network topological diagram, device and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107844634B (en) | Modeling method of multivariate general model platform, electronic equipment and computer readable storage medium | |
| CN107958016B (en) | Function page customization method and application server | |
| CN107870978A (en) | Relational network topological method and application server | |
| CN107679084B (en) | Clustering label generation method, electronic device and computer readable storage medium | |
| CN106156070B (en) | A kind of querying method, file mergences method and relevant apparatus | |
| CN105335855A (en) | Transaction risk identification method and apparatus | |
| CN107832676A (en) | Form data line feed recognition methods, electronic equipment and computer-readable recording medium | |
| CN107038256A (en) | Business customizing device, method and computer-readable recording medium based on data source | |
| CN108171069A (en) | Desensitization method, application server and computer readable storage medium | |
| CN103714086A (en) | Method and device used for generating non-relational data base module | |
| CN112613938B (en) | Model training method and device and computer equipment | |
| CN110399380A (en) | A kind of data processing method, electronic device and storage medium | |
| CN105989079A (en) | Method and apparatus for obtaining device fingerprint | |
| CN110990403A (en) | Business data storage method, system, computer equipment and storage medium | |
| CN107844468A (en) | The cross-page recognition methods of form data, electronic equipment and computer-readable recording medium | |
| CN108363684A (en) | List creation method, device and server | |
| CN110135798A (en) | Commission calculation method, platform, computer equipment and computer readable storage medium | |
| CN111209061B (en) | User information filling method, device, computer equipment and storage medium | |
| CN107944931A (en) | Seed user expanding method, electronic equipment and computer-readable recording medium | |
| CN109299205A (en) | The method and apparatus that will plan that the spatial data that industry uses is put in storage | |
| CN107766322A (en) | Entity recognition method, electronic equipment and computer-readable recording medium of the same name | |
| CN105554181B (en) | A kind of DNS log compression method and apparatus | |
| WO2019061667A1 (en) | Electronic apparatus, data processing method and system, and computer-readable storage medium | |
| CN107133163A (en) | A kind of method and apparatus for verifying description class API | |
| CN110377373A (en) | Web interface management system, method and computer readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20180529 Address after: 518000 Room 201, building A, No. 1, Qian Wan Road, Qianhai Shenzhen Hong Kong cooperation zone, Shenzhen, Guangdong (Shenzhen Qianhai business secretary Co., Ltd.) Applicant after: ONECONNECT FINANCIAL TECHNOLOGY Co.,Ltd. (SHANGHAI) Address before: 200030 Xuhui District, Shanghai Kai Bin Road 166, 9, 10 level. Applicant before: ONECONNECT FINANCIAL TECHNOLOGY Co.,Ltd. (SHANGHAI) |
|
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180403 |