AU2006201531A1 - Entity relationship model method and system - Google Patents

Entity relationship model method and system Download PDF

Info

Publication number
AU2006201531A1
AU2006201531A1 AU2006201531A AU2006201531A AU2006201531A1 AU 2006201531 A1 AU2006201531 A1 AU 2006201531A1 AU 2006201531 A AU2006201531 A AU 2006201531A AU 2006201531 A AU2006201531 A AU 2006201531A AU 2006201531 A1 AU2006201531 A1 AU 2006201531A1
Authority
AU
Australia
Prior art keywords
node
nodes
current focus
network
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.)
Abandoned
Application number
AU2006201531A
Inventor
Edward Gallimore
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.)
Commonwealth Bank of Australia
Original Assignee
Commonwealth Bank of Australia
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 Commonwealth Bank of Australia filed Critical Commonwealth Bank of Australia
Priority to AU2006201531A priority Critical patent/AU2006201531A1/en
Publication of AU2006201531A1 publication Critical patent/AU2006201531A1/en
Abandoned legal-status Critical Current

Links

Landscapes

  • User Interface Of Digital Computer (AREA)

Description

P/00/011 Regulation 3.2
AUSTRALIA
Patents Act 1990 COMPLETE SPECIFICATION STANDARD PATENT Invention Title: Entity relationship model method and system The following statement is a full description of this invention, including the best method of performing it known to us: 005006227 2 Entity Relationship Model and System Field of the invention The present invention relates to a method and system of representing the relationships between entities to users of a computer system on a graphical user display. More specifically, the present invention relates to a graphical user interface which facilitates user navigation and comprehension of a network of related entities.
Background of the invention Enterprise information is stored by businesses in databases which are designed to model and store information that relates to real world objects and business processes. Typical relational databases model real world information from the perspective of entities and relationships, with each entity having associated characteristic information and specific types of relationships with other entities in the model.
Information stored in databases can be presented to the user using a number of techniques. Typically, data can be represented in an entity centric manner (where all the attributes of a selected entity may be displayed and editable), a list-centric manner (where attributes may be displayed in tabular format) and a data aggregation manner (where aggregation functions may be applied to entity attributes and the results plotted against entity instances).
Alternatively, data stored in relational databases may be represented on a graphical user interface in a relationship orientated manner (where the relationship between entities is exemplified to the user). One general way of attempting to represent information (particularly non hierarchical information) is by using a series of nodes in a planar network diagram as shown in Figure 1.
Typically, planar network diagrams are confusing for users, as they display too much data, with the nodes of the network being unordered and lacking information as to the importance and the nature of the relationship between respective nodes. Navigation 005006227 3 may also become difficult for users. As the network size increases, these problems are exacerbated, and are further complicated by the necessity to size the network so that it fits within the available display area. Typically, this complication is resolved by enabling user to either 'zoom' in or out to alter the size of the network display, or by enabling a scroll function that allows users to pan the display window over magnified portions of the display diagram. However, both of these approaches often leave the user lacking context which impairs their capacity to comprehend potentially relevant information.
Specific relationship orientated GUI display systems exist, although these are typically niche applications that display specific types of (usually hierarchical) data.
Microsoft Explorer T M is one example of a GUI display that facilitates user navigation down a hierarchical file system, from the root directory to an individual file level using a hierarchical tree structure. However, interrelated and non-hierarchical data is not well represented in Microsoft ExplorerTM. Another approach to presenting data is using various types of graphical user interface software to display MindMaps Personal Brain T M Typically, these GUIs support hierarchically organised data; with a core central important concept located at the centre of the MindMap, and related concepts extending away from the core concept, usually in the structure. Once the number of related concepts expand beyond the capacity of the screen, zoom controls are often employed to resize the display. MindMaps by their very nature have a fixed hierarchy, and do not support the display of many equally important elements.
A further niche GUI application may be employed in the field of Genealogy software, which displays relationship between hierarchical entities, and emphasises the size and complexity of data being presented.
Although various ways exist of displaying information captured in relational databases to a user, both general approaches and specific niche graphical user interfaces are best suited to presenting strictly hierarchical data, and simple relationships. The present inventors have identified the shortcomings of the systems and methods of the prior art and have sought to ameliorate at least some of the deficiencies and problems experienced by the systems and methods of the prior art.
005006227 4 These and other advantages of the present invention will become apparent from review of the following description.
Summary of the invention According to a first aspect of the present invention, there is provided a computer system comprising a display, at least one input device and a processing unit in communication with the display and the input device, the processing unit also being in communication with a computer memory storing a computer program executable by the processing unit, the processing unit operable to, when executing the computer program, control the display to show a graphical user interface and accept input from the input device to manipulate a view of an inter-related navigable network that is displayed as part of the graphical user interface and which comprises a plurality of nodes, each node being representative of an object and a plurality of relationship connectors extending between the nodes that indicate a graphical relationship between the objects, wherein the processing unit is further operable to implement a node context engine responsive to selection of a node using the input device and operative to reconfigure the network about the selected node so that the selected node becomes a current focus node from which the network radiates, for enabling the network to be interpreted in the context of the current focus node.
Preferably, the graphical relationship between the current focus node and the other nodes in the network is representative of the degree of separation between the focus node and the other nodes.
Preferably, the network shows a spatial relationship between the nodes, wherein the positions and distances of the other nodes relative to the current focus node are representative of their respective degree of separation from the current focus node.
Preferably, the graphical relationship comprises a graphical representation that emphasises the current focus node and de-emphasises the other nodes, with the degree of emphasis being related to the degree of separation of the other nodes relative to the current node. The difference in emphasis may be achieved by altering, at successively increasing degrees of separation from the selected entity node, at least 005006227 one characteristic selected from a group comprising the relative colour, size, boldness, length and shading of the nodes and/or relationship connectors.
Preferably, the relationship connectors comprise relationship indicators for indicating the nature of the relationship between the nodes. At least some of the relationship connectors may be directional and the context engine is operable to redirect the relationships in the event of their context changing.
Preferably, the nodes with the same degree of separation from the current focus node are spaced at a similar distance from the current focus node, with successively increasing distances corresponding to successively increasing degrees of separation.
The nodes may be arranged in a plurality of concentric circles about the current focus node, with the radial distance from the current focus node being representative of the directness of the relationship between the current focus node and the other nodes.
Preferably, the nodes that have a direct relationship with the current focus node are arranged equi-angularly about the current focus node at either a similar distance or equal distance from that node.
Preferably, different nodes that each have a relationship connector with a common node and which have the same degree of separation from the common node are arranged equi-angularly in an arc about the common node.
Preferably, the network is non-hierarchical or agnostic, with the relationships between nodes being similarly non-hierarchical in nature, in the sense that any node may be selected to be the focus entity node.
Preferably, the entity node context engine is further operative so as only to display nodes which are less than a predetermined degree of separation from the current focus node.
Preferably, the node context engine further comprises an animation function to show on the display a reconfiguration of the network. The animation function may be non-linear, having an acceleration and a deceleration phase.
005006227 6 Preferably, the node context engine further comprises at least one secondary network indicator to indicate a secondary network or grouping of nodes. The secondary network indicator may comprise an overlay on the graphical user interface which is common between at least some of the entity nodes according to at least one predefined criterion, which may be causally linked. The predefined criteria may be selected from the group comprising a risk profile, balance details, a legal relationship in the event of a loan default, another legal relationship, an activity pattern, and a call pattern.
According to a second aspect of the present invention, there is provided a computer-implemented method of displaying related data, the method comprising: displaying on a display a graphical user interface comprising an inter-related navigable network comprising a plurality of nodes and a plurality of relationship connectors, each node being representative of an object and the plurality of relationship connectors indicating a relationship between the objects; accepting input from an input device and in response manipulating a view of the network, including in response to the selection of a node reconfiguring the network about the selected node so that the selected node becomes a current focus node from which the network radiates, for enabling the network to be interpreted in the context of the current focus node.
Preferably, the step of displaying comprises displaying each of the nodes other than the current focus node at a position and distance relative to the current focus node that is representative of their respective degree of separation from the current focus node.
Preferably, the step of displaying comprises emphasising the current focus node and de-emphasising the other nodes, with the degree of emphasis being related to the degree of separation of the other nodes relative to the current focus node.
Preferably, the step of displaying comprises displaying nodes with the same degree of separation from the current focus node at a similar distance from the current focus node, with successively increasing distances corresponding to successively increasing degrees of separation.
005006227 7 Preferably, the nodes are arranged in a plurality of concentric circles about the current focus node.
Preferably, the nodes that have a direct relationship with the current focus node are arranged equi-angularly about the current focus node.
Preferably, the method comprises determining when a plurality of different nodes have a relationship connector with a common node and have the same degree of separation from the common node and then displaying said different nodes equiangularly in an arc about the common node.
Preferably, the method further comprises only displaying nodes which are less than a predetermined degree of separation from the current focus node.
Preferably, the method further comprises displaying at least one secondary network indicator over the network to indicate a secondary network within said network or a secondary grouping of nodes within said network.
According to a third aspect of the present invention, there is provided a graphical user interface for displaying related data, the interface comprising: an view of an inter-related navigable network comprising a plurality of nodes and a plurality of relationship connectors, each node being representative of an object and the plurality of relationship connectors indicating a relationship between the objects; wherein each node is selectable and in response to the selection of another node from a currently selected node, the interface shows a manipulated view of the network, in which the network is reconfigured about the newly selected node, so that the newly selected node becomes a current focus node from which the network radiates, for enabling the network to be interpreted in the context of the current focus node.
Preferably, each of the nodes other than the current focus node is displayed at a position and distance relative to the current focus node that is representative of their respective degree of separation from the current focus node.
005006227 8 Preferably, the current focus node is emphasised and the other nodes are deemphasised, with the degree of emphasis being related to the degree of separation of the other nodes relative to the current focus node.
Preferably, nodes with the same degree of separation from the current focus node are displayed at a similar distance from the current focus node, with successively increasing distances corresponding to successively increasing degrees of separation.
Preferably, the nodes are arranged in a plurality of concentric circles about the current focus node.
Preferably, the nodes that have a direct relationship with the current focus node are arranged equi-angularly about the current focus node.
Preferably, nodes with a relationship connector with a common node and having the same degree of separation from the common node are displayed equi-angularly in an arc about the common node.
Preferably, only nodes which are less than a predetermined degree of separation from the current focus node are displayed.
Preferably, the graphical user interface further comprises at least one secondary network indicator indicates a secondary network within said network or a secondary grouping of nodes within said network.
Each node may be representative of any real or imaginary object, which is typically an entity, in which case the nodes are entity nodes.
The relationships may be directional or non-directional.
Further aspects of the present invention, which should be considered in all its novel aspects, will become apparent from the following description of preferred embodiments, given by way of example only and with reference to the accompanying drawings.
005006227 9 Brief description of the drawings Figure 1 is an interrelated network diagram of a series of nodes and connectors as represented on conventional prior art graphical user interfaces.
Figures 2a and 2b illustrate the architecture of a typical workstation and network respectively which implement the processing which produces a display according to a first embodiment of the present invention.
Figure 3 is an exemplary schematic network diagram of a graphical user interface of a first embodiment of the present invention displaying the network of Figure 1 organised with a primary focus entity node Figure 4 is an exemplary schematic network diagram of the graphical user interface of Figure 3 displaying the network representation of Figure 3 reconfigured following a navigation towards entity node Figure 5 is an example of an animation piecemeal function used for the transition to adjust the network diagram.
Figure 6 is a more complex exemplary network diagram of the user interface of Figure 1 as represented in conventional prior art graphical user interfaces.
Figure 7 is an exemplary schematic network diagram of the graphical user interface of a first embodiment of the present invention displaying the network of Figure organised with a focus entity node Figures 8a-8e illustrate successive frames involved in an animation which effects a change in focus entity node according to an aspect of the present invention.
Figure 9a-9e illustrate successive frames involved in an animation which effects a further change in the focus entity node of the network diagram according to an aspect of the present invention.
005006227 Figures 10a-10c illustrate a network and various overlays that may be applied to the entity nodes in the network in a further aspect of the present invention.
Detailed description of the embodiments As used in connection with the present invention the following terms are used with the meanings set out below.
The term "node" is taken to refer to a logical representation of a physical or imaginary object which has associated attributes. Thus, the term "entity node" refers to a representation of a physical or imaginary object which has associated attributes and is an entity. The term "relationship connector" is used to refer to the relationship between two distinct nodes.
A connected network is a specific type of network where a path exists between any two nodes. The term "path" refers to a sequence of nodes, with each node existing in the sequence only once, and where any two consecutive nodes in the sequence are directly related. Nodes are directly related if a connector exists that joins the two nodes together.
Connectors may be directional the order of the relationship is important and only applies one way) or directionless the order of the relationship is unimportant and both nodes participate equally in the relationship.) An example of a directional relationship is if Mary and Jane are two nodes in a network, and Mary is the daughter of Jane, then "daughter of' is a directional connector that would apply to connect Node Mary to Node Jane. Of course, if Mary was the sister of Jane, then this would be an example of a directionless relationship.
Indirectly related nodes are nodes which are not directly related, but where a path exists between the sequence of nodes. The shortest path is the path between two nodes that contains the minimum number of nodes.
005006227 11 Figure 1 shows a typical schematic prior art representation 10 of the information and relationships associated with a series of entity nodes which may be stored in a database, in the form of a non-hierarchical planar network diagram. A plurality of entity nodes labelled from A to N, certain of which are also numbered 12, 14, 16, 18 and are displayed in a random arrangement on the screen, with relationship connectors, some of which are indicated at 30, 32 and 34, joining the entity nodes and being illustrative of direct relationships between them. It is clear from the diagram that it is visually challenging to decipher and ascertain the relationships between the nodes, especially those which are indirect.
The environment shown in Figure 2a comprises a user workstation 210, including related peripheral devices. The workstation 210 includes a microprocessor 212 and a series of connections 214 which may be in the form of a bus and which allow communication between the microprocessor 212 and the components of the workstation.
The workstation 210 includes a user interface adapter 216, which connects the microprocessor 212 via the bus 214 to one or more interface devices, such as a keyboard 218, a mouse 220, and/or other interface devices 222 (including a touch sensitive screen, digitized entry pad, etc). The bus 214 also connects a display device 224, such as an LCD screen or monitor, to the microprocessor 212 via a display adapter 226, and connects the microprocessor 212 to memory 228 and long-term storage 230 which can include a hard drive, diskette drive, tape drive, etc.
The workstation 210 may communicate via a communications channel 232 with other computers or networks of computers. The workstation 210 may be associated with other computers in a local area network (LAN) or a wide area network (WAN), may be a client in a client/server arrangement with another computer or may be a standalone computer not connected in a network, as well known in the art.
Figure 2b illustrates a data processing network 240 in which the present invention may operate. The data processing network 240 may include a plurality of individual networks, including LANs 242 and 244, each of which includes a plurality of 005006227 12 individual workstations 210. Alternatively, as those skilled in the art will appreciate, a LAN may comprise a plurality of intelligent workstations coupled to a host processor.
The data processing network 240 may also include multiple mainframe computers, such as a mainframe computer 246, which may be preferably coupled to the LAN 244 by means of a communications link 248. The mainframe computer 246 may also be coupled to a storage device 250, which may serve as remote storage for the LAN 244. Similarly, the LAN 244 may be coupled to a communications link 252 through a subsystem control unit/communication controller 254 and a communications link 256 to a gateway server 258. The gateway server 258 is preferably an individual computer or intelligent workstation which serves to link the LAN 242 to the LAN 244.
Software code according to the present invention may be accessed by the microprocessor 212 of the workstation 210 from long-term storage media 230 of some type, such as a CD-ROM drive or hard drive. In a client-server environment, such software code may be stored on a server. The code may be embodied on any of a variety of known media including a diskette, hard drive, or CD-ROM. The code may be distributed on such media, or may be distributed to users from the memory or storage of one computer system over a network of some type to other computer systems for use by users of such other systems. Alternatively, the code may be embodied in the memory 228, and accessed by the microprocessor 212 across the bus 214. The techniques and methods for embodying software programming code in memory, on physical media, and/or distributing software code via networks are well known and will not be further discussed herein.
The GUI displays resulting from use of the present invention may be displayed on any of the various display devices 224, and accessed using any type of interface device such as the keyboard 218, mouse 220, and/or other interface devices 222.
Figure 3 shows an exemplary network diagram 40 representative of how a schematic representation of the planar network diagram of Figure 1 can be selectively displayed in an ordered fashion using the graphical user interface according to the present invention.
005006227 13 A primary focus entity node 42 is shown in the centre of the figure surrounded by a plurality of secondary entity nodes 44, 46, 48, 50 and 52. Each of these secondary entity nodes have a direct relationship with the focus entity node, represented by the relationship connectors 60, 62, 64, 66 and 68, and lie on an innermost concentric circle 69. Also shown are tertiary nodes 70, 72, 74, 76, 78 and arranged on an outer circle 81. These nodes are linked to secondary nodes by relationship connectors 82, which are shorter and less bold than the connectors 60-68.
A quaternary node 84 is joined to tertiary node 74 by a connector 86, and lies on an outermost concentric circle 88. It can clearly be seen how, with increase in degrees of separation, the nodes become progressively smaller and fainter relative to the focus entity node 42, as do the connectors.
The faintest connectors are those which do not link directly or indirectly with the focus entity node, such as connectors 90 and 92. These connectors show relationships which are as a rule not of direct or indirect relevance to the current focus node.
Figure 4 shows a reconfigured schematic network diagram, following the user selection of node as the focus entity node. The new focus entity node (now entity F) 46 is shown at the centre of the figure surrounded by a plurality of secondary entity nodes 42, 44, 72 and 74, tertiary nodes L, A, B, J, G and K, and quaternary nodes D and N.
The differences in length of the connectors, the boldness of the connectors, the location of the other entity nodes and the relative size differential between the focus entity node and the other entity nodes are techniques used to increase the ease in which differing relationships between the nodes are displayed, regardless of which node is the selected or focus entity node.
Figure 5 represents an example of an animation strategy that may be used to display the transition from the current focus entity node, such as node C of Figure 3, to a subsequently selected focus entity node, such as node F of Figures 3 and 4.
Displaying the transition of focus entity nodes to a user allows them to rapidly gain an appreciation of the network from a different perspective, by emphasising the changes 005006227 14 made from the existing network. This makes it relatively easier for the user to comprehend the network diagram.
To animate the transition between two frames positions of the entity nodes in the initial frame are calculated, the positions of the entity nodes in the end frame are calculated, the positions of the entity nodes in the start frame determined, and then the positions of the entity nodes in intermediate frames are interpolated. Animations occur over a period of time given by animation period. Accordingly, if the animation starts at time 0; the animation period is 1 second; the initial position of an entity is X 0 and the position upon completion of the animation must be X 100. Then, a linear animation would result in the entity being a position 10 after 0.1 seconds, position 50 after seconds, position 80 after 0.8 seconds and position 100 after 1 second.
However, linear animation looks unnatural because in the real world moving bodies do not achieve infinite acceleration maintain a constant speed, and then achieve infinite deceleration, to stop instantaneously. Accordingly, a transition relative to time comprised of a period of constant acceleration, a period of constant speed and then a period of constant deceleration, produces a much more natural looking animation. This function is diagrammatically represented in Figure 5 relative to a linear animation.
The selective use of acceleration and deceleration gives an appearance that more closely resembles a user's experience of real world transitions. This may be contrasted with a straightforward linear animation.
Turning to Figure 6, additional entity nodes numbered 1 to 17 are included in the prior art schematic network diagram shown in Figure 1 having nodes A to N. As shown in the diagram, typically the screen (represented by the box 105) is panned sideways or zoomed as required in order to display portions of the network that are of interest to the user.
Figure 7 shows a reconfigured network diagram of Figure 6, with node C selected as the focus entity node and all nodes within the screen 105 being taken into consideration, provided such nodes are within three degrees of separation, resulting in 005006227 node 4 being included in the diagram, but all other numbered nodes being excluded.
Accordingly, if the network diagram of Figure 7 were reconfigured about an alternative primary focus entity node than that shown, after the screen 105 was panned out or across to cover the at least some of the presently displayed network entity nodes and the previously non-displayed numbered entity nodes then the diagram would be adjusted as required to include all candidate nodes in the current view.
Turning to Figure 8a, the primary focus entity node is Mrs Sally Smith 42, who has a plurality of (different types of) relationships with various other secondary entity nodes 44, 46, 48, 50, 52, 54 which in turn have a plurality of relationships with other tertiary and quaternary entity nodes. As with Figures 3 and 7, both the direct relationships between the focus entity and the secondary entity nodes are emphasised relative to other entity nodes and relationships.
A customer information display window 110 may display details associated with the primary focus entity node, in this case contact details and account balances are displayed. Of course, any other information may be displayed once a particular entity node is selected. A search window 111 may also be displayed enabling selection of an alternate focus entity node.
As Figures 8b-e show, once the subsequent focus entity node 112 of Mr John Smith has been selected (for example by clicking on the node 110 with a mouse or by entering search details), the network is reconfigured by the context engine so that the focus entity becomes Mr John Smith during the transaction sequence represented by Figures 8a to 8c. The associated secondary relationships and other entity nodes are also translated. As the current focus entity, Mr John Smith is progressively translated to the centre of the screen and is enlarged and coloured, whereas the previous focus entity Mrs Sally Smith moves to the background of the display. Relative changes in the appearance of the relationship connectors and the other entity nodes in the display are also made as previously outlined. In addition, the wife/husband relationship indicators 114 and 116 are ordered so that they correctly convey the relationship between the parties in the new configuration.
005006227 16 Turning to Figures 9a-e, a similar transition is shown between Mr John Smith 112 as a prior focus entity node and The Smith Family Trust 116 as the new focus entity node.
It will be appreciated that the present invention permits the addition of entity nodes to the network as well as the creation, deletion and modification of particular relationship connectors, by a click and drag routine. Rotation of the representation of the network about the focus entity may be activated through user selection of the rotation controls 118.
Referring to Figures 10a-c it would be appreciated by a person skilled in the art that a number of overlays may be implemented over various sub groups of the entity nodes on the network diagram, representing additional information, relationships or some other criteria that may be common to a sub group of the entity nodes. The network shown in Figure 10a shows Mr John Smith as the primary focus entity node 112, surrounded by various related entity nodes, including Mrs Sally Mitchell 124, the Smith Family Trust 126, Dr Jones 128, Smith Corporation 130, and Mrs Mary Geofries 132 connected by the various relationship connectors 140,142,146, 148 and 150 respectively. All the information is provided in a single plane, with each node represented at a position in the plane, which may be defined by particular x, y coordinates in the usual manner. If the operator of the context engine wishes to gain a rapid appreciation of the relative importance of various entity nodes in the network of Figure 10a, they may select to see a particular type of overlay, for example by clicking on a trigger button (not shown) or using a keyboard shortcut.
Figure 10b shows an overlay representative of the relative amounts of debt and equity balances of the entity nodes in an exemplary three dimensional representation.
In addition to the x, y axes, the representation includes a height z. It can be seen that the primary focus entity Mr John Smith 112 has accounts 113a, 113b, 113c, 113d, with the height in the z plane representative of the funds/debt levels associated with those accounts. Also shown with corresponding balances and representative account amounts are the secondary entity nodes 124-132.
005006227 17 Where the secondary entity nodes 124-132 are specifically involved with a particular account the account 113c, which may for example be a cheque account), additional relationship connectors attach between the account of the focus entity node and the relevant entity. For example connector 150 connects Mr Smith's card account with Mrs Mary Geoffries 132 and a tertiary entity. Hence, the representative 3-dimensional overlay enables a banking officer to rapidly gain an appreciation of the relevant importance of the other entities with a selected focus entity.
Alternatively, as would be appreciated by a person skilled in the art, the overlay may take some other form, for example by providing the actual figures on the diagram of Figure As shown in Figure 10c, an alternate overlay may be used to graphically represent the relationship that links the primary focus entity node with other entity nodes on the network, or between other entity nodes. This may be particularly useful in enabling a user to rapidly gain an appreciation of the implications associated with a particular entity node exhibiting some behaviour and provides a context of how this behaviour may affect other entity nodes in the network in which the focus entity node is positioned.
In Figure 10 Oc, Mr John Smith 112, Smith Corporation 128 and Miss Sally Mitchell share one relationship, represented by shading 150. In this example, the relationship is a sharing of risk in Smith Corporation 128. As can be seen the Smith Family Trust 126 does not participate in the risk relationship indicated by shading 150. However, it does share a relationship, which may be viewed as a risk or a responsibility relationship, with a number of tertiary entities. A display of this nature allows, for example, a loans officer in a bank to assess the risk of a particular entity defaulting on any loan arrangement or for an insurance assessor in determining the claim history across a group.
Detailed Exemplary Algorithms The following exemplary algorithms are implemented by the context engine to calculate the layout of and render a Focused Network Diagram.
005006227 18 Algorithm 1: To render a static representation of a network Algorithm 3 is used to determine the current metrics (angular position and distance from its parent) of each of the nodes then, Algorithm 5 is used to determine the co-ordinates of each of the nodes from the current metrics then, Algorithm 6 is used to plot the nodes and connectors onto the canvas Algorithm 2: To render a frame in the transition of the network from one focus node to another: Algorithm 3 is used to determine the current metrics (angular position and distance from its parent) of each of the nodes given the current focus node Algorithm 3 is used to determine the target metrics (angular position and distance from its parent) of each of the nodes given the intended (recently selected) focus node.
then, Algorithm 7 is used to determine the transition proportion given the elapsed time.
0 then, Algorithm 8 is used to determine transitional metrics then, Algorithm 5 is used to determine the co-ordinates of each of the nodes from the transitional metrics then, an additional algorithm may be used to calculate and apply node coordinates offsets resulting from changing parent nodes (due to the selection of a new focus node).
then, Algorithm 6 is used to plot the nodes and connectors onto the canvas Algorithm 3: Where network nodes are plotted.
1. Create a collection of nodes called 'processed nodes' initially empty 2. Create a collection of nodes called 'to be processed nodes', and add the focus node to this collection.
005006227 19 3. Set 'current degrees of separation' to 0 indicating that we are processing the focus node.
4. Set the 'available start angle' of the focus node to 0 Set the 'available end angle' of the focus node to 360 6. While 'current degrees of separation' is less than the maximum degree of separation and the 'to be processed nodes' collection is not empty repeat: 6.1. Create a new collection called 'nodes to be processed next' 6.2. For each of the nodes 'to be processed nodes' collection do the following (the node from this collection as it is processed is referred to as the 'Parent Node'): 6.2.1. Set the 'degrees of separation' attribute on the 'Parent Node' to be the value contained in 'current degrees of separation' 6.2.2. Create a new collection called 'related unprocessed nodes' to which add all the nodes connected to the current 'Parent Node' which do not already exist in the 'process nodes' or the 'to be processed nodes' or the 'nodes to be processed next collection' 6.2.3. Set 'Related Node Ordinal Position' to 0 6.2.4. For each of the nodes in the 'related unprocessed nodes' collection do the following (the node from this collection as it is processed is referred to as the'Child Node'): 6.2.4.1. Set the 'Parent' attribute of the current 'Child Node' to be the current'Parent Node' 6.2.4.2. Set the 'Angle relative to Parent' attribute of the current 'Child Node' to the 'available start angle' of the current 'Parent Node' plus ((the 'available end angle' of the current 'Parent Node' minus the 'available start angle' of the current 'Parent Node') divided by the number of nodes in the 'related unprocessed nodes' collection multiplied by the 'Related Node Ordinal Position') 6.2.4.3. Set the 'available start angle' attribute of the current 'Child Node' to the current child nodes 'Angle relative to Parent' minus ((the 'available end angle' of the current 'Parent Node' minus the 'available start angle' of the current 'Parent Node') divided by the number of nodes in the 'related unprocessed nodes' collection divided by two) 005006227 6.2.4.4. Set the 'available end angle' attribute of the current 'Child Node' to the current child nodes 'Angle relative to Parent' plus ((the 'available end angle' of the current 'Parent Node' minus the 'available start angle' of the current 'Parent Node') divided by the number of nodes in the 'related unprocessed nodes' collection divided by two) 6.2.4.5. Set the 'node emphasis' value and 'parent distance' value of the 'Child Node' using the function described in algorithm 4.
6.2.4.6. Increment the 'Related Node Ordinal Position' by 1.
6.2.5. Add all the nodes in the 'related unprocessed nodes' to the 'nodes to be processed next' collection 6.3. Increment the value in 'current degrees of separation' by 1 6.4.Add the contents of the 'to be processed nodes' collection to the 'processed nodes' collection Clear the contents of the 'to be processed nodes' collection.
6.6.Add all the nodes in the 'nodes to be processed next' collection to the 'to be processed nodes' collection Algorithm 4: Boldness and Connector Length The boldness of the nodes and length of the connectors is determined by the degree of separation of the node or connector from the focus node. Where the node or connector has a smaller degree of separation (and therefore closer to the focus node) it is bolder and longer (to notionally increase its emphasis). Example functions could be:Connector Length (in pixels) 80 (Separation Node Radius 25 (Separation Algorithm 5: Coordinates from transitional metrics 1. Set the attribute of the focus node to the width of the canvas divided by two.
2. Set the attribute of the focus node to the height of the canvas divided by two.
3. Create a collection of nodes called 'to be processed nodes', and add the focus node to this collection.
005006227 21 4. While the 'to be processed nodes' collection is not empty repeat: 4.1. Create a new collection called 'nodes to be processed next' 4.2. For each of the nodes 'to be processed nodes' collection do the following (the node from this collection as it is processed is referred to as the 'Parent Node'): 4.2.1. For each of the nodes in the network do the following (the node from this collection as it is processed is referred to as the 'Related Node'): 4.2.1.1. If the 'Parent' attribute of the 'Related Node' is the 'Parent Node' then: 4.2.1.1.1. Set the and attributes of the 'Related Node' to be the new co-ordinate computed from the and position of the 'Parent Node' translated by a magnitude of the distance given by the 'parent distance' of the 'Related Node' at the angle given by the 'Angle relative to Parent' attribute of the 'Related Node' (using basic trigonometry).
4.2.1.1.2. Add the 'Related Node' to the 'nodes to be processed next' collection.
4.3. Clear the contents of the 'to be processed nodes' collection.
4.4.Add all the nodes in the 'nodes to be processed next' collection to the 'to be processed nodes' collection Algorithm 6: Plot nodes and connectors 1. For each of the connectors in the network do the following (the connector from this collection as it is processed is referred to as the 'Current Connector'): 1.1. If either of the nodes transected by the connector have a 'degrees of separation' less than the maximum degree of separation then: 1.1.1. Determine the weight of the connector by averaging the emphasis value of the two nodes transected by the connector.
1.1.2. If either of the nodes transected by the connector is the parent of the other node set the colour of the line to black, otherwise set the colour to grey.
005006227 22 1.1.3. Plot a line of the determined weight and colour between the coordinates of the two nodes transected by the connector.
1.1.4. Draw the label describing the connector next to the line 2. For each of the nodes in the network do the following (the node from this collection as it is processed is referred to as the 'Current Node'): 2.1. If the node's 'degrees of separation' is less than the maximum degree of separation then: 2.1.1. Draw the node at the position at its required level of emphasis.
2.1.2. Draw the label describing the node next to the line Algorithm 7: Transition Proportion given elapsed time A piecemeal function such as: Let tickCount elapsed time animation period when tickCount<=0 then transition 0 when 0<tickCount<=2/5 then transition (tickCount*tickCount)*25/12; when 2/5<tickCount<=3/5 then transition (tickCount*5-1)/3; when 3/5>tickCount>=1 then transition 1-((tickCount-1)*(tickCount-1))*25/12; when tickCount>1 then transition 1; returns a transition relative to time comprised of a period of constant acceleration, a period of constant speed and then a period of constant deceleration, thereby producing a much more natural looking animation.
005006227 23 Algorithm 8: Transitional position of nodes between the current and target positions Get the 'transition factor' as determined by algorithm 7 from the elapsed time since the animation began.
1. For each of the nodes in the network do the following (the node from this collection as it is processed is referred to as the 'Working Node'): 1.1.1. Using the 'Angle relative to Parent' of the current metrics of the 'Working Node' and the 'Angle relative to Parent' of the target metrics of the 'Working Node' and the 'transition factor' determine the transitional 'Angle relative to Parent' using algorithm 9.
1.1.2. Using the 'parent distance' of the current metrics of the 'Working Node' and the 'parent distance' of the target metrics of the 'Working Node' and the 'transition factor' determine the transitional 'parent distance' using algorithm 9.
Algorithm 9 The transitional value of a property is defined as: 'Transitional Value' ('Target Value' 'Current Value') x 'Transition Factor' 'Current Value' Such that when the 'transitional factor' is 0 the 'transitional value' is the 'current value' and when the 'transitional factor' is 1 the 'transitional value' is the 'target value'.
It will be appreciated that the potential applications of the invention may include any application which can be represented using a non-hierarchical network. Typical applications include, but are not limited to: Assessing the impact of one creditor defaulting in a lending application; Modelling the relationships between a company's clients in a CRM application; The detection of fraudulent patterns of usage of a system or facility; r I 005006227 24 Illustrating the relationship between the characters, plot elements and themes of a book or script; Viewing commonality in call patterns in a telecommunications system; Programme, management of multiple interrelated projects; Browsing the interdependencies between components in a software development project.
It will be understood that the invention disclosed and defined in this specification extends to all alternative combinations of two or more of the individual features mentioned or evident from the text or drawings. All of these different combinations constitute various alternative aspects of the invention.

Claims (33)

1. A computer system comprising a display, at least one input device and a processing unit in communication with the display and the input device, the processing unit also being in communication with a computer memory storing a computer program executable by the processing unit, the processing unit operable to, when executing the computer program, control the display to show a graphical user interface and accept input from the input device to manipulate a view of an inter-related navigable network that is displayed as part of the graphical user interface and which comprises a plurality of nodes, each node being representative of an object and a plurality of relationship connectors extending between the nodes that indicate a graphical relationship between the objects, wherein the processing unit is further operable to implement a node context engine responsive to selection of a node using the input device and operative to reconfigure the network about the selected node so that the selected node becomes a current focus node from which the network radiates, for enabling the network to be interpreted in the context of the current focus node.
2. The computer system of claim 1, wherein the graphical relationship between the current focus node and the other nodes in the network is representative of the degree of separation between the focus node and the other nodes.
3. The computer system of claim 1 or claim 2, wherein the network shows a spatial relationship between the nodes, wherein the positions and distances of the other nodes relative to the current focus node are representative of their respective degree of separation from the current focus node.
4. The computer system of any one of claims 1 to 3, wherein the graphical relationship comprises a graphical representation that emphasises the current focus node and de-emphasises the other nodes, with the degree of emphasis being related to the degree of separation of the other nodes relative to the current node. 005006227 26 The computer system of claim 4, wherein the difference in emphasis is achieved by altering, at successively increasing degrees of separation from the selected entity node, at least one characteristic selected from a group comprising the relative colour, size, boldness, length and shading of the nodes and/or relationship connectors.
6. The computer system of any one of claims 1 to 5, wherein the relationship connectors comprise relationship indicators for indicating the nature of the relationship between the nodes.
7. The computer system of claim 6, wherein at least some of the relationship connectors are directional and the context engine is operable to redirect the relationships in the event of their context changing.
8. The computer system of claim 2 or any one of claims 3 to 7 when dependent on claim 2, wherein the nodes with the same degree of separation from the current focus node are spaced at a similar distance from the current focus node, with successively increasing distances corresponding to successively increasing degrees of separation.
9. The computer system of claim 8, wherein the nodes are arranged in a plurality of concentric circles about the current focus node, with the radial distance from the current focus node being representative of the directness of the relationship between the current focus node and the other nodes. The computer system of any one of claims 1 to 9, wherein the nodes that have a direct relationship with the current focus node are arranged equi-angularly about the current focus node at either a similar distance or equal distance from that node.
11. The computer system of claim 2, or any one of claims 3 to 10 when dependent on claim 2, wherein different nodes that each have a relationship connector with a common node and which have the same degree of separation from the common node are arranged equi-angularly in an arc about the common node. 005006227 27
12. The computer system of any one of claims 1 to 11, wherein the network is non- hierarchical or agnostic, with the relationships between nodes being similarly non-hierarchical in nature, in the sense that any node may be selected to be the focus entity node.
13. The computer system of any one of claims 1 to 12, wherein the entity node context engine is further operative so as only to display nodes which are less than a predetermined degree of separation from the current focus node.
14. The computer system of any one of claims 1 to 13, wherein the node context engine further comprises an animation function to show on the display a reconfiguration of the network. The computer system of claim 14, wherein said animation function is non-linear, having an acceleration and a deceleration phase.
16. The computer system of any one of claims 1 to 15, wherein the node context engine further comprises at least one secondary network indicator to indicate a secondary network or grouping of nodes.
17. The computer system of claim 16, wherein the secondary network indicator comprises an overlay on the graphical user interface which is common between at least some of the entity nodes according to at least one predefined criterion, which may be causally linked.
18. The computer system of claim 17, wherein the predefined criteria is selected from the group comprising a risk profile, balance details, a legal relationship in the event of a loan default, another legal relationship, an activity pattern, and a call pattern.
19. A computer-implemented method of displaying related data, the method comprising: displaying on a display a graphical user interface comprising an inter-related navigable network comprising a plurality of nodes and a plurality of relationship 005006227 28 connectors, each node being representative of an object and the plurality of relationship connectors indicating a relationship between the objects; accepting input from an input device and in response manipulating a view of the network, including in response to the selection of a node reconfiguring the network about the selected node so that the selected node becomes a current focus node from which the network radiates, for enabling the network to be interpreted in the context of the current focus node. The method of claim 19, wherein the step of displaying comprises displaying each of the nodes other than the current focus node at a position and distance relative to the current focus node that is representative of their respective degree of separation from the current focus node.
21. The method of claim 19 or claim 20, wherein the step of displaying comprises emphasising the current focus node and de-emphasising the other nodes, with the degree of emphasis being related to the degree of separation of the other nodes relative to the current focus node.
22. The method of any one of claims 19 to 21, wherein the step of displaying comprises displaying nodes with the same degree of separation from the current focus node at a similar distance from the current focus node, with successively increasing distances corresponding to successively increasing degrees of separation.
23. The method of claim 22, wherein the nodes are arranged in a plurality of concentric circles about the current focus node.
24. The method of claim 22 or claim 23, wherein the nodes that have a direct relationship with the current focus node are arranged equi-angularly about the current focus node. The method of any one of claims 19 to 24, further comprising determining when a plurality of different nodes have a relationship connector with a common node 005006227 29 and have the same degree of separation from the common node and then displaying said different nodes equi-angularly in an arc about the common node.
26. The method of any one of claims 19 to 25, further comprising only displaying nodes which are less than a predetermined degree of separation from the current focus node.
27. The method of any one of claims 19 to 26, further comprising displaying at least one secondary network indicator over the network to indicate a secondary network within said network or a secondary grouping of nodes within said network.
28. A graphical user interface for displaying related data, the interface comprising: an view of an inter-related navigable network comprising a plurality of nodes and a plurality of relationship connectors, each node being representative of an object and the plurality of relationship connectors indicating a relationship between the objects; wherein each node is selectable and in response to the selection of another node from a currently selected node, the interface shows a manipulated view of the network, in which the network is reconfigured about the newly selected node, so that the newly selected node becomes a current focus node from which the network radiates, for enabling the network to be interpreted in the context of the current focus node.
29. The graphical user interface of claim 28, wherein each of the nodes other than the current focus node is displayed at a position and distance relative to the current focus node that is representative of their respective degree of separation from the current focus node.
30. The graphical user interface of claim 28 or claim 29, wherein the current focus node is emphasised and the other nodes are de-emphasised, with the degree of emphasis being related to the degree of separation of the other nodes relative to the current focus node. 005006227
31. The graphical user interface of any one of claims 28 to 30, wherein nodes with the same degree of separation from the current focus node are displayed at a similar distance from the current focus node, with successively increasing distances corresponding to successively increasing degrees of separation.
32. The graphical user interface of any one of claims 28 to 31, wherein the nodes are arranged in a plurality of concentric circles about the current focus node.
33. The graphical user interface of any one of claims 28 to 32, wherein the nodes that have a direct relationship with the current focus node are arranged equi- angularly about the current focus node.
34. The graphical user interface of any one of claims 28 to 33, wherein nodes with a relationship connector with a common node and having the same degree of separation from the common node are displayed equi-angularly in an arc about the common node. The graphical user interface of any one of claims 28 to 34, wherein only nodes which are less than a predetermined degree of separation from the current focus node are displayed.
36. The graphical user interface of any one of claims 28 to 35, further comprising at least one secondary network indicator indicates a secondary network within said network or a secondary grouping of nodes within said network.
37. A computer system substantially according to any one of the embodiments herein described with reference Figures 2 to 5 and Figures 7 to 10 of the accompanying drawings.
38. A computer implemented method of displaying a graphical user interface substantially according to any one of the embodiments herein described with reference Figures 2 to 5 and Figures 7 to 10 of the accompanying drawings. 005006227 IN 31
39. A graphical user interface substantially according to any one of the embodiments herein described with reference Figures 2 to 5 and Figures 7 to 10 of the (c accompanying drawings. S 40. The method of claim 19 and substantially as herein described.
AU2006201531A 2006-04-12 2006-04-12 Entity relationship model method and system Abandoned AU2006201531A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU2006201531A AU2006201531A1 (en) 2006-04-12 2006-04-12 Entity relationship model method and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
AU2006201531A AU2006201531A1 (en) 2006-04-12 2006-04-12 Entity relationship model method and system

Publications (1)

Publication Number Publication Date
AU2006201531A1 true AU2006201531A1 (en) 2007-11-01

Family

ID=38657997

Family Applications (1)

Application Number Title Priority Date Filing Date
AU2006201531A Abandoned AU2006201531A1 (en) 2006-04-12 2006-04-12 Entity relationship model method and system

Country Status (1)

Country Link
AU (1) AU2006201531A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114153350A (en) * 2021-12-06 2022-03-08 北京金堤科技有限公司 Map scaling method and device, storage medium and electronic equipment

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114153350A (en) * 2021-12-06 2022-03-08 北京金堤科技有限公司 Map scaling method and device, storage medium and electronic equipment
CN114153350B (en) * 2021-12-06 2023-09-29 北京金堤科技有限公司 Map scaling method and device, storage medium and electronic equipment

Similar Documents

Publication Publication Date Title
US11132820B2 (en) Graph expansion mini-view
AU2015315277B2 (en) Systems and methods for providing drag and drop analytics in a dynamic data visualization interface
US10997217B1 (en) Systems and methods for visualizing object models of database tables
US11385786B2 (en) Spin control user interface for selecting options
US8072457B2 (en) System and method for providing a dynamic expanded timeline
CN104885048B (en) System and method for managing digital content items
CN103902297B (en) operating system program launch menu search
US20110138340A1 (en) Rotating Hierarchy Cone User Interface
EP2564325B1 (en) Temporary formatting and charting of selected data
US20030222915A1 (en) Data processor controlled display system with drag and drop movement of displayed items from source to destination screen positions and interactive modification of dragged items during the movement
US10838607B2 (en) Managing objects in panorama display to navigate spreadsheet
US20110181597A1 (en) System and method of identifying and visually representing adjustable data
CA2615790A1 (en) Data analysis using graphical visualization
TW201243705A (en) Compact control menu for touch-enabled command execution
EP4064210A1 (en) Method and server for creating and utilizing virtual building
US20020175940A1 (en) Data cylinder for managing ad-hoc data sets
US20080005675A1 (en) Method, system and program product for displaying nodes of a network
AU2006201531A1 (en) Entity relationship model method and system
KR101769129B1 (en) Interaction method for chart to chart in a dashboard that is implemented in an online environment
US20070271520A1 (en) Method for transforming a graphical user interface
US11762534B2 (en) Self-service automated sweeps
Fernandez et al. Information Visualization Techniques for Building Better Visualization Models

Legal Events

Date Code Title Description
MK4 Application lapsed section 142(2)(d) - no continuation fee paid for the application