CN111241347A

CN111241347A - Graph database creating method, enterprise data query method and device

Info

Publication number: CN111241347A
Application number: CN201911395892.9A
Authority: CN
Inventors: 乔媛媛; 邱宇辰; 林文辉; 杨洁
Original assignee: Beijing University of Posts and Telecommunications
Current assignee: Beijing University of Posts and Telecommunications
Priority date: 2019-12-30
Filing date: 2019-12-30
Publication date: 2020-06-05

Abstract

The embodiment of the invention provides a graph database creating method, an enterprise data query method and an enterprise data query device, which comprise the following steps: acquiring enterprise information to be inquired; inquiring a first class node and a second class node which have a connection relation with the first class node representing an enterprise to be inquired from a graph database as an associated first class node and an associated second class node; inquiring enterprises contained in an enterprise community to which the enterprise to be inquired belongs; and displaying the nodes representing the enterprises to be inquired, the associated first class nodes and the associated second class nodes, and the nodes contained in the enterprise community. By applying the scheme provided by the embodiment of the invention, enterprises having transaction relations with the enterprise to be inquired and natural persons having control relations with the enterprise to be inquired can be inquired, enterprises contained in an enterprise community to which the enterprise to be inquired belongs can be inquired, the transaction relations among the enterprises, the control relations between the enterprises and the natural persons and the enterprises having cooperation relations with the enterprise to be inquired can be reflected visually, and the inquiry result is enriched.

Description

Graph database creating method, enterprise data query method and device

Technical Field

The invention relates to the technical field of data processing, in particular to a graph database creating method, an enterprise data query method and an enterprise data query device.

Background

With the use of the tax information system, the staff can quickly inquire about the business relationship between the taxpayers through the tax information system. In the prior art, after a worker inputs a query target of an enterprise name or an enterprise tax number in a query window of a tax information system, the system queries invoice data stored in a relational database according to the query target to obtain a query result. Because the tax information of the enterprises is stored in the relational database in the form of a relational table, that is, each enterprise corresponds to a unique relational table in the relational database, the query mode can only query the tax information of the enterprise as a query target, and the query result is single.

Disclosure of Invention

The embodiment of the invention aims to provide a graph database creating method, an enterprise data query method and an enterprise data query device, which are used for enriching query results. The specific technical scheme is as follows:

in a first aspect, an embodiment of the present invention provides a method for creating a graph database, including:

creating a first class of nodes and a second class of nodes for a plurality of enterprises and a plurality of natural persons, the first class of nodes representing enterprises and the second class of nodes representing natural persons;

establishing a connection relation between nodes based on a transaction relation between enterprises and a control relation between the enterprises and natural persons, wherein each node comprises the first-class node and the second-class node, the connection relation between the two first-class nodes of the two enterprises is respectively represented for the two enterprises with the transaction relation, and the connection relation between the first-class node of the enterprise and the second-class node of the natural person is represented for the enterprises with the control relation and the natural persons;

and based on the connection relation among the nodes, when the connection relation has a closed loop relation, creating an enterprise community based on the enterprises represented by the first type nodes contained in the closed loop relation, wherein the enterprise community comprises the enterprises represented by the first type nodes.

Optionally, the method further includes:

and establishing an invoice flow relationship between the first type nodes based on a transaction relationship between enterprises, wherein for a first enterprise and a second enterprise in two enterprises with transaction relationship, when the first enterprise issues an invoice to the second enterprise, an arrow exists on a connecting line between the first type node representing the first enterprise and the first type node representing the second enterprise, and the direction pointed by the arrow is that the first type node representing the first enterprise points to the first type node representing the second enterprise.

Optionally, the method further includes:

respectively creating a community number for each enterprise community aiming at each created enterprise community;

and establishing a corresponding relation between the enterprise community and the community number.

Optionally, the method further includes:

ranking the plurality of enterprises according to each preset index of the enterprises respectively to obtain ranking results;

and generating a ranking list containing the ranking results.

In a second aspect, an embodiment of the present invention provides an enterprise data query method, including:

acquiring enterprise information of an enterprise to be queried as the enterprise information to be queried;

based on the information of the enterprise to be inquired, inquiring a first class node and a second class node which have a connection relation with a first class node representing the enterprise to be inquired from a pre-established graph database as an associated first class node and an associated second class node, wherein the first class node represents the enterprise, the second class node represents a natural person, a transaction relation exists between the enterprises represented by the two first class nodes having the connection relation, and a control relation exists between the enterprises represented by the first class node and the second class node having the connection relation and the natural person;

inquiring enterprises contained in the enterprise community to which the enterprise to be inquired belongs from the graph database, wherein each enterprise represented by each first type node contained in a closed loop relation in a connection relation of each node in the graph database belongs to one enterprise community;

and displaying the first class nodes representing the enterprises to be queried, the associated first class nodes and the associated second class nodes, the nodes respectively corresponding to the enterprises and the natural persons contained in the enterprise community to which the enterprises to be queried belong, and the connection relationship among the displayed nodes.

Optionally, there is an arrow in the illustrated connection line representing the connection relationship between the two first-type nodes, and the direction pointed by the arrow indicates that the enterprise that has issued the invoice points to the enterprise that has accepted the invoice.

Optionally, a corresponding relationship between an enterprise community and a community number is also established in the graph database, and the method further includes:

obtaining a community number to be inquired;

inquiring the enterprise community corresponding to the community number from the graph database based on the corresponding relation between the enterprise community and the community number;

and displaying the nodes corresponding to the enterprises and the natural persons contained in the enterprise community and the connection relation between the displayed nodes.

Optionally, a ranking table is created in the graph database, where the ranking table includes ranking results obtained by ranking the multiple enterprises according to preset indicators of the enterprises, respectively, and the method further includes:

inquiring the ranking of the enterprise to be inquired aiming at the preset index to be inquired from the name list;

and displaying the rank of the enterprise to be queried.

In a third aspect, an embodiment of the present invention provides an apparatus for creating a graph database, including:

the node creating unit is used for creating a first class of nodes and a second class of nodes aiming at a plurality of enterprises and a plurality of natural persons, wherein the first class of nodes represent the enterprises, and the second class of nodes represent the natural persons;

a connection relation establishing unit, configured to establish a connection relation between nodes based on a transaction relation between enterprises and a control relation between an enterprise and a natural person, where each node includes the first-class node and the second-class node, where, for two enterprises having a transaction relation, a connection relation exists between two first-class nodes of the two enterprises, and for an enterprise having a control relation and a natural person, a connection relation exists between a first-class node of the enterprise and a second-class node of the natural person;

and the community creating unit is used for creating an enterprise community based on each enterprise represented by each first-class node contained in the closed-loop relationship when the closed-loop relationship exists in the connection relationship, wherein the enterprise community comprises each enterprise represented by each first-class node.

Optionally, the creating device of the graph database further includes:

the invoice flow relationship establishing unit is used for establishing an invoice flow relationship between the first type nodes based on a transaction relationship between enterprises, wherein for a first enterprise and a second enterprise in the two enterprises with the transaction relationship, when the first enterprise issues an invoice to the second enterprise, an arrow exists on a connecting line between the first type node representing the first enterprise and the first type node representing the second enterprise, and the direction pointed by the arrow indicates that the first type node representing the first enterprise points to the first type node representing the second enterprise.

Optionally, the creating device of the graph database further includes:

the community number creating unit is used for creating a community number for each enterprise community aiming at each created enterprise community;

and the corresponding relation establishing unit is used for establishing the corresponding relation between the enterprise community and the community number.

Optionally, the creating device of the graph database further includes:

the ranking unit is used for ranking the plurality of enterprises according to each preset index of the enterprises respectively to obtain a ranking result;

and the generating unit is used for generating a ranking list containing the ranking results.

In a fourth aspect, an embodiment of the present invention provides an enterprise data query apparatus, including:

the enterprise information acquisition unit is used for acquiring enterprise information of an enterprise to be queried as the enterprise information to be queried;

the node query unit is used for querying a first class node and a second class node which have a connection relation with a first class node representing the enterprise to be queried from a pre-created graph database based on the information of the enterprise to be queried, and taking the first class node and the second class node as a related first class node and a related second class node, wherein the first class node represents the enterprise, the second class node represents a natural person, a transaction relation exists between the enterprises represented by the two first class nodes having the connection relation, and a control relation exists between the enterprises represented by the first class node and the second class node having the connection relation and the natural person;

the enterprise query unit is used for querying enterprises contained in an enterprise community to which the enterprise to be queried belongs from the graph database, wherein each enterprise represented by each first-class node contained in a closed-loop relationship in a connection relationship of each node in the graph database belongs to one enterprise community;

and the display unit is used for displaying the first class nodes representing the enterprises to be queried, the associated first class nodes and the associated second class nodes, the nodes respectively corresponding to the enterprises and the natural persons contained in the enterprise community to which the enterprises to be queried belong, and the connection relations among the displayed nodes.

Optionally, there is an arrow in the above-illustrated connection line representing the connection relationship between the two first-type nodes, and the direction pointed by the arrow indicates that the enterprise making the invoice points to the enterprise receiving the invoice.

Optionally, a corresponding relationship between an enterprise community and a community number is also established in the graph database, and the enterprise data query device may further include:

the number obtaining unit is used for obtaining a community number to be inquired;

the community query unit is used for querying the enterprise community corresponding to the community number from the graph database based on the corresponding relation between the enterprise community and the community number;

and the community display unit is used for displaying the nodes corresponding to the enterprises and the natural persons contained in the enterprise community and the connection relation between the displayed nodes.

Optionally, a ranking table is created in the graph database, where the ranking table includes ranking results obtained by ranking a plurality of enterprises according to preset indicators of the enterprises, respectively, and the enterprise data query apparatus may further include:

the ranking query unit is used for querying the ranking of the enterprises to be queried according to the preset indexes to be queried from the ranking list;

and the ranking display unit is used for displaying the ranking of the enterprise to be inquired.

In a fifth aspect, an embodiment of the present invention provides an electronic device, including a processor, a communication interface, a memory, and a communication bus, where the processor and the communication interface complete communication between the memory and the processor through the communication bus;

a memory for storing a computer program;

and a processor for implementing the steps of any of the above methods for creating a graph database when executing the program stored in the memory.

In a sixth aspect, an embodiment of the present invention provides another electronic device, including a processor, a communication interface, a memory, and a communication bus, where the processor and the communication interface complete communication between the memory and the processor through the communication bus;

a memory for storing a computer program;

and the processor is used for realizing the steps of any enterprise data query method when executing the program stored in the memory.

In a seventh aspect, an embodiment of the present invention provides a computer-readable storage medium, in which a computer program is stored, and when the computer program is executed by a processor, the steps of any one of the methods for creating a graph database are implemented.

In an eighth aspect, an embodiment of the present invention provides a computer-readable storage medium, where a computer program is stored in the computer-readable storage medium, and when the computer program is executed by a processor, the computer program implements the steps of any of the enterprise data query methods.

In a ninth aspect, embodiments of the present invention also provide a computer program product containing instructions which, when run on a computer, cause the computer to perform any of the methods for creating a graph database described above.

In a tenth aspect, embodiments of the present invention further provide a computer program product containing instructions, which when run on a computer, cause the computer to execute any of the above-mentioned enterprise data query methods.

According to the method and the device for creating the graph database and the method and the device for querying the enterprise data, aiming at multiple enterprises and multiple natural persons, a first type of node and a second type of node are created, wherein the first type of node represents the enterprises, and the second type of node represents the natural persons; establishing a connection relation between nodes based on a transaction relation between enterprises and a control relation between the enterprises and natural persons, wherein each node comprises a first class node and a second class node, the connection relation between the two first class nodes of the two enterprises is respectively represented aiming at the two enterprises with the transaction relation, and the connection relation between the first class node of the enterprise and the second class node representing the natural persons is represented aiming at the enterprises with the control relation and the natural persons; and based on the connection relation among the nodes, when the connection relation has a closed-loop relation, creating an enterprise community based on the enterprises represented by the first-class nodes contained in the closed-loop relation, wherein the enterprise community comprises the enterprises represented by the first-class nodes. Enterprise data query is carried out based on a pre-established graph database, and enterprise information of an enterprise to be queried is obtained and is used as the enterprise information to be queried; inquiring a first class node and a second class node which have a connection relation with a first class node representing an enterprise to be inquired from a pre-established graph database based on information of the enterprise to be inquired, and taking the first class node and the second class node as an associated first class node and an associated second class node; inquiring enterprises contained in an enterprise community to which the enterprise to be inquired belongs from the graph database; and displaying the first class nodes representing the enterprises to be queried, associating the first class nodes with the second class nodes, displaying the nodes respectively corresponding to the enterprises and the natural persons contained in the enterprise community to which the enterprises to be queried belong, and displaying the connection relationship between the displayed nodes.

When the scheme provided by the embodiment of the invention is applied to data query, not only enterprises having transaction relations with the enterprise to be queried and natural persons having control relations with the enterprise to be queried can be queried, but also enterprises contained in an enterprise community to which the enterprise to be queried belongs can be queried, and query results are displayed according to the connection relations among the nodes, so that the transaction relations among the enterprises and the control relations between the enterprises and the natural persons can be visually reflected, and the first-class nodes contained in the closed-loop relations among the connection relations among the nodes, namely the enterprises contained in the enterprise community to which the enterprise to be queried belongs, can be visually reflected on the enterprises having a cooperation relation with the enterprise to be queried, and the query results are enriched.

Of course, not all of the advantages described above need to be achieved at the same time in the practice of any one product or method of the invention.

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 flow chart of a method for creating a graph database according to an embodiment of the present invention;

FIG. 2 is a schematic diagram illustrating an invoice flow relationship between nodes of a first type in a graph database according to an embodiment of the present invention;

FIG. 3 is a diagram illustrating a graph database according to an embodiment of the present invention;

FIG. 4 is a flowchart of an enterprise data query method according to an embodiment of the present invention;

FIG. 5 is a diagram illustrating an enterprise data query, according to an embodiment of the present invention;

FIG. 6 is a schematic diagram of a business ranking provided by an embodiment of the invention;

FIG. 7 is a schematic diagram illustrating an exemplary embodiment of an apparatus for creating a graph database;

fig. 8 is a schematic structural diagram of an enterprise data query device according to an embodiment of the present invention;

fig. 9 is a schematic structural diagram of an electronic device according to an embodiment of the present invention;

fig. 10 is a schematic structural diagram of another electronic device according to an embodiment of the present invention.

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.

The embodiment of the invention discloses a graph database creating method, an enterprise data query method and an enterprise data query device, which are respectively explained in detail below.

As shown in fig. 1, fig. 1 is a flowchart of a method for creating a graph database according to an embodiment of the present invention. The method may be applied to electronic devices including, but not limited to, PCs (Personal computers) and mobile terminals. For convenience of description, the following description will be made with an electronic apparatus as an execution subject. The method for creating the graph database comprises the following steps:

step 11, aiming at a plurality of enterprises and a plurality of natural persons, creating a first class node and a second class node, wherein the first class node represents an enterprise, and the second class node represents a natural person;

step 12, establishing a connection relationship between nodes based on a transaction relationship between enterprises and a control relationship between the enterprises and the natural persons, wherein the nodes comprise first-class nodes and second-class nodes, the two enterprises with the transaction relationship respectively represent that the two first-class nodes of the two enterprises have the connection relationship, and the enterprises with the control relationship and the natural persons represent that the first-class nodes of the enterprises and the second-class nodes of the natural persons have the connection relationship;

and step 13, based on the connection relation among the nodes, when the connection relation has a closed-loop relation, creating an enterprise community based on the enterprises represented by the first-class nodes contained in the closed-loop relation, wherein the enterprise community comprises the enterprises represented by the first-class nodes.

By adopting the method for creating the graph database shown in the figure 1, the connection relationship between the first type of nodes representing enterprises and the second type of nodes representing natural persons is established, the connection relationship comprises the transaction relationship between the enterprises and the control relationship between the enterprises and the natural persons, and convenience is provided for inquiring the relationship between the enterprises and the natural persons; in addition, when a closed-loop relationship exists in the connection relationship, an enterprise community is created based on the enterprises represented by the first-class nodes in the closed-loop relationship, and the cooperation relationship among the enterprises is conveniently inquired.

In one embodiment, the method for creating a graph database may further include:

and establishing an invoice flow relationship between the first type nodes based on the transaction relationship between the enterprises, wherein for a first enterprise and a second enterprise in two enterprises with the transaction relationship, when the first enterprise issues an invoice to the second enterprise, an arrow exists on a connecting line between the first type node representing the first enterprise and the first type node representing the second enterprise, and the direction pointed by the arrow is that the first type node representing the first enterprise points to the first type node representing the second enterprise.

As shown in fig. 2, fig. 2 is a schematic diagram of an invoice flow relationship between nodes of a first type in a graph database according to an embodiment of the present invention, where the nodes of the first type are represented by circular nodes, and numbers in the nodes are merely for convenience of description, and in reality, each node has a unique node ID (identification number). In the figure, a transaction relationship exists between enterprise 1 and enterprise 2, and enterprise 1 invoices enterprise 2, so that an arrow exists on a connecting line between node 1 representing enterprise 1 and node 2 representing enterprise 2, and the direction pointed by the arrow is that node 1 points to node 2; similarly, there is a transaction relationship between enterprise 2 and enterprise 3, and enterprise 2 invoices enterprise 3, so there is an arrow pointing in the direction that node 2 points to node 3 for the connection between node 2 representing enterprise 2 and node 3 representing enterprise 3.

Taking the graph database diagram shown in fig. 3 as an example, in the graph, circular nodes represent first-class nodes, square nodes represent second-class nodes, and numbers in the nodes are only for convenience of description, based on the connection relationship among the nodes in the graph, 3 closed-loop relationships are easily found in the graph, and the closed-loop relationships are respectively a first enterprise community composed of a node 1, a node 2 and a node 3, a second enterprise community composed of a node 1, a node 2 and a node 4, and a third enterprise community composed of a node 1, a node 2, a node 3 and a node 4, and

community numbers

1, 2 and 3 are respectively created for the first enterprise community, the second enterprise community and the third enterprise community. And establishing a corresponding relation between the enterprise community and the community number, as shown in table 1.

Enterprise community	Including a node	Community number
			First enterprise community	Node	1, node 2, node 3	1
Second Enterprise Community	Node	1, node 2, node 4					2
			Third Enterprise Community	Node	1, node 2, node 3, node 4	3

Table 1: enterprise community and community number corresponding relation table

a ranking table is generated that contains the ranking results.

Each preset index may include one of the following: the system comprises a first type node, a second type node, a third type node, a fourth type node, a fifth type node, a sixth type node, a fifth type node, a sixth type node, a.

Taking the graph database diagram of FIG. 3 as an example, node 1, node 2, node 3, and node 4 in the diagram represent Enterprise 1, Enterprise 2, Enterprise 3, and Enterprise 4, respectively. The node 1 has an arrow pointing to the node 2 and an arrow pointing to the node 3, so that the out-degree of the node 1 is 2, the node 1 has an arrow pointing to the node 4, so that the in-degree of the node 1 is 1, and the out-degree of the node 1 is 3; similarly, node 2 has an arrow pointing to node 3, so the out-degree of node 2 is 1, node 2 has an arrow pointing to node 1 and an arrow pointing to node 4, so the in-degree of node 2 is 2, and it is easy to know that the in-degree of node 2 is 3; similarly, the out-degree of the node 3 is 0, the in-degree is 2, and the out-degree and the in-degree are 2; the out-degree of the node 4 is 2, the in-degree is 0, and the out-degree is 2.

Still taking the graph database diagram in fig. 3 as an example, the calculation of PR value of each first-class node will be described. Firstly, the initial PR value of each node is the same and can be preset to be 1, for the node 1, the node 1 has connection relations with the node 2, the node 3 and the node 4, because the node 2 has connection relations with three first-class nodes, one third of the initial PR value is added into the PR value of the node 1, the node 3 has connection relations with two first-class nodes, one half of the initial PR value is added into the PR value of the node 1, the node 4 has connection relations with two first-class nodes, one half of the initial PR value is added into the PR value of the node 1, and therefore

Aiming at the node 2, the node 1, the node 3 and the node 4 have connection relations, because the node 1 and the three first-class nodes have connection relations, one third of the initial PR value is added into the PR value of the node 1, the node 3 and the two first-class nodes have connection relations, one half of the initial PR value is added into the PR value of the node 2, the node 4 and the two first-class nodes have connection relations, one half of the initial PR value is added into the PR value of the node 2, and therefore, one half of the initial PR value is added into the PR value of the node 2, and the node 1 and the three first-class nodes have connection relations, the node 3

In the same way, the method can obtain,

and ranking the plurality of enterprises according to the preset indexes of the enterprises respectively to obtain ranking results. Taking the degree of income as a preset index as an example, ranking the

enterprises

1, 2, 3 and 4 from large to small according to the degree of income, when the degrees of income are equal, ranking results can be processed in a parallel mode, also can be processed by first letter ranking of enterprise names, and also can be processed by size ranking of enterprise tax numbers.

And generating a ranking list containing ranking results, wherein the ranking list can be composed of enterprise information and enterprise ranking, the enterprise information can comprise information such as enterprise names and enterprise tax numbers, and the ranking list is shown in table 2.

Enterprise information	Ranking
		Enterprise
2	1
		Enterprise 3	1
Enterprise 1	3
		Enterprise 4	4

Table 2: ranking list

Based on the pre-created graph database, the embodiment of the invention also provides an enterprise data query method. As shown in fig. 4, fig. 4 is a flowchart of an enterprise data query method according to an embodiment of the present invention, where the enterprise data query method includes the following steps:

step 41, acquiring enterprise information of an enterprise to be queried as enterprise information to be queried;

step 42, based on the information of the enterprise to be queried, querying a first class node and a second class node which have a connection relation with a first class node representing the enterprise to be queried from a pre-created graph database as an associated first class node and an associated second class node, wherein the first class node represents the enterprise, the second class node represents a natural person, a transaction relation exists between the enterprises represented by the two first class nodes having the connection relation, and a control relation exists between the enterprise represented by the first class node and the second class node having the connection relation and the natural person;

step 43, inquiring enterprises contained in the enterprise community to which the enterprise to be inquired belongs from the graph database, wherein each enterprise represented by each first-class node contained in the closed-loop relation in the connection relation of each node in the graph database belongs to one enterprise community;

and 44, displaying the first class nodes representing the enterprises to be queried, the associated first class nodes and the associated second class nodes, the nodes respectively corresponding to the enterprises and the natural persons contained in the enterprise community to which the enterprises to be queried belong, and the connection relationship among the displayed nodes.

By adopting the enterprise data query method shown in fig. 4, not only can the enterprise having a transaction relationship with the enterprise to be queried and the natural person having a control relationship with the enterprise to be queried, but also the enterprise contained in the enterprise community to which the enterprise to be queried belongs can be queried, and the query result is displayed in the connection relationship between the nodes, so that the transaction relationship between the enterprises and the control relationship between the enterprise and the natural person can be visually reflected, and the first-class nodes contained in the closed-loop relationship in the connection relationship between the nodes, namely the enterprise contained in the enterprise community to which the enterprise to be queried belongs, can visually reflect the enterprise having a cooperation relationship with the enterprise to be queried, thereby enriching the query result.

In one embodiment, there is an arrow in the above-illustrated connection line representing the connection relationship between two first-type nodes, and the direction pointed by the arrow indicates that the enterprise that has issued the invoice points to the enterprise that has accepted the invoice. The transaction relationship among enterprises can be intuitively reflected.

As shown in fig. 2, enterprise 1 invoices enterprise 2, so there is an arrow on the connection between node 1 representing enterprise 1 and node 2 representing enterprise 2, and the direction of the arrow is that node 1 points to node 2; similarly, enterprise 2 invoices enterprise 3, so there is an arrow pointing in the direction that node 2 points to node 3, as the connection between node 2 representing enterprise 2 and node 3 representing enterprise 3.

In one embodiment, the graph database further establishes a corresponding relationship between an enterprise community and a community number, and the enterprise data query method may further include:

obtaining a community number to be inquired;

Fig. 5 is a schematic diagram of an enterprise data query according to an embodiment of the present invention, as shown in fig. 5. In the figure, the bar-shaped frame behind the year is used for receiving the year input by the user, the corresponding relation between the enterprise community and the community number of each year can be pre-established, and the corresponding relation between the enterprise community and the enterprise number in the year can be found according to the year; the community finding button is used for showing all enterprise communities in the year, the enterprise communities are shown in a mode of highlighting or specifying colors and the like in a graph of all nodes and connection relations among the nodes in the year, bar frames behind a plurality of communities and a single community are used for receiving community numbers input by users, the community numbers can be received when the communities are checked, and the single community can only receive one community number when the community is checked; and the query button is used for querying the corresponding enterprise community according to the community number. For example, in the figure, the number input by the user in the bar box of a single community is 1, that is, the obtained number of the community to be queried is 1, and if the table 1 is the correspondence between the enterprise community and the enterprise number in 2019, based on the correspondence, the enterprise community composed of enterprise 1, enterprise 2, and enterprise 3 may be queried, and the nodes and the connection relationships corresponding to the enterprises are displayed, that is, the connection relationships among the nodes and the

nodes

1, 2, and 3 shown in fig. 5.

In an embodiment, a ranking table is created in the graph database, where the ranking table includes ranking results obtained by ranking a plurality of enterprises according to preset indicators of the enterprises, respectively, and the enterprise data query method may further include:

inquiring the rank of the enterprise to be inquired aiming at the preset index to be inquired from the ranking table;

and displaying the rank of the enterprise to be queried.

Fig. 6 is a schematic diagram of enterprise ranking according to an embodiment of the present invention, as shown in fig. 6. In the figure, a bar-shaped box behind the year is used for receiving the year input by a user, a name list of each year can be pre-established, and the name list comprises ranking results obtained by ranking a plurality of enterprises according to each preset index of the enterprises respectively; the bar frames below the enterprise name and the enterprise tax number are respectively used for receiving the enterprise name and the enterprise tax number of the enterprise to be inquired, which are input by a user; the preset index comprises four options, and a circle in front of each option is used for receiving a selection instruction of a user; the sequencing button is used for displaying the ranking of all enterprises in the year according to the selected preset index; the sequence number is used for displaying the ranking result; the importance is used for displaying the value of the preset index of the enterprise. For example, the enterprise name of the enterprise to be queried is enterprise 1, the enterprise tax number is 123456, the year obtained in the figure is 2019, and the selected preset index is the income, so that from the list of the income corresponding to 2019, if the table 2 is the list of the income corresponding to 2019, the rank number of the enterprise 1 is queried to be 3, and the row where the enterprise 1 is located is displayed in a manner of highlighting or in a designated color.

Corresponding to the method for creating a graph database, an embodiment of the present invention further provides a device for creating a graph database, as shown in fig. 7, fig. 7 is a schematic structural diagram of the device for creating a graph database according to the embodiment of the present invention, where the device for creating a graph database includes:

a node creating unit 71, configured to create, for multiple enterprises and multiple natural persons, a first type of node and a second type of node, where the first type of node represents an enterprise and the second type of node represents a natural person;

a connection relationship establishing unit 72, configured to establish a connection relationship between nodes based on a transaction relationship between the enterprises and a control relationship between the enterprises and the natural person, where each node includes a first type node and a second type node, where, for two enterprises having a transaction relationship, a connection relationship exists between two first type nodes of the two enterprises respectively, and for an enterprise having a control relationship and a natural person, a connection relationship exists between a first type node of the enterprise and a second type node of the natural person;

and a community creating unit 73, configured to create, based on the connection relationship among the nodes, when there is a closed-loop relationship in the connection relationship, an enterprise community based on each enterprise represented by each first-type node included in the closed-loop relationship, where the enterprise community includes each enterprise represented by each first-type node.

By using the graph database creating device shown in fig. 7, the connection relationship between the first type of nodes representing enterprises and the second type of nodes representing natural persons is established, the connection relationship comprises the transaction relationship between enterprises and the control relationship between the enterprises and the natural persons, and convenience is provided for inquiring the relationship between the enterprises and the natural persons; in addition, when a closed-loop relationship exists in the connection relationship, an enterprise community is created based on the enterprises represented by the first-class nodes in the closed-loop relationship, and the cooperation relationship among the enterprises is conveniently inquired.

In one embodiment, the apparatus for creating a graph database may further include:

Corresponding to the enterprise data query method, an embodiment of the present invention further provides an enterprise data query device, as shown in fig. 8, where fig. 8 is a schematic structural diagram of the enterprise data query device provided in the embodiment of the present invention, and the enterprise data query device includes:

an enterprise information obtaining unit 81, configured to obtain enterprise information of an enterprise to be queried, as the enterprise information to be queried;

the node query unit 82 is configured to query, based on information of an enterprise to be queried, a first type node and a second type node, which have a connection relationship with a first type node representing the enterprise to be queried, from a pre-created graph database, as an associated first type node and an associated second type node, where the first type node represents the enterprise, the second type node represents a natural person, a transaction relationship exists between the enterprises represented by two first type nodes having a connection relationship, and a control relationship exists between the enterprise represented by the first type node and the second type node having a connection relationship;

the enterprise query unit 83 is configured to query, from the graph database, enterprises included in an enterprise community to which the enterprise to be queried belongs, where each enterprise represented by each first-class node included in a closed-loop relationship in a connection relationship between nodes in the graph database belongs to one enterprise community;

the display unit 84 is configured to display a first class node representing an enterprise to be queried, an associated first class node and an associated second class node, nodes corresponding to the enterprise and a natural person included in an enterprise community to which the enterprise to be queried belongs, and a connection relationship between the displayed nodes.

By adopting the enterprise data query device shown in fig. 8, not only can the enterprise having a transaction relationship with the enterprise to be queried and the natural person having a control relationship with the enterprise to be queried, but also the enterprise contained in the enterprise community to which the enterprise to be queried belongs can be queried, and the query result is displayed in the connection relationship between the nodes, so that the transaction relationship between the enterprises and the control relationship between the enterprise and the natural person can be visually reflected, each first-class node contained in the closed-loop relationship in the connection relationship of the nodes, namely, the enterprise contained in the enterprise community to which the enterprise to be queried belongs can be visually reflected, and the query result is enriched.

In one embodiment, there is an arrow in the above-illustrated connection line representing the connection relationship between two first-type nodes, and the direction pointed by the arrow indicates that the enterprise that has issued the invoice points to the enterprise that has accepted the invoice.

In one embodiment, the graph database further establishes a corresponding relationship between an enterprise community and a community number, and the enterprise data query device further includes:

In an embodiment, a ranking table is created in the graph database, where the ranking table includes ranking results obtained by ranking a plurality of enterprises according to preset indicators of the enterprises, respectively, and the enterprise data query apparatus may further include:

Corresponding to the method for creating a graph database, the embodiment of the present invention further provides an electronic device, as shown in fig. 9, including a processor 91, a communication interface 92, a memory 93 and a communication bus 94, wherein the processor 91, the communication interface 92, and the memory 93 communicate with each other via the communication bus 94,

a memory 93 for storing a computer program;

the processor 91, when executing the program stored in the memory 93, implements the following steps:

aiming at a plurality of enterprises and a plurality of natural persons, a first class node and a second class node are created, wherein the first class node represents an enterprise, and the second class node represents a natural person;

establishing a connection relation between nodes based on a transaction relation between enterprises and a control relation between the enterprises and natural persons, wherein each node comprises a first class node and a second class node, the connection relation between the two first class nodes of the two enterprises is respectively represented aiming at the two enterprises with the transaction relation, and the connection relation between the first class node of the enterprise and the second class node representing the natural persons is represented aiming at the enterprises with the control relation and the natural persons;

and based on the connection relation among the nodes, when the connection relation has a closed-loop relation, creating an enterprise community based on the enterprises represented by the first-class nodes contained in the closed-loop relation, wherein the enterprise community comprises the enterprises represented by the first-class nodes.

Corresponding to the enterprise data query method, another electronic device according to the embodiment of the present invention is further provided, as shown in fig. 10, including a processor 101, a communication interface 102, a memory 103, and a communication bus 104, where the processor 101, the communication interface 102, and the memory 103 communicate with each other through the communication bus 104,

a memory 103 for storing a computer program;

the processor 101 is configured to implement the following steps when executing the program stored in the memory 103:

based on enterprise information to be queried, querying a first class node and a second class node which have a connection relation with a first class node representing an enterprise to be queried from a pre-created graph database to serve as a related first class node and a related second class node, wherein the first class node represents the enterprise, the second class node represents a natural person, a transaction relation exists between the enterprises represented by the two first class nodes having the connection relation, and a control relation exists between the enterprises represented by the first class node and the second class node having the connection relation and the natural person;

inquiring enterprises contained in an enterprise community to which the enterprise to be inquired belongs from a graph database, wherein each enterprise represented by each first type node contained in a closed loop relation in a connection relation of each node in the graph database belongs to one enterprise community;

and displaying the first class nodes representing the enterprises to be queried, associating the first class nodes with the second class nodes, displaying the nodes respectively corresponding to the enterprises and the natural persons contained in the enterprise community to which the enterprises to be queried belong, and displaying the connection relationship between the displayed nodes.

The communication bus mentioned in the electronic device may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The communication bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown, but this does not mean that there is only one bus or one type of bus.

The communication interface is used for communication between the electronic equipment and other equipment.

The Memory may include a Random Access Memory (RAM) or a Non-Volatile Memory (NVM), such as at least one disk Memory. Optionally, the memory may also be at least one memory device located remotely from the processor.

The Processor may be a general-purpose Processor, including a Central Processing Unit (CPU), a Network Processor (NP), and the like; but may also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic device, discrete hardware component.

In yet another embodiment provided by the present invention, a computer-readable storage medium is further provided, in which a computer program is stored, which, when being executed by a processor, implements the steps of any of the above-described methods for creating a graph database.

In yet another embodiment of the present invention, another computer-readable storage medium is provided, in which a computer program is stored, and the computer program, when executed by a processor, implements the steps of any of the above-mentioned enterprise data query methods.

In yet another embodiment provided by the present invention, there is also provided a computer program product containing instructions which, when run on a computer, cause the computer to perform the method of creating any of the graph databases described in the above embodiments.

In yet another embodiment, the present invention provides another computer program product containing instructions, which when executed on a computer, causes the computer to execute any of the above-mentioned enterprise data query methods.

In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the invention to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website site, computer, server, or data center to another website site, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.

It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.

All the embodiments in the present specification are described in a related manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the related apparatus embodiments, electronic device embodiments, computer-readable storage medium embodiments, and computer program product embodiments, the description is relatively simple because they are substantially similar to the method embodiments, and reference may be made to some descriptions of the method embodiments for related points.

The above description is only for the preferred embodiment of the present invention, and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention shall fall within the protection scope of the present invention.

Claims

1. A method of creating a graph database, comprising:

2. The method of claim 1, further comprising:

3. The method of claim 1, further comprising:

4. The method of claim 1, further comprising:

and generating a ranking list containing the ranking results.

5. An enterprise data query method, comprising:

6. The method according to claim 5, wherein the illustrated connection line representing the connection relationship between two nodes of the first type has an arrow, and the direction pointed by the arrow indicates that the enterprise making the invoice points to the enterprise receiving the invoice.

7. The method according to claim 5, wherein a correspondence between business communities and community numbers is also established in the graph database, the method further comprising:

obtaining a community number to be inquired;

8. The method according to claim 5, wherein a ranking table is created in the graph database, the ranking table comprising ranking results obtained by ranking the plurality of businesses according to preset indicators of the businesses, respectively, the method further comprising:

and displaying the rank of the enterprise to be queried.

9. An apparatus for creating a graph database, comprising:

10. An enterprise data query device, comprising: