Abstract: A processing system of including at least one processor may obtain a query to retrieve a set of information from a graph database, the query providing a criterion for identifying graph database vertices that are relevant to the query, identify the graph database vertices that are relevant to the query in accordance with the criterion, obtain vertex identifiers of the relevant vertices, sort the vertex identifiers into a list in a sequential order, identify a first subset of the vertex identifiers in the list that corresponds to a first result index and a result size, access a first subset of the vertices that is identified as being relevant to the query and that is identified by the first subset of the vertex identifiers, retrieve a first subset of the set of information from the first subset of the vertices, and provide the first subset in a first results page.

Abstract: A processing system including at least one processor may be maintain an historical graph database storing historical graph state information for a graph including a set of elements, where the historical graph state information includes, for each element, respective element state information and respective state version tracking information for the respective element. The processing system may receive an event indicative of a management action associated with a first element, where the first element may include a new element to be added to the graph or an existing element of the set of elements. The processing system may update, based on the event, the historical graph state information of the historical graph database, where the updating may include providing respective state version tracking information for the first element, and handle, based on the historical graph database, a query to retrieve a set of information of the graph.

Abstract: A processing system of including at least one processor may obtain a query to retrieve a set of information from a graph database, the query providing a criterion for identifying graph database vertices that are relevant to the query, identify the graph database vertices that are relevant to the query in accordance with the criterion, obtain vertex identifiers of the relevant vertices, sort the vertex identifiers into a list in a sequential order, identify a first subset of the vertex identifiers in the list that corresponds to a first result index and a result size, access a first subset of the vertices that is identified as being relevant to the query and that is identified by the first subset of the vertex identifiers, retrieve a first subset of the set of information from the first subset of the vertices, and provide the first subset in a first results page.

Abstract: Storage systems and method to store data, from a data source, which is responsive to one or more requests from at least one data consumer. A data store is configured to cache at least some data from the data source. A data management component is configured to store the at least some data in the data store based on at least one criteria of the data consumer. At least one criteria is identified based on the one or more requests. Data is stored in the at least some data from the data source in response to the identifying the at least one criteria.

Abstract: A processing system including at least one processor may be maintain an historical graph database storing historical graph state information for a graph including a set of elements, where the historical graph state information includes, for each element, respective element state information and respective state version tracking information for the respective element. The processing system may receive an event indicative of a management action associated with a first element, where the first element may include a new element to be added to the graph or an existing element of the set of elements. The processing system may update, based on the event, the historical graph state information of the historical graph database, where the updating may include providing respective state version tracking information for the first element, and handle, based on the historical graph database, a query to retrieve a set of information of the graph.

Abstract: A processing system including at least one processor may maintain a graph database including graph state information for a set of elements of a graph, where the graph state information includes, for each element in the set of elements of the graph, respective element state information for the respective element. The processing system may further generate, from the graph database, an historical graph database including historical graph state information, where the historical graph state information includes, for each element in the set of elements of the graph, the respective element state information for the respective element and respective state version tracking information for the respective element.

Abstract: A device that monitors a network element in a network topology of network elements within a software defined network (SDN) and identifies a first node state and a second node state for the network element. The device detects an occurrence of an error between the first node state and the second node state. The device determines a differential for the network element between the first node state and the second node state indicating changes to the network element occurring between the first node state and the second node state. The device, based on determining the differential, displays one or more attributes or the one or more relationships associated with the network element at the first node state, the second node state or the differential between states.

Abstract: A device that monitors a network element in a network topology of network elements within a software defined network (SDN) and identifies a first node state and a second node state for the network element. The device detects an occurrence of an error between the first node state and the second node state. The device determines a differential for the network element between the first node state and the second node state indicating changes to the network element occurring between the first node state and the second node state. The device, based on determining the differential, displays one or more attributes or the one or more relationships associated with the network element at the first node state, the second node state or the differential between states.

Abstract: A device that monitors a network element in a network topology of network elements within a software defined network (SDN) and identifies a first node state and a second node state for the network element. The device detects an occurrence of an error between the first node state and the second node state. The device determines a differential for the network element between the first node state and the second node state indicating changes to the network element occurring between the first node state and the second node state. The device, based on determining the differential, displays one or more attributes or the one or more relationships associated with the network element at the first node state, the second node state or the differential between states.

Abstract: A processing system including at least one processor may be maintain an historical graph database storing historical graph state information for a graph including a set of elements, where the historical graph state information includes, for each element, respective element state information and respective state version tracking information for the respective element. The processing system may receive an event indicative of a management action associated with a first element, where the first element may include a new element to be added to the graph or an existing element of the set of elements. The processing system may update, based on the event, the historical graph state information of the historical graph database, where the updating may include providing respective state version tracking information for the first element, and handle, based on the historical graph database, a query to retrieve a set of information of the graph.

Abstract: A processing system including at least one processor may maintain a graph database including graph state information for a set of elements of a graph, where the graph state information includes, for each element in the set of elements of the graph, respective element state information for the respective element. The processing system may further generate, from the graph database, an historical graph database including historical graph state information, where the historical graph state information includes, for each element in the set of elements of the graph, the respective element state information for the respective element and respective state version tracking information for the respective element.

Abstract: A processing system of including at least one processor may obtain a query to retrieve a set of information from a graph database, the query providing a criterion for identifying graph database vertices that are relevant to the query, identify the graph database vertices that are relevant to the query in accordance with the criterion, obtain vertex identifiers of the relevant vertices, sort the vertex identifiers into a list in a sequential order, identify a first subset of the vertex identifiers in the list that corresponds to a first result index and a result size, access a first subset of the vertices that is identified as being relevant to the query and that is identified by the first subset of the vertex identifiers, retrieve a first subset of the set of information from the first subset of the vertices, and provide the first subset in a first results page.

Abstract: Storage systems and method to store data, from a data source, which is responsive to one or more requests from at least one data consumer. A data store is configured to cache at least some data from the data source. A data management component is configured to store the at least some data in the data store based on at least one criteria of the data consumer. At least one criteria is identified based on the one or more requests. Data is stored in the at least some data from the data source in response to the identifying the at least one criteria.