Hewlett-packard Development Company, L.p.

Entit Software LLC

Hewlett Packard Enterprise Development LP

Micro Focus Lcc

Arik Sityon

Uri Ben-Dor

Eyal Regev

Ruth Bergman

Omer Barkol

Shahar Golan

Ran Biron

Mohammed J Zaki

Yifat Felder

Pranay Anchuri

Nadav Sharir

Einat Atedgi

Assif Ziv

Ifat Afek

A method for discovering representative composite configuration item (CI) patterns in an IT system that includes a plurality of configuration items may include data mining a graph representing the IT system to extract extended frequent composite CI patterns. The method may also include clustering the extended frequent composite CI patterns into clusters based on similarity between the maximal frequent composite CI patterns. The method may further include extracting a representative composite CI pattern for each of the clusters, and using an output device, outputting the representative composite CI pattern for each of the clusters.

Discovering representative composite CI patterns in an it system

Systems, methods, and other embodiments associated with virtual topological queries are described. One example method includes executing a first topological query on a stored graph to generate a first result graph. The example method may also include manipulating the first result graph to generate a virtual query result graph as a function of a second topological query. The example method may also include providing the virtual query result graph.

Virtual topological queries

A method for performing a live topological query includes, with a querying application, using a query graph to create a live topological query result from a database storing a full structure graph while not storing an entirety of the query result in a cache memory. The method further includes, in response to detecting a change within full structure graph, performing a calculation to determine whether the change is relevant to the query result, and notifying the querying application of a relevant change to the query result without relying on a fully cached copy of the query result.

Live topological query

Each node of a topological database that represents an information technology environment with multi-tenancy capability represents a configuration item within the environment and is characterized by a tenant authorization rule that indicates a list of tenants that are authorized to access the corresponding configuration. An unrestricted result to an unrestricted query is obtained, the unrestricted query being representable as a sub-graph isomorphism. The unrestricted result includes groups of nodes of the database that satisfy the isomorphism. A tenant query is applied to the unrestricted result to obtain an authorized result, the tenant query being representable by the same sub-graph isomorphism as the unrestricted query. The authorized result includes identification of any of the groups whose component nodes are each characterized by a TAR that authorizes access by the querying tenant. A notification is issued to the querying tenant on the basis of the obtained authorized result.

Topological query in multi-tenancy environment

Systems, methods, and other embodiments associated with graph authorization are described. One example method includes detecting that a user query shares a hook node with an authorization query. The example method may also include generating a base result graph by executing the user query on a base graph and generating an authorized graph by executing the authorization query on the base result graph. The method may also include providing the authorized graph.

Graph authorization

Methods, systems, and computer-readable media with executable instructions stored thereon for managing access authorization to hardware and data resources. A method includes defining a property of a hardware and/or data resource. This example method further includes defining a role such that each defined role can be applied to different users without modification, defining a security domain for the property of the resource in the context of a user-role assignment and assigning a role to a user in a context of the defined security domain.

Access authorization

Systems, methods, and other embodiments associated with graph searching are described. One example method includes selecting a first engine for searching a graph for instances of a pre-specified sub-graph. The example method may also include controlling execution of a search for the pre-specified sub-graph using the first engine. The example method may also include storing performance data describing a performance indicator of the search.

Growing community of inventors

Ganne Tiqwa, Israel

Arik Sityon