CN108664582B - Enterprise relation query method and device, computer equipment and storage medium - Google Patents
Enterprise relation query method and device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN108664582B CN108664582B CN201810420988.5A CN201810420988A CN108664582B CN 108664582 B CN108664582 B CN 108664582B CN 201810420988 A CN201810420988 A CN 201810420988A CN 108664582 B CN108664582 B CN 108664582B
- Authority
- CN
- China
- Prior art keywords
- enterprise
- graph
- data
- graph structure
- relationship
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 49
- 238000000547 structure data Methods 0.000 claims abstract description 101
- 238000004364 calculation method Methods 0.000 claims abstract description 15
- 238000004590 computer program Methods 0.000 claims description 14
- 230000006399 behavior Effects 0.000 claims description 9
- 238000005516 engineering process Methods 0.000 abstract description 7
- 238000010586 diagram Methods 0.000 description 12
- 230000009471 action Effects 0.000 description 6
- 238000007726 management method Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000013500 data storage Methods 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application relates to a method and a device for querying enterprise relationships, computer equipment and a storage medium, wherein the query method comprises the following steps: acquiring a query instruction of an enterprise relationship, wherein the query instruction comprises an enterprise identifier or enterprise personnel information; acquiring corresponding graph structure data from a graph structure data storage system through a graph calculation engine according to a graph query language obtained by converting the query instruction; and displaying the corresponding enterprise relation map according to the map structure data. The query instruction of the enterprise relation is obtained, the query instruction is converted into the graph query language, the corresponding graph structure data is obtained from the graph structure data storage system through the graph calculation engine according to the graph query language, and the corresponding enterprise relation graph is displayed according to the graph structure data, so that the technical problems of complex data query and low efficiency in the traditional technology are solved.
Description
Technical Field
The present application relates to the field of internet technologies, and in particular, to a method and an apparatus for querying an enterprise relationship, a computer device, and a storage medium.
Background
With the rapid development of the internet industry, when enterprise relationships are queried, enterprise data have the characteristics of large data volume, various data forms, real-time update dynamic forms, complex association among enterprises or individuals and the like.
In the conventional technology, enterprise relationship query is performed through a relationship model in a relational database, and data corresponding to enterprise relationship is mainly represented through rows of a data table in the relational database. Namely, the data in the data table is continuously iterated by associating the data tables in the relational database so as to realize the query of the enterprise relation.
However, with the rapid increase of business data volume and the increase of dependency and complexity of internal relationships of enterprise data, especially for internet enterprises with complex business, the method for performing enterprise relationship query based on the relational database has the technical problems of complex data query and low efficiency.
Disclosure of Invention
Therefore, it is necessary to provide an enterprise relationship query method, an enterprise relationship query device, a computer device, and a storage medium capable of improving query efficiency, in order to solve the technical problems of complex data query and low efficiency in the method for performing enterprise relationship query based on a relational database in the conventional technology.
A method for querying enterprise relationships comprises the following steps: acquiring a query instruction of an enterprise relationship, wherein the query instruction comprises an enterprise identifier or enterprise personnel information; according to a graph query language obtained by converting a query instruction, acquiring corresponding graph structure data from a graph structure data storage system through a graph calculation engine, wherein the graph structure data comprises vertex attributes corresponding to vertexes in a graph structure, and the vertex attributes are used for representing enterprise identification or enterprise personnel information; and displaying the corresponding enterprise relation map according to the map structure data.
In one embodiment, the enterprise relationship graph is provided with a hierarchical display condition; after the displaying of the corresponding enterprise relationship map, the method further includes: acquiring a hierarchy trigger instruction corresponding to a hierarchy display condition of the enterprise relation map; and displaying the enterprise relation map corresponding to the hierarchy display condition according to the hierarchy triggering instruction.
In one embodiment, the enterprise relationship graph comprises a plurality of vertexes, and the vertexes are respectively provided with focusing instructions; after the displaying of the corresponding enterprise relationship map, the method further includes: acquiring a focusing instruction corresponding to any vertex in the plurality of vertexes; and displaying the enterprise relation map corresponding to the vertex according to the focusing instruction.
In one embodiment, the obtaining the focusing instruction corresponding to any vertex of the plurality of vertices includes: acquiring a click behavior of any vertex in the enterprise relation map, and triggering a corresponding focusing instruction according to the click behavior; or acquiring query keywords input according to the displayed enterprise relationship map, and determining a corresponding focusing instruction according to the query keywords.
In one embodiment, before the obtaining the query instruction of the business relationship, the method further includes: generating the graph structure data.
In one embodiment, the generating the graph structure data includes: acquiring enterprise data from a relational database, wherein the enterprise data comprises data corresponding to at least one of enterprise identification, enterprise personnel information, a relationship between an enterprise and an enterprise, a relationship between an enterprise and the enterprise personnel, and a relationship between the enterprise personnel and the enterprise personnel; and modeling the acquired enterprise data by using a graph structure to obtain and store the modeled graph structure data.
In one embodiment, the modeling the obtained enterprise data using a graph structure includes: modeling the enterprise identification and the enterprise personnel information as vertexes in a graph structure, and modeling the corresponding vertex attributes of the enterprise identification and the enterprise personnel information; modeling at least one of relationships between an enterprise and an enterprise, relationships between an enterprise and the enterprise personnel, and relationships between the enterprise personnel and the enterprise personnel as an edge in a graph structure; and modeling data corresponding to at least one of the relationship between the enterprises, the relationship between the enterprises and the enterprise personnel and the relationship between the enterprise personnel and the enterprise personnel as corresponding edge attributes.
An apparatus for querying business relationships, comprising:
and the query instruction acquisition module is used for acquiring a query instruction of the enterprise relationship, wherein the query instruction comprises an enterprise identifier or enterprise personnel information.
And the graph structure data acquisition module is used for acquiring corresponding graph structure data from the graph structure data storage system through a graph calculation engine according to the graph query language obtained by converting the query instruction, and the vertex attribute is used for representing enterprise identification or enterprise personnel information.
And the enterprise relation map display module is used for displaying the corresponding enterprise relation map according to the map structure data.
A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the method steps of any of the above embodiments when executing the computer program.
A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the method steps of any of the above embodiments.
According to the enterprise relation query method, the enterprise relation query device, the computer equipment and the storage medium, the query instruction is converted into the graph query language by obtaining the query instruction of the enterprise relation, the corresponding graph structure data is obtained from the graph structure data storage system through the graph calculation engine according to the graph query language, and the corresponding enterprise relation graph is displayed according to the graph structure data, so that the technical problems that data query is complex and the efficiency is low in the traditional technology are solved.
Drawings
FIG. 1 is a diagram of an application environment for a method of enterprise relational query in one embodiment;
FIG. 2 is a flow diagram that illustrates a methodology for querying business relationships, under an embodiment;
FIG. 3 is a schematic diagram of a graph structure in one embodiment;
FIG. 4 is a schematic flow chart of the corresponding embodiment of FIG. 2 after step S230;
FIG. 5 is a schematic flow chart of the corresponding embodiment of FIG. 2 after step S230;
FIG. 6 is a diagram of an application environment of a business relationship query method in accordance with another embodiment;
FIG. 7 is a schematic flow chart of generating graph structure data according to yet another embodiment;
FIG. 8 is a flowchart illustrating the step S720 in the corresponding embodiment of FIG. 7;
FIG. 9 is a flowchart illustrating a method for querying business relationships in one embodiment;
FIG. 10 is a diagram illustrating the structure of a graph representing business relationships, in one embodiment;
FIG. 11 is an interface diagram of a two-tier enterprise relationship graph in one embodiment;
FIG. 12 is an interface diagram of a one-level enterprise relationship graph, under an embodiment;
FIG. 13 is an interface diagram of an enterprise relationship graph corresponding to a focus instruction in one embodiment;
FIG. 14 is a block diagram that illustrates the architecture of the enterprise relational query device in one embodiment;
FIG. 15 is a diagram showing an internal structure of a computer device according to an embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.
The application provides an enterprise relationship query method, which can be applied to an application environment shown in fig. 1. In which the terminal 110 communicates with the graph data server 120 through a network. The terminal 110 is used for receiving a query instruction of the enterprise relation input by a user. Wherein, the query instruction contains enterprise identification or enterprise personnel information. The terminal 110 is further configured to send a query instruction of the business relationship to the graph data server 120 through the network. The graph data server 120 obtains the query for the business relationship and converts the query into a graph query language. The graph data server 120 searches the corresponding graph structure data from the graph structure data storage system through the graph calculation engine according to the converted graph query language. The graph structure data comprises vertex attributes corresponding to the vertices in the graph structure, and the vertex attributes are used for representing enterprise identification or enterprise personnel information. The graph data server 120 transmits the searched graph structure data to the terminal 110. The terminal 110 receives the corresponding graph structure data and displays the corresponding enterprise relationship graph according to the received graph structure data. The terminal 110 may be, but not limited to, various personal computers, notebook computers, smart phones, tablet computers, and portable wearable devices, and the graph data server 120 may be implemented by an independent server or a server cluster formed by a plurality of servers.
In an embodiment, as shown in fig. 2, a method for querying an enterprise relationship is provided, which is described by taking the method as an example applied to the terminal and the graph data server in fig. 1, and includes the following steps:
and S210, acquiring a query instruction of the enterprise relationship.
The enterprise refers to a legal person or other socioeconomic organization which provides goods or services to the market by using various production elements and implements autonomous operation, self-burden profit and loss and independent accounting for profit and profit. The enterprise relationship refers to at least one of a relationship between the enterprise and the enterprise, a relationship between the enterprise and the enterprise personnel, and a relationship between the enterprise personnel and the enterprise personnel. The query instruction refers to a query keyword received by the terminal, and the query instruction may contain enterprise identification or enterprise personnel information. Wherein, the enterprise identification refers to an identification for uniquely representing the enterprise. The business person information refers to information indicating business persons, such as names of the business persons or photo information of the business persons. Specifically, after receiving the input enterprise identifier or enterprise personnel information, the terminal sends the enterprise identifier or enterprise personnel information to the graph data server through the network, that is, the graph data server obtains the enterprise identifier or enterprise personnel information.
And S220, acquiring corresponding graph structure data from the graph structure data storage system through the graph calculation engine according to the graph query language converted by the query instruction.
Graph query language refers to a data query language that can be used for relational queries based on graph computation engines. Wherein, the graph computation engine refers to the operation environment of the graph structure data. The graph structure data includes vertex attributes corresponding to vertices in the graph structure, the vertex attributes representing enterprise identification or enterprise personnel information. In this embodiment, the graph structure data refers to an ordered set composed of a plurality of graphic data elements in a certain relationship. The graph structure data is used for representing the geometrical relationship and the topological relationship among elements corresponding to the data. The graph structure is a data structure for representing complex relationships, and comprises a finite and non-empty set of vertexes and a set of edges between the vertexes, and corresponding attributes can be set on the vertexes and the edges. The graph structure may be represented by G ═ V, E, or may be represented by G ═ V, E, D. G, V, E, D are capital letters of Graph, Vertex, Edge, and Data, respectively. The graphic data elements may be vertices in a graph structure, edges in a graph structure, or attributes corresponding to the vertices and the edges. Referring to fig. 3, circles represent vertices, connecting lines between the circles represent edges, arabic numerals filled in the circles represent vertex attributes, and arrows on the connecting lines represent edge attributes.
Specifically, the graph data server acquires the enterprise identifier or the enterprise personnel information from the terminal through the network, and converts the acquired enterprise identifier or the enterprise personnel information into the graph query language. And the graph data server retrieves and obtains corresponding graph structure data in the graph structure data through the graph calculation engine according to the graph query language. And the graph data server sends the retrieved graph structure data to the terminal so that the terminal can acquire the corresponding graph structure data.
And S230, displaying the corresponding enterprise relation map according to the map structure data.
The enterprise relation map is used for providing enterprise multi-dimensional information query and can deeply query at least one relation link among enterprises, enterprises and enterprise personnel. Specifically, the graph data server sends the retrieved graph structure data to the terminal, and the terminal displays the corresponding enterprise relationship graph according to the received graph structure data.
According to the enterprise relation query method, the query instruction of the enterprise relation is obtained, the query instruction is converted into the graph query language, the corresponding graph structure data is obtained from the graph structure data storage system through the graph calculation engine according to the graph query language, and the corresponding enterprise relation map is displayed according to the graph structure data, so that the technical problems that data query is complex and the efficiency is low in the traditional technology are solved.
In one embodiment, the enterprise relationship graph is provided with a hierarchical display condition. Referring to fig. 4, after displaying the corresponding enterprise relationship map, the method further includes the following steps:
and S410, acquiring a hierarchy trigger instruction corresponding to the hierarchy display condition of the enterprise relationship map.
The enterprise relation map is provided with corresponding hierarchical display conditions, and the hierarchical display conditions refer to conditions for limiting the relation number. The enterprise relationship map can display the corresponding enterprise relationship map according to the hierarchical display condition. The hierarchy triggering instruction refers to a triggering instruction for displaying an enterprise relationship map of different hierarchies. The level trigger instruction corresponds to the level display condition, for example, if the level display condition defines a maximum number of relationships, the level trigger instruction corresponds to the maximum number of relationships. The relation number is used for representing parameters of the path length between the vertexes in the graph structure. For example, referring to fig. 3, circles represent vertices, connecting lines between the circles represent edges, arabic numerals filled in the circles represent vertex attributes, and arrows on the connecting lines represent edge attributes. The number of relationships between vertex 1 and vertex 2 is 1, the correlation coefficient between vertex 2 and vertex 3 is 1, the correlation coefficient between vertex 3 and vertex 4 is 1, the correlation coefficient between vertex 2 and vertex 4 is 2, the correlation coefficient between vertex 1 and vertex 3 is 2, and the relationship data 3 between vertex 1 and vertex 4.
Specifically, the terminal receives the graph structure data sent by the graph data server, and displays the corresponding enterprise relation map according to the graph structure data, and the enterprise relation map is provided with corresponding hierarchical display conditions. When a user sends a triggering behavior corresponding to the hierarchy display condition on the enterprise relationship graph, the terminal can acquire a corresponding hierarchy triggering instruction.
And S420, displaying the enterprise relation map corresponding to the hierarchy display condition according to the hierarchy triggering instruction.
The enterprise relation map is provided with corresponding hierarchy display conditions, and the terminal receives hierarchy trigger instructions corresponding to the hierarchy display conditions. Because the hierarchy triggering instruction has a corresponding relation with the hierarchy display condition, the terminal can display the enterprise relation map corresponding to the hierarchy display condition according to the hierarchy triggering instruction.
In one embodiment, the enterprise relationship graph comprises a plurality of vertexes, and the plurality of vertexes are respectively provided with focusing instructions. Referring to fig. 5, after displaying the corresponding enterprise relationship map, the method further includes the following steps:
and S510, acquiring a focusing instruction corresponding to any vertex in the plurality of vertexes.
The focusing instruction refers to an instruction for focusing and displaying the enterprise relationship map, and the relationship number corresponding to the focusing instruction can be equal to a preset value. For example, the number of relationships of the focus command may be preset to 1. Specifically, the terminal receives the graph structure data sent by the graph data server, and displays the corresponding enterprise relationship graph according to the graph structure data. The enterprise relationship graph comprises a plurality of vertexes, and each vertex is provided with a corresponding focusing instruction. When a user sends a behavior corresponding to the focusing instruction on the enterprise relationship map, the terminal can acquire the focusing instruction corresponding to any vertex in the enterprise relationship map.
And S520, displaying the enterprise relation map corresponding to the vertex according to the focusing instruction.
And at any vertex in the enterprise relation map, the terminal acquires a focusing instruction corresponding to the vertex. The terminal can display the enterprise relation map corresponding to the vertex according to the obtained focusing instruction.
In one embodiment, obtaining a focus instruction corresponding to any vertex of the plurality of vertices comprises: acquiring a click behavior of any vertex in the enterprise relation map, and triggering a corresponding focusing instruction according to the click behavior; or acquiring query keywords input according to the displayed enterprise relationship map, and determining a corresponding focusing instruction according to the query keywords.
In this embodiment, the terminal may obtain the focusing instruction corresponding to any vertex through two ways. Firstly, a click action occurs at any vertex in the enterprise relation map, the terminal acquires the click action on the vertex, and a focusing instruction on the vertex is triggered according to the click action. And after the enterprise relation map is displayed, the enterprise relation map comprises a plurality of vertexes, and the vertex attributes comprise enterprise identifications or enterprise personnel information. The terminal can acquire the query keyword input in the enterprise relationship map display interface, and further determines the corresponding vertex according to the acquired query keyword, so that the focusing instruction corresponding to the vertex can be acquired.
In an embodiment, as shown in fig. 6, the query method for business relationships provided by this embodiment may be applied to the application environment shown in fig. 6. Wherein the relational database server 630 communicates with the graph data server 120 over a network. Relational database server 630 uses a web crawler to obtain the raw enterprise data from the internet. The relational database server 630 processes and stores the raw enterprise data as enterprise data, and the graph data server 120 may access the relational database server 630 via a network to obtain the enterprise data. The graph data server 120 obtains the enterprise data, models the enterprise data in a graph structure mode to obtain modeled graph structure data, and stores the modeled graph structure data through a graph data storage engine. Relational database server 630 may be implemented as a stand-alone server or as a server cluster of multiple servers.
In one embodiment, before obtaining the query instruction of the business relationship, the method further includes: and generating graph structure data corresponding to the enterprise relation.
Specifically, the graph data server generates graph structure data by obtaining enterprise data and modeling the enterprise data in a graph structure manner.
In an embodiment, please refer to fig. 7, the graph structure data corresponding to the enterprise relationship is generated and applied to the graph data server 120 in fig. 6 as an example for explanation. In this embodiment, before obtaining the query instruction of the enterprise relationship, generating graph structure data includes the following steps:
and S710, acquiring enterprise data from the relational database.
The enterprise data comprises data corresponding to at least one of enterprise identification, enterprise personnel information, relationships between enterprises and enterprise personnel, and relationships between enterprise personnel and enterprise personnel. The enterprise identity refers to an identity for uniquely representing an enterprise. Enterprise personnel refer to personnel who play an important role in the enterprise and are responsible for the operation of the enterprise. A relationship between an enterprise and an enterprise refers to the existence of a direct or indirect control relationship or other influence relationship between one enterprise and another enterprise. A relationship between a business and business personnel refers to the associative relationship that exists between a business and its corresponding business personnel. Relationships between business personnel and business personnel refer to the dependencies that exist between business personnel in an enterprise.
Specifically, the relational database server stores enterprise data, and the graph data server obtains corresponding enterprise data from the relational database through a network.
S720, modeling is carried out on the obtained enterprise data by using the graph structure, and the graph structure data after modeling is obtained and stored.
Specifically, the enterprise data is obtained from the relational database, and the enterprise identifier, the enterprise personnel, the relationship between the enterprise and the enterprise personnel, and the relationship between the enterprise personnel and the enterprise personnel can be modeled by using the vertexes and edges in the graph structure. Data corresponding to enterprise identities, enterprise personnel, relationships between enterprises and enterprise personnel, and relationships between enterprise personnel and enterprise personnel can also be modeled using the vertex attributes and edge attributes in the graph structure. Thereby obtaining graph structure data corresponding to the enterprise data after modeling.
According to the enterprise relation query method, the enterprise data are obtained from the relational database, modeling is carried out on the enterprise data in a graph structure mode, and the graph structure data after modeling are obtained, so that the enterprise data are directly modeled into the graph structure data, and the technical problem that the enterprise data correlation is poor due to the relational database is solved. And enterprise data is directly modeled into graph structure data, so that the query efficiency is improved when a user queries the enterprise relation.
In one embodiment, modeling the obtained enterprise data using a graph structure includes the steps of:
s810, modeling the enterprise identification and the enterprise personnel information as vertexes in a graph structure, and modeling data corresponding to the enterprise identification and the enterprise personnel as corresponding vertex attributes.
The enterprise identities may be modeled as vertices of a graph structure, and the enterprise personnel may also be modeled as vertices of a graph structure. For example, the business identifier may be a business name or a business logo, and the business name or the business logo may be modeled as a vertex of the graph structure. The enterprise personnel may be specifically the director of the enterprise, or the legal representative of the enterprise, or the shareholder, and then the director of the enterprise, the legal representative of the enterprise, or the shareholder may be modeled as the vertex of the graph structure.
The enterprise data includes data corresponding to enterprise identification and/or data corresponding to enterprise personnel. Data corresponding to enterprise identities may be modeled as vertex attributes, and data corresponding to enterprise personnel may also be modeled as vertex attributes. For example, the data corresponding to the business identifier may be a business name, such as XX corporation, or a business logo, such as trademark. The data corresponding to the enterprise personnel can be the name of director of the enterprise, the name of legal representative of the enterprise, and the name of shareholder. The name may be in chinese or english. Zhang, Zhang.
S820, modeling at least one of the relationship between enterprises, the relationship between enterprises and enterprise personnel and the relationship between enterprise personnel as an edge in a graph structure; and modeling data corresponding to at least one of the relationship between the enterprises, the relationship between the enterprises and the personnel of the enterprises and the relationship between the personnel of the enterprises as the corresponding edge attribute.
Relationships between enterprises and between enterprise personnel can be modeled as edges, relationships between enterprises and enterprise personnel can be modeled as edges, and relationships between enterprise personnel and enterprise personnel can be modeled as edges. For example, the relationship between an enterprise and an enterprise may be a stock-controlling relationship, or an affiliation, and the stock-controlling relationship and the affiliation are modeled as edges. The relationship between the enterprise and the enterprise personnel can be an investment relationship or a management relationship, and the investment relationship and the management relationship are modeled as edges. The relationship between the enterprise personnel and the enterprise personnel can be a couple relationship or a relativity relationship, and the couple relationship and the relativity relationship are modeled as edges.
The enterprise data comprises data corresponding to at least one of the relationship between enterprises, the relationship between enterprises and enterprise personnel and the relationship between enterprise personnel and enterprise personnel. Data corresponding to relationships between enterprises can be modeled as edge attributes, data corresponding to relationships between enterprises and enterprise personnel can be modeled as edge attributes, and data corresponding to at least one relationship among relationships between enterprise personnel can be modeled as edge attributes. For example, the data corresponding to the relationship between the enterprise and the enterprise personnel may be the investment proportion or the investment amount, or may be the high management position. Such as general manager, board of directors, proctor, etc. The data corresponding to the relationship between the enterprise personnel and the enterprise personnel can be couples, relatives and the like.
In the method for inquiring the enterprise relationship, the enterprise identifier and the enterprise personnel are modeled as vertexes, at least one of the relationship among the enterprises, the relationship among the enterprises and the enterprise personnel and the relationship among the enterprise personnel is modeled as an edge, the data corresponding to the enterprise identifier and the enterprise personnel is modeled as a vertex attribute, and the data corresponding to at least one of the relationship among the enterprises, the relationship among the enterprises and the enterprise personnel and the relationship among the enterprise personnel is modeled as an edge attribute, so that the graph structure modeling of the enterprise data is realized, and the technical problem of poor enterprise data correlation caused by simple relational data modeling is solved. And enterprise data is directly modeled into graph structure data, so that the query efficiency is improved when a user queries the enterprise relation.
In one embodiment, please refer to fig. 9, which also provides a method for querying a business relationship, including the following steps:
s910, acquiring enterprise data from the relational database.
The relational database server stores enterprise data, and the graph data server acquires corresponding enterprise data from the relational database through a network. The enterprise data comprises data corresponding to at least one of enterprise identification, enterprise personnel, relationships between enterprises and personnel, and relationships between enterprise personnel and personnel. For example, referring to fig. 9, the enterprise-originated data includes data corresponding to company a, company b, company c, zhang san, lie si, a control relationship existing between company a and company b, an affiliation existing between company c and company b, a participation behavior of zhang three pairs of company a, a legal representative of zhang san as company b, an investment relationship of lie si and company c, a director of lie si as company a, and a couple relationship between zhang san and lie si.
S920, modeling the enterprise identification and the enterprise personnel information as vertexes in a graph structure, and modeling data corresponding to the enterprise identification and the enterprise personnel as corresponding vertex attributes.
The enterprise identities may be modeled as vertices of a graph structure, and the enterprise personnel may also be modeled as vertices of a graph structure. Data corresponding to enterprise identities may be modeled as vertex attributes, and data corresponding to enterprise personnel may also be modeled as vertex attributes. For example, referring to fig. 10, company a, company b, company c, zhang san, and lie four will be modeled as vertices of the graph structure. The data corresponding to the enterprise identification are company A, company B and company C respectively, and the data corresponding to the enterprise personnel are Zhang three and Li four respectively.
S930, modeling at least one of the relationship between the enterprises, the relationship between the enterprises and the personnel of the enterprises and the relationship between the personnel of the enterprises as an edge in a graph structure; and modeling data corresponding to at least one of the relationship between the enterprises, the relationship between the enterprises and the personnel of the enterprises and the relationship between the personnel of the enterprises as the corresponding edge attribute.
Relationships between enterprises and between enterprise personnel can be modeled as edges, relationships between enterprises and enterprise personnel can be modeled as edges, and relationships between enterprise personnel and enterprise personnel can be modeled as edges. Data corresponding to relationships between enterprises can be modeled as edge attributes, data corresponding to relationships between enterprises and enterprise personnel can be modeled as edge attributes, and data corresponding to at least one relationship among relationships between enterprise personnel can be modeled as edge attributes. For example, referring to fig. 10, the control relationship between company a and company b, the affiliation relationship between company c and company b, the participation relationship between zhang and company a, the corporate representation of zhang and company b, the investment relationship between lie four and company c, the director of lie four and company a, and the couple relationship between zhang and lie four are modeled as edges of the graph structure. Modeling the stock control proportion data corresponding to the control relationship between the company A and the company B as an edge attribute between the company A and the company B, modeling the membership data between the company C and the company B as an edge attribute between the company C and the company B, modeling the reference data of the Zhang three pairs of the company A as an edge attribute between the Zhang three pairs of the company A, modeling the legal representative of the Zhang three pairs of the company B as an edge attribute between the Zhang three pairs of the company B and the company B, modeling the data corresponding to the investment of the Li four pairs of the company C as an edge attribute between the Li four pairs of the company C and the company C, modeling the Li four as the director of the company A as an edge attribute between the Li four pairs of the company A and the company A, and modeling the couple relationship between the Zhang three pairs of the company C and the Li four as an edge attribute between the Zhang three pairs of the company.
And S940, obtaining and storing the modeled graph structure data.
And modeling the enterprise data by using the vertexes, edges, attributes of the vertexes and attributes of the edges in the graph structure to obtain graph structure data corresponding to the enterprise data after modeling, and storing the graph structure data in a graph data storage system.
S950, obtaining a query instruction of the enterprise relationship.
And the terminal receives the input enterprise identification or enterprise personnel information. The terminal sends the enterprise identification or the enterprise personnel information to the graph data server through the network, namely the graph data server obtains the enterprise identification or the enterprise personnel information.
S960, according to the graph query language converted by the query instruction, acquiring corresponding graph structure data from the graph structure data storage system through the graph calculation engine,
the graph data server acquires the enterprise identification or the enterprise personnel information from the terminal through the network, and converts the acquired enterprise identification or the enterprise personnel information into graph query language. And the graph data server converts the query instruction into a graph query language, so that the graph structure data is retrieved and obtained in the graph structure data through the graph calculation engine according to the graph query language. And the graph data server sends the retrieved graph structure data to the terminal, so that the terminal acquires the corresponding graph structure data.
And S970, displaying the corresponding enterprise relation map according to the map structure data.
And the graph data server sends the retrieved graph structure data to the terminal, and the terminal displays the corresponding enterprise relation graph according to the received graph structure data.
S980, acquiring a hierarchy trigger instruction corresponding to the hierarchy display condition of the enterprise relationship map; and displaying the enterprise relation map corresponding to the hierarchy display condition according to the hierarchy triggering instruction.
And the terminal receives the graph structure data sent by the graph data server and displays the corresponding enterprise relationship graph according to the graph structure data. And the enterprise relation map is provided with corresponding hierarchy display conditions, and the terminal can acquire hierarchy trigger instructions corresponding to the hierarchy display conditions. Therefore, the terminal can display the enterprise relation map corresponding to the hierarchy display condition according to the hierarchy triggering instruction.
For example, it is assumed that the enterprise relationship graph is provided with two levels, that is, the enterprise relationship graph is provided with two corresponding level display conditions, and the level display conditions are related to the relationship numbers. And the terminal receives the graph structure data sent by the graph data server and displays the corresponding enterprise relationship graph according to the graph structure data.
Referring to FIG. 11, the enterprise relationship graph shows a two-tier structure by default. The hierarchical display conditions corresponding to the second-layer enterprise relation map are as follows: the relation number is less than or equal to 3, and the level display conditions corresponding to the enterprise relation map of one layer are as follows: and if the correlation coefficient is less than or equal to 2, only the vertices with the correlation number less than or equal to 3 and the enterprise relations among the vertices are displayed in the two-layer enterprise relation graph, and only the vertices with the correlation coefficient less than or equal to 2 and the enterprise relations among the vertices are displayed in the one-layer enterprise relation graph. For example, the number of relationships between vertex AXY and vertex XXX is 1, the number of relationships between vertex XXX and vertex ABC is 1, the number of relationships between vertex ABC and vertex BAC is 1, the number of relationships between vertex AXY and vertex ABC is 2, and the number of relationships between vertex AXY and vertex BAC is 3.
When the terminal acquires the level triggering instruction of "one level", referring to fig. 12, the terminal may only display the vertices of which the relation coefficients are less than or equal to 2 and the enterprise relations among the vertices according to the level triggering instruction of "one level". For example, the number of relationships between the vertex AXY and the company AA, the company XX, the company BB, and the like is 1, and the number of relationships between the vertex AXY and the company XYZ and the vertex AAB is 2.
S990, acquiring a focusing instruction corresponding to any vertex of the multiple vertexes; and displaying the enterprise relation map corresponding to the vertex according to the focusing instruction.
And the terminal displays the corresponding enterprise relation map according to the received map structure data. The enterprise relationship graph comprises a plurality of vertexes, and each vertex is provided with a corresponding focusing instruction. The terminal can acquire the focusing instruction corresponding to any vertex in the enterprise relationship map, so that the enterprise relationship map corresponding to the vertex can be displayed according to the acquired focusing instruction.
For example, when the correlation coefficient corresponding to the focusing instruction is 1, that is, when the terminal acquires the focusing instruction at any vertex, the enterprise relationship map only displays the vertex with the correlation coefficient of 1 and the enterprise relationship between the vertices. Referring to fig. 13, for example, in the displayed business relationship map, the relationship numbers between the vertex AXY and the vertices AA, XX, BB, AB, XXX, YY, BA, etc. are respectively 1.
The terminal can acquire the focusing instruction corresponding to any vertex in two ways. For example, firstly, a click action occurs at a vertex AXY in the enterprise relationship graph, the terminal acquires the click action on the vertex AXY, and triggers a focusing instruction of the vertex AXY according to the click action, and only the vertices with a relation coefficient of 1 with the vertex AXY and the enterprise relationships among the vertices are displayed. After the enterprise relationship graph is displayed, the enterprise relationship graph includes a plurality of vertexes, for example, vertex AXY and vertex AA company, vertex XX company, vertex BB company, vertex AB company, vertex XXX, vertex YY company, vertex BA company, and the like. The terminal can acquire a query keyword input in the enterprise relationship map display interface, for example, input "AXY" in a text box corresponding to "focus", and further determine a corresponding vertex according to the query keyword "AXY", so that a focus instruction corresponding to the vertex can be acquired.
In the embodiment, the enterprise data is obtained from the relational database, modeling is performed on the enterprise data in a graph structure mode, and the graph structure data after modeling is obtained, so that the enterprise data is directly modeled into the graph structure data, and the technical problem of poor enterprise data relevance is solved. Furthermore, the query instruction of the enterprise relationship is obtained, the query instruction is converted into the graph query language, the corresponding graph structure data is obtained from the graph structure data storage system through the graph calculation engine according to the graph query language, and the corresponding enterprise relationship map is displayed according to the graph structure data, so that the technical problems of complex data query and low efficiency in the traditional technology are solved.
It should be understood that although the various steps in the flowcharts of fig. 2, 3, 5 and 7-9 are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least some of the steps in fig. 2, 3, 5 and 7-9 may include multiple sub-steps or multiple stages that are not necessarily performed at the same time, but may be performed at different times, and the order of performing the sub-steps or stages is not necessarily sequential, but may be performed alternately or alternatingly with other steps or at least some of the sub-steps or stages of other steps.
In one embodiment, as shown in fig. 14, there is provided an apparatus 1400 for querying business relationships, comprising: a query instruction obtaining module 1410, a graph query language conversion module 1420, a graph structure data obtaining module 1430 and an enterprise relationship map display module 1440, wherein:
and the query instruction obtaining module 1410 is configured to obtain a query instruction of the enterprise relationship, where the query instruction includes an enterprise identifier or enterprise personnel information.
The graph structure data obtaining module 1420 obtains, according to the graph query language converted from the query instruction, corresponding graph structure data from the graph structure data storage system through the graph calculation engine, where the graph structure data includes vertex attributes corresponding to vertices in a graph structure, and the vertex attributes are used to represent enterprise identifications or enterprise personnel information.
And the enterprise relationship map display module 1430 is configured to display the corresponding enterprise relationship map according to the map structure data.
For the specific definition of the query device regarding the business relationship, reference may be made to the above definition of the query method regarding the business relationship, and details are not described herein again. The modules in the enterprise-related query device can be implemented in whole or in part by software, hardware and a combination thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.
In one embodiment, a computer device is provided, which may be a terminal, and its internal structure diagram may be as shown in fig. 15. The computer device includes a processor, a memory, a network interface, a display screen, and an input device connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a method of querying business relationships. The display screen of the computer equipment can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, a key, a track ball or a touch pad arranged on the shell of the computer equipment, an external keyboard, a touch pad or a mouse and the like.
Those skilled in the art will appreciate that the architecture shown in fig. 15 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
In one embodiment, a computer device is provided, comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the method steps of the above embodiments when executing the computer program.
In an embodiment, a computer-readable storage medium is provided, on which a computer program is stored, which computer program, when being executed by a processor, carries out the method steps of the above-mentioned embodiments.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
The technical features of the above embodiments can be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the above embodiments are not described, but should be considered as the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (10)
1. A method for querying enterprise relationships is characterized by comprising the following steps:
acquiring a query instruction of an enterprise relationship, wherein the query instruction comprises an enterprise identifier or enterprise personnel information;
according to the graph query language obtained by converting the query instruction, acquiring corresponding graph structure data from a graph structure data storage system through a graph calculation engine, wherein the graph structure data comprises vertex attributes corresponding to vertexes in a graph structure, and the vertex attributes are used for representing enterprise identification or enterprise personnel information; the graph structure data further comprises edge attributes corresponding to edges in the graph structure, wherein the edge attributes are used for representing data corresponding to at least one of relationships among enterprises, relationships among enterprises and enterprise personnel and relationships among enterprise personnel;
displaying a corresponding enterprise relation map according to the map structure data, wherein the enterprise relation map is provided with corresponding hierarchy display conditions, the hierarchy display conditions correspond to hierarchy trigger instructions, and the hierarchy trigger instructions are used for displaying enterprise relation maps of different hierarchies;
acquiring a hierarchy trigger instruction corresponding to a hierarchy display condition of the enterprise relation map;
and displaying the enterprise relation map corresponding to the hierarchy display condition according to the hierarchy trigger instruction, wherein the hierarchy display condition is a condition for limiting a relation number, and the relation number is used for representing a parameter of the path length between a vertex and a vertex in a graph structure.
2. The method of claim 1, wherein the enterprise relationship graph comprises a plurality of vertices, each of the plurality of vertices provided with a focusing instruction; after the displaying of the corresponding enterprise relationship map, the method further includes:
acquiring a focusing instruction corresponding to any vertex in the plurality of vertexes;
and displaying the enterprise relation map corresponding to the vertex according to the focusing instruction.
3. The method of claim 2, wherein said obtaining a focus instruction corresponding to any one of the plurality of vertices comprises:
and acquiring a click behavior of any vertex in the enterprise relation map, and triggering a corresponding focusing instruction according to the click behavior.
4. The method of claim 2, wherein said obtaining a focus instruction corresponding to any one of the plurality of vertices comprises:
and acquiring query keywords input according to the displayed enterprise relation map, and determining a corresponding focusing instruction according to the query keywords.
5. The method of any one of claims 1 to 4, wherein the obtaining of the query instruction for the business relationship further comprises:
generating the graph structure data.
6. The method of claim 5, wherein the generating the graph structure data comprises:
acquiring enterprise data from a relational database, wherein the enterprise data comprises data corresponding to at least one of enterprise identification, enterprise personnel, a relationship between enterprises and the enterprise personnel, and a relationship between enterprise personnel and the enterprise personnel;
and modeling the acquired enterprise data by using a graph structure to obtain and store the modeled graph structure data.
7. The method of claim 6, wherein the modeling the obtained enterprise data using a graph structure comprises:
modeling the enterprise identification and the enterprise personnel information as vertexes in a graph structure, and modeling data corresponding to the enterprise identification and the enterprise personnel as corresponding vertex attributes;
modeling at least one of relationships between an enterprise and an enterprise, relationships between an enterprise and the enterprise personnel, and relationships between the enterprise personnel and the enterprise personnel as an edge in a graph structure; and modeling data corresponding to at least one of the relationship between the enterprises, the relationship between the enterprises and the enterprise personnel and the relationship between the enterprise personnel and the enterprise personnel as corresponding edge attributes.
8. An apparatus for querying business relationships, comprising:
the query instruction acquisition module is used for acquiring a query instruction of an enterprise relationship, wherein the query instruction comprises an enterprise identifier or enterprise personnel information;
the graph structure data acquisition module is used for acquiring corresponding graph structure data from a graph structure data storage system through a graph calculation engine according to a graph query language obtained by converting the query instruction, wherein the graph structure data comprises vertex attributes corresponding to the vertices in a graph structure, and the vertex attributes are used for representing enterprise identification or enterprise personnel information; the graph structure data further comprises edge attributes corresponding to edges in the graph structure, wherein the edge attributes are used for representing data corresponding to at least one of relationships among enterprises, relationships among enterprises and enterprise personnel and relationships among enterprise personnel;
the enterprise relation map display module is used for displaying a corresponding enterprise relation map according to the map structure data, the enterprise relation map is provided with corresponding hierarchy display conditions, the hierarchy display conditions correspond to hierarchy trigger instructions, and the hierarchy trigger instructions are used for displaying enterprise relation maps of different hierarchies;
the hierarchy triggering instruction acquisition module is used for acquiring a hierarchy triggering instruction corresponding to the hierarchy display condition of the enterprise relation map;
and the hierarchical enterprise map display module is used for displaying an enterprise relation map corresponding to the hierarchical display condition according to the hierarchical trigger instruction, wherein the hierarchical display condition is a condition for limiting a relation number, and the relation number is used for representing a parameter of the path length between a vertex and a vertex in a graph structure.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the steps of the method of any of claims 1 to 7 are implemented when the computer program is executed by the processor.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810420988.5A CN108664582B (en) | 2018-05-04 | 2018-05-04 | Enterprise relation query method and device, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810420988.5A CN108664582B (en) | 2018-05-04 | 2018-05-04 | Enterprise relation query method and device, computer equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108664582A CN108664582A (en) | 2018-10-16 |
| CN108664582B true CN108664582B (en) | 2021-06-18 |
Family
ID=63781943
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810420988.5A Active CN108664582B (en) | 2018-05-04 | 2018-05-04 | Enterprise relation query method and device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108664582B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109543073A (en) * | 2018-10-17 | 2019-03-29 | 深圳壹账通智能科技有限公司 | Enterprise's supply and marketing relation map generation method, device and computer equipment |
| CN109670048B (en) * | 2018-11-19 | 2023-06-23 | 平安科技（深圳）有限公司 | Atlas construction method and apparatus based on wind control management and computer device |
| CN109740034A (en) * | 2018-12-20 | 2019-05-10 | 北京华夏电通科技有限公司 | The case-involving information query method of enterprise and device based on graphic data base |
| CN110008220B (en) * | 2019-01-24 | 2024-03-15 | 平安科技（深圳）有限公司 | Method and device for obtaining attenuation coefficient of blacklist conduction spectrum and computer equipment |
| CN110442703B (en) * | 2019-07-04 | 2023-05-23 | 广东省华中粤创知识产权运营管理有限公司 | Knowledge graph-based information recommendation method and device and computer equipment |
| CN111104568B (en) * | 2019-12-17 | 2023-06-09 | 深圳前海环融联易信息科技服务有限公司 | Deep searching method and device for enterprise equity relationship, computer equipment and storage medium |
| CN111046247B (en) * | 2019-12-17 | 2023-06-13 | 深圳前海环融联易信息科技服务有限公司 | Directed graph-based depth search method and device, computer equipment and storage medium |
| CN113407578A (en) * | 2021-07-12 | 2021-09-17 | 上海数慧系统技术有限公司 | Data processing method and device |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106445931A (en) * | 2015-08-04 | 2017-02-22 | 阿里巴巴集团控股有限公司 | Database node association relationship display method and apparatus |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7373612B2 (en) * | 2002-10-21 | 2008-05-13 | Battelle Memorial Institute | Multidimensional structured data visualization method and apparatus, text visualization method and apparatus, method and apparatus for visualizing and graphically navigating the world wide web, method and apparatus for visualizing hierarchies |
| CN101256594A (en) * | 2008-03-25 | 2008-09-03 | 北京百问百答网络技术有限公司 | Method and system for measuring graph structure similarity |
| US9460187B2 (en) * | 2013-06-07 | 2016-10-04 | Vmware, Inc. | Creation of a graph database of a virtualization infrastructure |
| CN105138652B (en) * | 2015-08-28 | 2018-11-23 | 山东合天智汇信息技术有限公司 | A kind of enterprise's incidence relation recognition methods and system |
| CN106227800B (en) * | 2016-07-21 | 2020-02-21 | 中国科学院软件研究所 | Storage method and management system for highly-associated big data |
| CN106528822B (en) * | 2016-11-17 | 2019-12-27 | 山东合天智汇信息技术有限公司 | Enterprise relation circle construction method, enterprise relation circle query method and enterprise relation circle query system |
| CN107239665B (en) * | 2017-06-09 | 2020-03-10 | 京东方科技集团股份有限公司 | Medical information query system and method |
| CN107229756A (en) * | 2017-06-30 | 2017-10-03 | 山东合天智汇信息技术有限公司 | A kind of design method and system directly perceived for showing business connection collection of illustrative plates |
| CN107679160A (en) * | 2017-09-28 | 2018-02-09 | 深圳市华傲数据技术有限公司 | Data processing method and device based on chart database |
-
2018
- 2018-05-04 CN CN201810420988.5A patent/CN108664582B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106445931A (en) * | 2015-08-04 | 2017-02-22 | 阿里巴巴集团控股有限公司 | Database node association relationship display method and apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108664582A (en) | 2018-10-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108664582B (en) | Enterprise relation query method and device, computer equipment and storage medium | |
| CN111191221B (en) | Configuration method and device of authority resources and computer readable storage medium | |
| CN111192025A (en) | Occupational information matching method and device, computer equipment and storage medium | |
| CN111666370B (en) | Semantic indexing method and device for multi-source heterogeneous space data | |
| CN105550206B (en) | The edition control method and device of structured query sentence | |
| WO2020019454A1 (en) | Method and device for displaying risk data, computer apparatus and storage medium | |
| CN113742338A (en) | Structured storage system for project acceptance forms | |
| CN109767098A (en) | Processing method, device, computer equipment and the storage medium of product attribute | |
| CN109542962B (en) | Data processing method, data processing device, computer equipment and storage medium | |
| CN114253990A (en) | Database query method and device, computer equipment and storage medium | |
| CN110727777A (en) | Knowledge graph management method and device, computer equipment and storage medium | |
| CN113129155A (en) | Multi-type personnel information processing method, equipment and storage medium | |
| CN108196921B (en) | Document development method and device, computer equipment and storage medium | |
| CN116451074A (en) | Image generation method and device for target object, computer equipment and storage medium | |
| CN110688516A (en) | Image retrieval method, image retrieval device, computer equipment and storage medium | |
| CN116303657A (en) | Group image generation method, group image generation device, computer device, and storage medium | |
| CN110851446B (en) | Data table generation method and device, computer equipment and storage medium | |
| CN109871214B (en) | Program code generation method, program code generation device, computer device, and storage medium | |
| CN109711809B (en) | Merchant attribute setting method and device, computer equipment and storage medium | |
| WO2020134990A1 (en) | Product information querying method and apparatus, computer device, and storage medium | |
| CN111291159A (en) | Patent retrieval method, device, system, computer equipment and storage medium | |
| CN112835886A (en) | Data table field adding method and device | |
| JP7304220B2 (en) | MATERIAL SEARCH SYSTEM, MATERIAL SEARCH METHOD, MATERIAL SEARCH DEVICE, AND PROGRAM | |
| CN116561456A (en) | Information screening method, device and computer equipment | |
| CN112231541A (en) | Data retrieval method, system, computer device and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: Room 503, 5 / F, C1 building, 88 Dongchang Road, Suzhou Industrial Park, 215000, Jiangsu Province Applicant after: Qicha Technology Co.,Ltd. Address before: 215123 A-901, Hui Hu building, 10 Yue Liang Wan Road, Suzhou Industrial Park, Jiangsu. Applicant before: SUZHOU LANGDONG NET TEC Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address | ||
| CP03 | Change of name, title or address |
Address after: No. 8 Huizhi Street, Suzhou Industrial Park, Suzhou Area, China (Jiangsu) Pilot Free Trade Zone, Suzhou City, Jiangsu Province, 215000 Patentee after: Qichacha Technology Co.,Ltd. Address before: Room 503, 5 / F, C1 building, 88 Dongchang Road, Suzhou Industrial Park, 215000, Jiangsu Province Patentee before: Qicha Technology Co.,Ltd. |