Abstract: A network device associated with a database management system receives information associated with a customer support ticket. Based on information in the database management system, a direct relationship between the received customer support ticket and a customer support ticket in the database may be determined. A graph including nodes representing customer support tickets is generated based on information in the database. Edge prediction is performed on the graph to derive relationships among the nodes in the graph. A predictive relationship between customer support tickets is derived. A relationship data set based on the direct relationship between the customer support tickets and based on the predictive relationship between the customer support tickets is generated. The relationship data set associated with the customer support ticket is communicated to the user device.

Abstract: A network device associated with a database management system receives information associated with a customer support ticket. Based on information in the database management system, a direct relationship between the received customer support ticket and a customer support ticket in the database may be determined. A graph including nodes representing customer support tickets is generated based on information in the database. Edge prediction is performed on the graph to derive relationships among the nodes in the graph. A predictive relationship between customer support tickets is derived. A relationship data set based on the direct relationship between the customer support tickets and based on the predictive relationship between the customer support tickets is generated. The relationship data set associated with the customer support ticket is communicated to the user device.

Abstract: The present invention establishes a process for creating a set of structures that allows efficient storage and subsequent handling. The multigraph is represented using bitmaps with element counters and mappings between values and organized bitmaps to faciliate the handling of the multigraphs. The bits in the bitmaps represent two aspects of the multigraph: 1) indexing of all the objects of the multigraph as a function of their identifiers and 2) connectivity between objects of the multigraph, whether they are vertices or edges. Mappings allow, given a value, accessing the objects of the multigraph which contain such value. Multigraph operations are solved by accessing the mappings and applying logical operations on the bitmaps. This way of representing a graph allows efficiently performing graph operations such as: inserting a vertex or an edge, inserting an attribute, acquiring the incoming and outgoing edges of an attribute, etc.

Abstract: The present invention establishes a process for creating a set of structures that allows efficient storage and subsequent handling. The multigraph is represented using bitmaps with element counters and mappings between values and organized bitmaps to faciliate the handling of the multigraphs. The bits in the bitmaps represent two aspects of the multigraph: 1) indexing of all the objects of the multigraph as a function of their identifiers and 2) connectivity between objects of the multigraph, whether they are vertices or edges. Mappings allow, given a value, accessing the objects of the multigraph which contain such value. Multigraph operations are solved by accessing the mappings and applying logical operations on the bitmaps. This way of representing a graph allows efficiently performing graph operations such as: inserting a vertex or an edge, inserting an attribute, acquiring the incoming and outgoing edges of an attribute, etc.