Enterprise association relation topology establishing method and query method based on picture model
A technology of association relationship and method establishment, applied in the computer field, can solve problems such as lack of information, and achieve efficient query results
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0041] refer to figure 2, when adding the association relationship of a group of enterprises, first enter the association relationship data of the enterprise into the topology structure. The related relationship data of the enterprise include: institution name, its legal representative, investor, debtor or creditor, branch, employee, etc. In the process of data entry, the unique identities of institutions and natural persons in the topological map space are recorded in the nodes of the graph data model, the legal person relationship, investment relationship, employment relationship, and branch affiliation are recorded in the relationship, and the institution name, registration Capital, time of establishment, registration status, name of natural person, investment amount, type of shareholder, position held, etc. are recorded in attributes. Next, index the frequently used query attributes (organization name, natural person name, etc.), and after the query node parameters are i...
Embodiment 2
[0062] The present invention preferably queries all natural persons or institutions directly related to a single enterprise. After the enterprise data is entered into the topology structure, the natural persons or institutions directly related to the enterprise can be queried. Enter the enterprise name and associated node type, locate the node position according to the enterprise name, use the breadth-first algorithm to filter the output nodes according to the associated node type, and return all the nodes and relationships with the node after filtering. The query results are as follows Figure 9 shown.
Embodiment 3
[0064] In the present invention, preferably, according to two enterprises, all associations between the two enterprises within a specified step are queried. Enter two company names, locate the start and end nodes according to the company names, and use the Dijkstra algorithm to find all the shortest paths between the start and end nodes. The path includes nodes and the relationship between nodes. If there is no relationship between the start and end nodes within the specified step size, return the start and end nodes. The query results are as follows Figure 10 shown.
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com