CN107341196B - Relation map display method and device - Google Patents

Relation map display method and device Download PDF

Info

Publication number
CN107341196B
CN107341196B CN201710457347.2A CN201710457347A CN107341196B CN 107341196 B CN107341196 B CN 107341196B CN 201710457347 A CN201710457347 A CN 201710457347A CN 107341196 B CN107341196 B CN 107341196B
Authority
CN
China
Prior art keywords
complex
relationship
node
relation
complex edge
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
Application number
CN201710457347.2A
Other languages
Chinese (zh)
Other versions
CN107341196A (en
Inventor
莫旭
秦锋剑
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Green Bay Network Technology Co., Ltd.
Original Assignee
Green Bay Network Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Green Bay Network Technology Co ltd filed Critical Green Bay Network Technology Co ltd
Priority to CN201710457347.2A priority Critical patent/CN107341196B/en
Publication of CN107341196A publication Critical patent/CN107341196A/en
Application granted granted Critical
Publication of CN107341196B publication Critical patent/CN107341196B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/901Indexing; Data structures therefor; Storage structures
    • G06F16/9024Graphs; Linked lists
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/904Browsing; Visualisation therefor

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Software Systems (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention provides a relation map display method and a device, wherein the method comprises the following steps: firstly, a brief relationship map is displayed to a terminal user, wherein the brief relationship map comprises: at least two nodes, and simple edge relationships and/or complex edge relationships between the nodes; when a terminal user clicks the complex edge, a preset relation database is inquired according to the identifier of the complex edge to be checked to obtain the relation data of the complex edge to be checked, and the relation data is sent to the terminal, so that the terminal displays the relation data of the complex edge to be checked, and the terminal user can know the specific complex relation of two nodes pointed by the complex edge conveniently. In the embodiment, the brief relationship graph can be quickly and effectively displayed to the terminal user, so that the terminal user can know the general situation of the relationship graph and display the specific complex relationship represented by the complex edge according to the requirement of the terminal user, the display speed and efficiency of the relationship graph are improved, and the use experience of the terminal user is not influenced.

Description

Relation map display method and device
Technical Field
The invention relates to the technical field of computer graphic processing, in particular to a relation graph display method and device.
Background
At present, in a relational graph under a big data scene, the number of nodes is large, and the association between the nodes is also large, such as direct association, indirect association through events, and space-time association based on space-time attributes. For example, when the number of nodes shown in the relationship graph is 500, and each node is associated by some relationship, the amount of information carried by an edge in the relationship graph will be on the order of 10 ten thousand. If each edge is a complex edge, the amount of information carried is greater. If all the information quantity borne by the edges is transmitted to the front end for displaying, the visualization performance of the relational graph is seriously influenced, and the displaying speed and the displaying efficiency of the relational graph are reduced.
Disclosure of Invention
The present invention is directed to solving, at least to some extent, one of the technical problems in the related art.
Therefore, the first objective of the present invention is to provide a relational graph display method, which is used for solving the problems of low relational graph display rate and poor efficiency in the prior art.
The second purpose of the invention is to provide a relation map display device.
The third purpose of the invention is to provide another relation map display device.
A fourth object of the invention is to propose a non-transitory computer-readable storage medium.
A fifth object of the invention is to propose a computer program product.
In order to achieve the above object, an embodiment of a first aspect of the present invention provides a method for displaying a relationship graph, including:
acquiring a complex side viewing request when a terminal user performs complex side clicking on the displayed brief relationship map; the complex edge checking request carries: identification of a complex edge to be viewed; the brief relationship map comprises: at least two nodes, and a simple edge relationship and/or a complex edge relationship between the nodes;
inquiring a preset relational database according to the identifier of the complex edge to be checked to obtain relational data of the complex edge to be checked; the relationship data of the complex edge to be viewed comprises: at least one event corresponding to the complex edge to be viewed and a relationship between the events;
and sending the relation data of the complex edge to be checked to a terminal so that the terminal can display the relation data of the complex edge to be checked for the terminal user to check.
The relation map display method of the embodiment of the invention displays a brief relation map to a terminal user, wherein the brief relation map comprises the following steps: at least two nodes, and simple edge relationships and/or complex edge relationships between the nodes; when a terminal user clicks a complex edge, a preset relation database is inquired according to the identifier of the complex edge to be checked to obtain the relation data of the complex edge to be checked, and the relation data of the complex edge to be checked is sent to the terminal, so that the terminal displays the relation data of the complex edge to be checked, and the terminal user can know the specific complex relation of two nodes pointed by the complex edge. In the embodiment, the brief relationship graph can be quickly and effectively displayed to the terminal user, so that the terminal user can know the general situation of the relationship graph and display the specific complex relationship represented by the complex edge according to the requirement of the terminal user, the display speed and efficiency of the relationship graph are improved, and the use experience of the terminal user is not influenced.
In order to achieve the above object, a second aspect of the present invention provides a relationship map display apparatus, including:
the first acquisition module is used for acquiring a complex side check request when a terminal user performs complex side click on the displayed brief relationship map; the complex edge checking request carries: identification of a complex edge to be viewed; the brief relationship map comprises: at least two nodes, and a simple edge relationship and/or a complex edge relationship between the nodes;
the query module is used for querying a preset relational database according to the identifier of the complex edge to be checked to obtain the relational data of the complex edge to be checked; the relationship data of the complex edge to be viewed comprises: at least one event corresponding to the complex edge to be viewed and a relationship between the events;
and the first sending module is used for sending the relation data of the complex edge to be checked to a terminal so that the terminal can display the relation data of the complex edge to be checked for the terminal user to check.
The relation map display device of the embodiment of the invention displays a brief relation map to a terminal user, wherein the brief relation map comprises the following components: at least two nodes, and simple edge relationships and/or complex edge relationships between the nodes; when a terminal user clicks a complex edge, a preset relation database is inquired according to the identifier of the complex edge to be checked to obtain the relation data of the complex edge to be checked, and the relation data of the complex edge to be checked is sent to the terminal, so that the terminal displays the relation data of the complex edge to be checked, and the terminal user can know the specific complex relation of two nodes pointed by the complex edge. In the embodiment, the brief relationship graph can be quickly and effectively displayed to the terminal user, so that the terminal user can know the general situation of the relationship graph and display the specific complex relationship represented by the complex edge according to the requirement of the terminal user, the display speed and efficiency of the relationship graph are improved, and the use experience of the terminal user is not influenced.
In order to achieve the above object, according to a third aspect of the present invention, another relationship graph showing apparatus is provided, including a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor implements the relationship graph showing method as described above when executing the program.
To achieve the above object, a fourth aspect of the present invention provides a non-transitory computer-readable storage medium, wherein instructions of the storage medium, when executed by a processor, implement the method as described above.
To achieve the above object, a fifth aspect of the present invention provides a computer program product, wherein when being executed by an instruction processor, a relationship graph showing method is performed, and the method includes:
acquiring a complex side viewing request when a terminal user performs complex side clicking on the displayed brief relationship map; the complex edge checking request carries: identification of a complex edge to be viewed; the brief relationship map comprises: at least two nodes, and a simple edge relationship and/or a complex edge relationship between the nodes;
inquiring a preset relational database according to the identifier of the complex edge to be checked to obtain relational data of the complex edge to be checked; the relationship data of the complex edge to be viewed comprises: at least one event corresponding to the complex edge to be viewed and a relationship between the events;
and sending the relation data of the complex edge to be checked to a terminal so that the terminal can display the relation data of the complex edge to be checked for the terminal user to check.
Additional aspects and advantages of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the invention.
Drawings
The foregoing and/or additional aspects and advantages of the present invention will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:
fig. 1 is a schematic flow chart of a relationship graph display method according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a schematic relationship map;
FIG. 3 is a schematic diagram of the schematic relationship graph of FIG. 2 after unfolding of the complex edge;
fig. 4 is a schematic flow chart of another relationship graph display method according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of a relationship diagram display device according to an embodiment of the present invention;
FIG. 6 is a schematic structural diagram of another relationship map display apparatus according to an embodiment of the present invention;
FIG. 7 is a schematic structural diagram of another relationship map display apparatus according to an embodiment of the present invention;
FIG. 8 is a schematic structural diagram of another relationship chart display apparatus according to an embodiment of the present invention;
FIG. 9 is a schematic structural diagram of another relationship chart display apparatus according to an embodiment of the present invention;
fig. 10 is a schematic structural diagram of another relationship map display apparatus according to an embodiment of the present invention.
Detailed Description
Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the drawings are illustrative and intended to be illustrative of the invention and are not to be construed as limiting the invention.
The relationship map display method and apparatus according to the embodiment of the present invention will be described below with reference to the drawings.
Fig. 1 is a schematic flow chart of a relationship graph display method according to an embodiment of the present invention. As shown in fig. 1, the relationship map display method includes the following steps:
s101, acquiring a complex side checking request when a terminal user performs complex side clicking on the displayed brief relationship map; the complex edge check request carries: identification of a complex edge to be viewed; the brief relationship map includes: at least two nodes, and a simple edge relationship and/or a complex edge relationship between the nodes.
The execution main body of the relation graph display method provided by the invention is a relation graph display device, and the relation graph display device can be a back-end server for providing a brief relation graph or an original relation graph, or software or hardware on the back-end server. Terminals such as mobile phones, PADs, touch screens, etc.
Taking the schematic relationship graph shown in fig. 2 as an example for explanation, in fig. 2, there are 3 nodes, which are zhangsan, lie si and wang wu, respectively. A simple side relationship exists between Li IV and Wang Wu, and the display name of the simple side relationship is relationship 3. A complex edge relation exists between Zhang III and Li IV, and the display name of the complex edge relation is as follows: complex relation 1, direct relation 2. The complex edge to be checked can be a complex edge relation between Zhang III and Li IV.
In this embodiment, when the terminal user checks the displayed brief relationship graph, if the terminal user wants to know the relationship data of a certain complex edge, for example, wants to know the specific relationship between zhang san and lie si, the terminal user may click or select the complex edge between zhang san and lie si, and the terminal identifies the behavior of the user as a complex edge checking request, where the complex edge checking request carries: identification of complex edges between Zhang III and Li IV.
In this embodiment, the identification of the complex edge means that a number or other identification that can uniquely identify the complex edge, and the like. There is a one-to-one correspondence between the identification of the complex edge and the display name of the complex edge.
In this embodiment, before step 101, the relationship graph displaying apparatus may first send the corresponding brief relationship graph to the terminal according to the requirement of the terminal user, so that the terminal displays the corresponding brief relationship graph. Such as a person profile as shown in fig. 2 or other profile, etc.
S102, inquiring a preset relational database according to the identification of the complex edge to be checked, and acquiring relational data of the complex edge to be checked; the relationship data of the complex edge to be viewed comprises: at least one event corresponding to the complex edge to be viewed and the relationship between the events.
The preset relational database is prestored with the relational data of each complex edge in the brief relational map. Taking the simple relationship map in fig. 2 as an example for illustration, after the complex edge between zhang san and lie si is unfolded, the relationship data of the complex edge may be as shown in fig. 3, including: direct relationship 2, event 1 and event 2 are linked to form complex relationship 1.
S103, sending the relation data of the complex edge to be checked to the terminal, so that the terminal displays the relation data of the complex edge to be checked, and the terminal user can check the relation data conveniently.
In this embodiment, the complex edge between zhang san and lie in fig. 2 may be expanded, that is, the complex edge between zhang san and lie is replaced with the relationship data of the complex edge, and the result is shown in fig. 3 after the replacement.
The relation map display method of the embodiment of the invention displays a brief relation map to a terminal user, wherein the brief relation map comprises the following steps: at least two nodes, and simple edge relationships and/or complex edge relationships between the nodes; when a terminal user clicks a complex edge, a preset relation database is inquired according to the identifier of the complex edge to be checked to obtain the relation data of the complex edge to be checked, and the relation data of the complex edge to be checked is sent to the terminal, so that the terminal displays the relation data of the complex edge to be checked, and the terminal user can know the specific complex relation of two nodes pointed by the complex edge. In the embodiment, the brief relationship graph can be quickly and effectively displayed to the terminal user, so that the terminal user can know the general situation of the relationship graph and display the specific complex relationship represented by the complex edge according to the requirement of the terminal user, the display speed and efficiency of the relationship graph are improved, and the use experience of the terminal user is not influenced.
Fig. 4 is a schematic flow chart of another relationship diagram display method provided in the embodiment of the present invention, as shown in fig. 4, on the basis of the embodiment shown in fig. 1, before step 101, the method may further include:
and S104, acquiring an original relation map.
And S105, aiming at each node in the original relation graph, acquiring a complex edge between each node and each adjacent node.
Specifically, step 105 may specifically include: aiming at each node in the original relation graph, acquiring all paths between the node and each adjacent node; analyzing all paths by adopting a preset relation mapping rule to obtain at least one complex relation between a node and each adjacent node; and combining at least one complex relation and a direct relation between the node and each adjacent node to obtain a complex edge between the node and each adjacent node.
In this embodiment, the neighboring node refers to another node having a direct relationship with the node. For example, in fig. 2, the adjacent node of zhang three is lie four, the adjacent node of wang five is lie four, and the adjacent node of lie four is zhang three and wang five. All paths between a node and a neighboring node refer to all reachable routes from the node to the neighboring node. Some paths can form complex relations, and some paths cannot form complex relations, so that a preset relation mapping rule is needed to be adopted for analysis, and at least one complex relation between a node and an adjacent node is filtered. The complex relationship is, for example, a relationship composed of event 1 and event 2 between zhang san and lie san.
And S106, combining the complex edges between each node and each adjacent node to generate a brief relationship graph.
In this embodiment, for each node in the original relationship graph, all paths between the node and each adjacent node thereof are replaced by complex edges between the node and the adjacent node, so as to obtain a brief relationship graph corresponding to the original relationship graph.
In addition, it should be noted that, after the brief relationship graph is generated, the relationship graph displaying apparatus further needs to determine, for each node in the original relationship graph, at least one complex relationship between the node and each adjacent node as relationship data of a corresponding complex edge; and storing the identification of the complex edge and the corresponding relation data of the complex edge into a relation database.
The relation map display method of the embodiment of the invention comprises the steps of firstly obtaining an original relation map; aiming at each node in the original relation graph, acquiring a complex edge between the node and each adjacent node; generating a brief relationship graph by combining the complex edges between each node and each adjacent node; and displaying the brief relationship map to the terminal user, wherein the brief relationship map comprises: at least two nodes, and simple edge relationships and/or complex edge relationships between the nodes; when a terminal user clicks a complex edge, a preset relation database is inquired according to the identifier of the complex edge to be checked to obtain the relation data of the complex edge to be checked, and the relation data of the complex edge to be checked is sent to the terminal, so that the terminal displays the relation data of the complex edge to be checked, and the terminal user can know the specific complex relation of two nodes pointed by the complex edge. In the embodiment, the brief relationship graph can be quickly and effectively displayed to the terminal user, so that the terminal user can know the general situation of the relationship graph and display the specific complex relationship represented by the complex edge according to the requirement of the terminal user, the display speed and efficiency of the relationship graph are improved, and the use experience of the terminal user is not influenced.
Fig. 5 is a schematic structural diagram of a relationship diagram display device according to an embodiment of the present invention. As shown in fig. 5, includes: a first obtaining module 51, a querying module 52 and a first sending module 53.
The first obtaining module 51 is configured to obtain a complex side viewing request when a terminal user performs a complex side click on a displayed brief relationship graph; the complex edge checking request carries: identification of a complex edge to be viewed; the brief relationship map comprises: at least two nodes, and a simple edge relationship and/or a complex edge relationship between the nodes;
the query module 52 is configured to query a preset relationship database according to the identifier of the complex edge to be viewed, and obtain relationship data of the complex edge to be viewed; the relationship data of the complex edge to be viewed comprises: at least one event corresponding to the complex edge to be viewed and a relationship between the events;
the first sending module 53 is configured to send the relationship data of the complex edge to be viewed to a terminal, so that the terminal displays the relationship data of the complex edge to be viewed, so that a terminal user can view the relationship data.
The relation map display device provided by the invention can be a back-end server providing a brief relation map or an original relation map, or software or hardware on the back-end server. Terminals such as mobile phones, PADs, touch screens, etc.
In this embodiment, when the terminal user checks the displayed brief relationship graph, if the terminal user wants to know the relationship data of a certain complex edge, for example, wants to know the specific relationship between zhang san and lie si, the terminal user may click or select the complex edge between zhang san and lie si, and the terminal identifies the behavior of the user as a complex edge checking request, where the complex edge checking request carries: identification of complex edges between Zhang III and Li IV.
Further, with reference to fig. 6, on the basis of the embodiment shown in fig. 5, the apparatus further includes: a second sending module 54, configured to send the profile to the terminal, so that the terminal displays the profile.
The functions of the modules in this embodiment may be described in detail with reference to the embodiments shown in fig. 1 to 4, and will not be described in detail here.
The relation map display device of the embodiment of the invention displays a brief relation map to a terminal user, wherein the brief relation map comprises the following components: at least two nodes, and simple edge relationships and/or complex edge relationships between the nodes; when a terminal user clicks a complex edge, a preset relation database is inquired according to the identifier of the complex edge to be checked to obtain the relation data of the complex edge to be checked, and the relation data of the complex edge to be checked is sent to the terminal, so that the terminal displays the relation data of the complex edge to be checked, and the terminal user can know the specific complex relation of two nodes pointed by the complex edge. In the embodiment, the brief relationship graph can be quickly and effectively displayed to the terminal user, so that the terminal user can know the general situation of the relationship graph and display the specific complex relationship represented by the complex edge according to the requirement of the terminal user, the display speed and efficiency of the relationship graph are improved, and the use experience of the terminal user is not influenced.
Further, with reference to fig. 7, on the basis of the embodiment shown in fig. 5, the apparatus further includes: a second obtaining module 55, a third obtaining module 56 and a generating module 57.
The second obtaining module 55 is configured to obtain an original relationship map;
a third obtaining module 56, configured to obtain, for each node in the original relationship graph, a complex edge between the node and each neighboring node;
and a generating module 57, configured to combine the complex edges between each node and each neighboring node to generate a brief relationship graph.
Further, with reference to fig. 8 in combination, on the basis of the embodiment shown in fig. 7, the third obtaining module 56 includes: an acquisition unit 561, an analysis unit 562 and a merging unit 563.
The obtaining unit 561 is configured to, for each node in the original relationship graph, obtain all paths between the node and each neighboring node;
an analysis unit 562, configured to analyze all paths by using a preset relationship mapping rule, and obtain at least one complex relationship between the node and each neighboring node;
a merging unit 563 configured to merge at least one complex relationship and a direct relationship between the node and each neighboring node to obtain a complex edge between the node and each neighboring node.
In this embodiment, the neighboring node refers to another node having a direct relationship with the node. For example, in fig. 2, the adjacent node of zhang three is lie four, the adjacent node of wang five is lie four, and the adjacent node of lie four is zhang three and wang five. All paths between a node and a neighboring node refer to all reachable routes from the node to the neighboring node. Some paths can form complex relations, and some paths cannot form complex relations, so that a preset relation mapping rule is needed to be adopted for analysis, and at least one complex relation between a node and an adjacent node is filtered. The complex relationship is, for example, a relationship composed of event 1 and event 2 between zhang san and lie san.
Further, with reference to fig. 9, on the basis of the embodiment shown in fig. 7, the apparatus may further include: a determination module 58 and a storage module 59.
Wherein, the determining module 58 is configured to determine, for each node in the original relationship graph, at least one complex relationship between the node and each neighboring node as relationship data of a corresponding complex edge;
a storage module 59, configured to store the identifier of the complex edge and the corresponding relationship data of the complex edge in the relationship database.
The functions of the modules in this embodiment may be described in detail with reference to the embodiments shown in fig. 1 to 4, and will not be described in detail here.
The relation map display device of the embodiment of the invention firstly obtains an original relation map; aiming at each node in the original relation graph, acquiring a complex edge between the node and each adjacent node; generating a brief relationship graph by combining the complex edges between each node and each adjacent node; and displaying the brief relationship map to the terminal user, wherein the brief relationship map comprises: at least two nodes, and simple edge relationships and/or complex edge relationships between the nodes; when a terminal user clicks a complex edge, a preset relation database is inquired according to the identifier of the complex edge to be checked to obtain the relation data of the complex edge to be checked, and the relation data of the complex edge to be checked is sent to the terminal, so that the terminal displays the relation data of the complex edge to be checked, and the terminal user can know the specific complex relation of two nodes pointed by the complex edge. In the embodiment, the brief relationship graph can be quickly and effectively displayed to the terminal user, so that the terminal user can know the general situation of the relationship graph and display the specific complex relationship represented by the complex edge according to the requirement of the terminal user, the display speed and efficiency of the relationship graph are improved, and the use experience of the terminal user is not influenced.
Fig. 10 is a schematic structural diagram of another relationship map display apparatus according to an embodiment of the present invention. The relation map display device comprises:
memory 1001, processor 1002, and computer programs stored on memory 1001 and executable on processor 1002.
The processor 1002 implements the relationship map display method provided in the above embodiments when executing the program.
Further, the relationship map display device further comprises:
a communication interface 1003 for communicating between the memory 1001 and the processor 1002.
A memory 1001 for storing computer programs that may be run on the processor 1002.
Memory 1001 may include high-speed RAM memory and may also include non-volatile memory (e.g., at least one disk memory).
The processor 1002 is configured to implement the relationship graph display method according to the foregoing embodiment when executing the program.
If the memory 1001, the processor 1002, and the communication interface 1003 are implemented independently, the communication interface 1003, the memory 1001, and the processor 1002 may be connected to each other through a bus and perform communication with each other. The bus may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, an Extended ISA (EISA) bus, or the like. The 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 in FIG. 10, but this is not intended to represent only one bus or type of bus.
Optionally, in a specific implementation, if the memory 1001, the processor 1002, and the communication interface 1003 are integrated on one chip, the memory 1001, the processor 1002, and the communication interface 1003 may complete communication with each other through an internal interface.
The processor 1002 may be a Central Processing Unit (CPU), an Application Specific Integrated Circuit (ASIC), or one or more Integrated circuits configured to implement embodiments of the present invention.
The present embodiment also provides a non-transitory computer readable storage medium, on which a computer program is stored, wherein the program is executed by a processor to implement the relationship graph displaying method as described above.
The present embodiment also provides a computer program product, wherein when being executed by an instruction processor in the computer program product, a method for displaying a relationship graph is performed, the method comprising:
acquiring a complex side viewing request when a terminal user performs complex side clicking on the displayed brief relationship map; the complex edge checking request carries: identification of a complex edge to be viewed; the brief relationship map comprises: at least two nodes, and a simple edge relationship and/or a complex edge relationship between the nodes;
inquiring a preset relational database according to the identifier of the complex edge to be checked to obtain relational data of the complex edge to be checked; the relationship data of the complex edge to be viewed comprises: at least one event corresponding to the complex edge to be viewed and a relationship between the events;
and sending the relation data of the complex edge to be checked to a terminal so that the terminal can display the relation data of the complex edge to be checked for the terminal user to check.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.
Furthermore, the terms "first", "second" and "first" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In the description of the present invention, "a plurality" means at least two, e.g., two, three, etc., unless specifically limited otherwise.
Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing steps of a custom logic function or process, and alternate implementations are included within the scope of the preferred embodiment of the present invention in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the present invention.
The logic and/or steps represented in the flowcharts or otherwise described herein, e.g., an ordered listing of executable instructions that can be considered to implement logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. For the purposes of this description, a "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: an electrical connection (electronic device) having one or more wires, a portable computer diskette (magnetic device), a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). Additionally, the computer-readable medium could even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via for instance optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner if necessary, and then stored in a computer memory.
It should be understood that portions of the present invention may be implemented in hardware, software, firmware, or a combination thereof. In the above embodiments, the various steps or methods may be implemented in software or firmware stored in memory and executed by a suitable instruction execution system. If implemented in hardware, as in another embodiment, any one or combination of the following techniques, which are known in the art, may be used: a discrete logic circuit having a logic gate circuit for implementing a logic function on a data signal, an application specific integrated circuit having an appropriate combinational logic gate circuit, a Programmable Gate Array (PGA), a Field Programmable Gate Array (FPGA), or the like.
It will be understood by those skilled in the art that all or part of the steps carried by the method for implementing the above embodiments may be implemented by hardware related to instructions of a program, which may be stored in a computer readable storage medium, and when the program is executed, the program includes one or a combination of the steps of the method embodiments.
In addition, functional units in the embodiments of the present invention may be integrated into one processing module, or each unit may exist alone physically, or two or more units are integrated into one module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. The integrated module, if implemented in the form of a software functional module and sold or used as a stand-alone product, may also be stored in a computer readable storage medium.
The storage medium mentioned above may be a read-only memory, a magnetic or optical disk, etc. Although embodiments of the present invention have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting the present invention, and that variations, modifications, substitutions and alterations can be made to the above embodiments by those of ordinary skill in the art within the scope of the present invention.

Claims (12)

1. A relation map display method is characterized by comprising the following steps:
acquiring a complex side viewing request when a terminal user performs complex side clicking on the displayed brief relationship map; the complex edge checking request carries: identification of a complex edge to be viewed; the brief relationship map comprises: at least two nodes, and a simple edge relationship and/or a complex edge relationship between the nodes; wherein, the nodes in the brief relation map are consistent with the nodes in the corresponding original relation map;
inquiring a preset relational database according to the identifier of the complex edge to be checked to obtain relational data of the complex edge to be checked; the relationship data of the complex edge to be viewed comprises: at least one event corresponding to the complex edge to be viewed and a relationship between the events;
and sending the relation data of the complex edge to be checked to a terminal so that the terminal can display the relation data of the complex edge to be checked for the terminal user to check.
2. The method according to claim 1, wherein before the obtaining of the complex edge viewing request when the end user performs the complex edge click on the presented profile, the method further comprises:
and sending the brief relation map to the terminal so that the terminal displays the brief relation map.
3. The method according to claim 1 or 2, wherein before the obtaining of the complex edge viewing request when the end user makes a complex edge click on the presented profile, the method further comprises:
acquiring an original relation map;
aiming at each node in the original relation graph, acquiring a complex edge between the node and each adjacent node;
and combining the complex edges between each node and each adjacent node to generate a brief relationship graph.
4. The method of claim 3, wherein for each node in the original relationship graph, obtaining a complex edge between the node and each neighboring node comprises:
aiming at each node in the original relation graph, acquiring all paths between the node and each adjacent node;
analyzing all paths by adopting a preset relation mapping rule to obtain at least one complex relation between the node and each adjacent node;
and combining at least one complex relation and a direct relation between the node and each adjacent node to obtain a complex edge between the node and each adjacent node.
5. The method of claim 3, wherein after generating the profile graph in conjunction with the complex edges between each node and each neighboring node, further comprising:
determining at least one complex relationship between each node and each adjacent node as relationship data of a corresponding complex edge for each node in the original relationship graph;
and storing the identification of the complex edge and the corresponding relation data of the complex edge into the relation database.
6. A relationship map display apparatus, comprising:
the first acquisition module is used for acquiring a complex side check request when a terminal user performs complex side click on the displayed brief relationship map; the complex edge checking request carries: identification of a complex edge to be viewed; the brief relationship map comprises: at least two nodes, and a simple edge relationship and/or a complex edge relationship between the nodes; wherein, the nodes in the brief relation map are consistent with the nodes in the corresponding original relation map;
the query module is used for querying a preset relational database according to the identifier of the complex edge to be checked to obtain the relational data of the complex edge to be checked; the relationship data of the complex edge to be viewed comprises: at least one event corresponding to the complex edge to be viewed and a relationship between the events;
and the first sending module is used for sending the relation data of the complex edge to be checked to a terminal so that the terminal can display the relation data of the complex edge to be checked for the terminal user to check.
7. The apparatus of claim 6,
and the second sending module is used for sending the brief relationship map to the terminal so that the terminal can display the brief relationship map.
8. The apparatus of claim 6 or 7, further comprising:
the second acquisition module is used for acquiring the original relation map;
a third obtaining module, configured to obtain, for each node in the original relationship graph, a complex edge between the node and each neighboring node;
and the generating module is used for combining the complex edges between each node and each adjacent node to generate the brief relationship map.
9. The apparatus of claim 8, wherein the third obtaining module comprises:
an obtaining unit, configured to obtain, for each node in the original relationship graph, all paths between the node and each adjacent node;
the analysis unit is used for analyzing all paths by adopting a preset relation mapping rule to acquire at least one complex relation between the node and each adjacent node;
and the merging unit is used for merging at least one complex relationship and direct relationship between the node and each adjacent node to obtain a complex edge between the node and each adjacent node.
10. The apparatus of claim 8, further comprising:
a determining module, configured to determine, for each node in the original relationship graph, at least one complex relationship between the node and each neighboring node as relationship data of a corresponding complex edge;
and the storage module is used for storing the identification of the complex edge and the corresponding relation data of the complex edge into the relation database.
11. A relationship map display apparatus, comprising:
memory, processor and computer program stored on the memory and executable on the processor, characterized in that the processor implements the relationship graph displaying method according to any one of claims 1 to 5 when executing the program.
12. A non-transitory computer-readable storage medium having stored thereon a computer program, wherein the program, when executed by a processor, implements the relationship graph presentation method according to any one of claims 1 to 5.
CN201710457347.2A 2017-06-16 2017-06-16 Relation map display method and device Active CN107341196B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710457347.2A CN107341196B (en) 2017-06-16 2017-06-16 Relation map display method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710457347.2A CN107341196B (en) 2017-06-16 2017-06-16 Relation map display method and device

Publications (2)

Publication Number Publication Date
CN107341196A CN107341196A (en) 2017-11-10
CN107341196B true CN107341196B (en) 2021-04-16

Family

ID=60220038

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710457347.2A Active CN107341196B (en) 2017-06-16 2017-06-16 Relation map display method and device

Country Status (1)

Country Link
CN (1) CN107341196B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109657067A (en) * 2018-11-19 2019-04-19 平安科技(深圳)有限公司 Methods of exhibiting, device, computer equipment and the storage medium of knowledge mapping
CN110046194A (en) * 2019-03-19 2019-07-23 阿里巴巴集团控股有限公司 A kind of method, apparatus and electronic equipment of expanding node relational graph

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7191175B2 (en) * 2004-02-13 2007-03-13 Attenex Corporation System and method for arranging concept clusters in thematic neighborhood relationships in a two-dimensional visual display space
US8810576B2 (en) * 2010-04-13 2014-08-19 Microsoft Corporation Manipulation and management of links and nodes in large graphs
CN102841896A (en) * 2011-06-22 2012-12-26 腾讯科技(深圳)有限公司 Mobile terminal picture and text information displaying method and system and mobile terminal
US8849721B2 (en) * 2011-09-21 2014-09-30 Facebook, Inc. Structured objects and actions on a social networking system
CN103838814B (en) * 2013-11-22 2017-01-25 南京欣网互联信息技术有限公司 Method for dynamically displaying contacts diagram relationship
CN105426499A (en) * 2015-11-25 2016-03-23 成都数联铭品科技有限公司 Implementation method of data visualization
CN105488130A (en) * 2015-11-25 2016-04-13 成都数联铭品科技有限公司 Associated data visualization display method
CN105824883A (en) * 2016-03-10 2016-08-03 中电海康集团有限公司 Representing method and system capable of dynamically expanding data associated network diagram
CN106055647A (en) * 2016-05-31 2016-10-26 深圳市永兴元科技有限公司 Webpage display processing method and device

Also Published As

Publication number Publication date
CN107341196A (en) 2017-11-10

Similar Documents

Publication Publication Date Title
CN108073519B (en) Test case generation method and device
CN107085587B (en) Indirect filtering in mixed data operations
CN107317853B (en) Method, device and system for displaying dynamic effect of message popup window
CN103294047B (en) For diagnosing the method and system of vehicle
CN109039819B (en) Time delay statistical method, device, system and storage medium
CN109388791B (en) Dynamic diagram display method and device, computer equipment and storage medium
CN107396199B (en) Barrage method for exhibiting data and device, computer readable storage medium
CN107341196B (en) Relation map display method and device
CN106294409A (en) Data processing method and device
CN112363935A (en) Data joint debugging method and device, electronic equipment and storage medium
US10754747B2 (en) Physical port information associated with system identifiers
CN107332991B (en) Screen locking interface information processing method and device
CN110825472B (en) Chart color drawing method, device, readable storage medium and electronic equipment
CN108847120B (en) Drawing method based on electronic fence map order thermodynamic diagram distribution
CN111049717A (en) Variable acquisition method and equipment
CN106535102B (en) A kind of mobile terminal locating method and mobile terminal
CN110287431B (en) Image file loading method and device, electronic equipment and storage medium
WO2020233093A1 (en) Association graph generation method and apparatus, computer device, and storage medium
US20210248156A1 (en) Information processing device, and image data generating device
CN110825933A (en) Relation graph display method and device, electronic equipment and readable storage medium
CN115857863A (en) Machine room configuration split-screen rendering method and device based on monitoring software and terminal
CN109269628A (en) Method, terminal device and the computer readable storage medium of monitoring motor vibration
CN115599258A (en) Interaction method and system of virtual files and electronic equipment
CN107688951B (en) Information pushing method and device
CN111143377B (en) Automatic driving simulation data collection method, device and system

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
TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20190830

Address after: 100192 Dongsheng Science Park, Zhongguancun, 66 Xixiaokou Road, Haidian District, Beijing

Applicant after: Green Bay Network Technology Co., Ltd.

Address before: 100089 Beijing Haidian District Xixiaokou Road 66 Zhongguancun Dongsheng Science Park B-6 Building B 5 floors

Applicant before: Grass count language (Beijing) Technology Co., Ltd.

GR01 Patent grant
GR01 Patent grant