Apparatus and method providing flexible hierarchies in database applications

• US 10,204,149 B1
• Filed: 01/11/2016
• Issued: 02/12/2019
• Est. Priority Date: 01/13/2015
• Status: Active Grant

• Current Assignee: ServiceNow Incorporated
• Original Assignee: ServiceNow Incorporated
• Inventors: Henderson, Lisa
• Primary Examiner(s): Mobin, Hasanul
• Application Number:
  US14/992,388
• Time in Patent Office: 1,128 Days
• CPC Class Codes: G06F 16/21 Design, administration or maintenance of databases
• CPC Class Codes: G06F 16/252 between a Database Management System and a front-end application
• CPC Class Codes: G06F 16/282 Hierarchical databases, e.g. IMS, LDAP data stores or Lotus Notes

Abstract

A computer-driven system manages databases of flexible storage hierarchy. Computer servers include machine-readable storage containing at least one database, the database comprising multiple data records represented by multiple nodes. Each node has a node type and represents records of a corresponding record type. The nodes are embodied by machine-readable data stored in one or more tables. Multiple client-originated direct links are embodied by data stored in the one or more tables, where each one of the direct links directly connecting a different pair of the nodes. Multiple system-originated calculated links are embodied by data stored in the one or more tables. Each calculated link acts in observance with a rules framework to connect pairs of the nodes that would otherwise be connected only indirectly through one or more intermediate nodes and direct links between said intermediate nodes.

Claims

1. A computer-based server with a variable hierarchical architecture database, comprising:

a processor;

a network interface comprising input/output connections connected to a network to communicate data from the server to remote clients via the input/output connections over the network;

a plurality of modules comprising stored instructions executable on the processor;

multiple digital data storage devices each comprising a memory and each communicatively coupled to the processor, the storage devices storing the hierarchical architecture database;

wherein the database comprises;

multiple data records represented by multiple nodes, each node comprising node data of a node type and representing records of a corresponding record type stored in a table in the memory;

multiple client-originated direct links comprising data stored in the table, each one of the direct links directly connecting a different pair of the nodes;

a prescribed rules framework stored in the memory and comprising a plurality of rules; and

multiple system-originated calculated links comprising data stored in the table, each calculated link based on a rule of the plurality of rules in the prescribed rules framework that directly connects pairs of the nodes that would otherwise only be indirectly connected through one or more intermediate nodes, wherein the plurality of rules comprise a rule configured to prohibit a system-originated calculated link from linking a pair of nodes of the same node type, and a rule configured to prohibit a system-originated calculated link that duplicates a client-originated direct link.

2. The server of claim 1, wherein the node types further comprise the following node types of an application:

a top node utilized for categorization and to which calculated links are applied; and

a data node to which calculated links are applied.

3. The server of claim 2, further comprising a link management module of the plurality of modules that:

detects client input creating a new direct link between a pair of nodes; and

responds to detecting the client input, by;

responsive to presence of a calculated link that duplicates the new direct link, deleting the calculated link;

responsive to the new direct link indirectly forming new connections of a node to the top node, establishing a calculated link between each of the nodes and the top node; and

responsive to the new direct link indirectly forming new connections of a node to the data node, establishing a calculated link between each of the nodes and the data node.

4. The server of claim 1, further comprising:

an analysis module of the plurality of modules that analyzes direct interconnections between the nodes to discover indirect relationships between the nodes.

5. The server of claim 4, wherein the analysis module, based upon the discovered indirect relationships, updates tables with calculated links representing every possible interconnection as permitted by the prescribed rules framework to:

(1) a top or authoritative source node; and

(2) a control or data node.

6. The server of claim 1, comprising a link management module of the plurality of modules that:

detects client input amending interconnections between the nodes, wherein the amending includes;

adding, deleting, or modifying the direct links; and

responds to detecting the client input by;

identifying any new indirect interconnections between node types and all other nodes in the database, and adding new calculated links representing the new indirect interconnections; and

identifying any of the calculated links that represent indirect nodal connections severed by the client input, and updating the calculated links to remove the identified calculated links.

7. The server of claim 6, wherein the identifying of any new indirect interconnections comprises applying the prescribed rules framework to:

(1) nodes directly or indirectly connected by direct link before the client input;

or (2) nodes directly or indirectly connected by direct link after the client input.

8. The server of claim 1, comprising a link management module of the plurality of modules that:

detects client input deleting a direct link; and

responds to detecting the client input by;

searching for any replacement paths via remaining links that still achieve the deleted direct link;

responsive to not finding any replacement paths, deleting all calculated links representing paths with the deleted direct link as a component; and

responsive to finding any replacement paths, retaining or updating calculated links representing paths with the deleted direct link as a component.

16. The server of claim 1, wherein the processor is configured to:

aggregate the node data from each node of the multiple nodes based on the multiple client-originated direct links and the multiple system-originated calculated links; and

generate a report for display on at least one remote client of the remote clients, wherein the report comprises the aggregated node data.

17. The server of claim 16, wherein the multiple client-originated direct links and the multiple system-originated calculated links represent every possible link between the multiple nodes permitted by the plurality of rules.

18. The server of claim 16, wherein the processor is configured to update the multiple system-originated calculated links and the aggregated node data of the report in response to a modification of the multiple client-originated direct links.

19. The server of claim 16, wherein the report is configured to efficiently and accurately provide updated information associated with any hierarchy of the multiple nodes based on the multiple client-originated direct links, the prescribed rules framework, and the multiple system-originated calculated links.

9. A computer implemented method for managing a variable hierarchical architecture database in a server, the method comprising utilizing a processor of the server for:

creating the database in a memory associated with the processor;

storing multiple data records represented by multiple nodes, each node having a node type and representing records of a corresponding record type, the nodes embodied by machine-readable data stored in a table;

storing multiple client-originated direct links embodied by data stored in the table, each one of the direct links directly connecting a different pair of the nodes; and

calculating multiple system-originated calculated links comprising data stored in the table, each calculated link based on a rule of a plurality of rules in a prescribed rules framework to connect pairs of the nodes that would otherwise only be indirectly connected through one or more intermediate nodes, wherein the plurality of rules comprise a rule configured to prohibit a system-originated calculated link from linking a pair of nodes of the same node type, and a rule configured to prohibit a system-originated calculated link that duplicates a client-originated direct link.

10. The method of claim 9, further comprising:

detecting client input amending interconnections between nodes, wherein the amending comprises;

adding, deleting, or modifying direct links; and

responsive to detecting the client input;

identifying any new indirect interconnections between node types and all other nodes in the database, and adding new calculated links representing the new indirect interconnections; and

identifying any of the calculated links that represent indirect nodal connections severed by the client input, and updating the calculated links to remove the identified calculated links.

11. The method of claim 9, further comprising:

analyzing direct interconnections between the nodes to discover indirect relationships between the nodes.

12. The method of claim 9, wherein the identifying of any new indirect interconnections comprises:

applying the prescribed rules framework to;

(1) nodes directly or indirectly connected by direct link before the client input;

or (2) nodes directly or indirectly connected by direct link after the client input.

13. The method of claim 9, further comprising:

detecting client input deleting a direct link; and

responding to detecting the client input by;

searching for any replacement paths via remaining links that still achieve the deleted direct link;

responsive to not finding any replacement paths, deleting all calculated links representing paths with the deleted direct link as a component; and

responsive to finding any replacement paths, retaining or updating calculated links representing paths with the deleted direct link as a component.

14. The method of claim 9, wherein the calculated and direct links share the same tables.

15. A non-transitory computer-readable storage medium, comprising executable instructions that, when executed by a processor, facilitate performance of operations, comprising:

creating the database in a memory associated with the processor;

storing multiple data records represented by multiple nodes, each node having a node type and representing records of a corresponding record type, the nodes embodied by machine-readable data stored in a table;

storing multiple client-originated direct links embodied by data stored in the table, each one of the direct links directly connecting a different pair of the nodes; and

calculating multiple system-originated calculated links comprising data stored in the table, each calculated link based on a rule of a plurality of rules in a rules framework to connect pairs of the nodes that would otherwise only be indirectly connected through a-directly connected one or more intermediate node nodes, wherein the plurality of rules comprise a rule configured to prohibit a system-originated calculated link from linking a pair of nodes of the same node type, and a rule configured to prohibit a system-originated calculated link that duplicates a client-originated direct link.