Database with time-dependent graph index
AssigneeSap SE
InventorsAlexander Stork, Anika Pfefferle, Sascha Scherer
Life of this patent
Estimating the term…
Abstract
Data is received that characterizes a data structure comprising a plurality of hierarchical nodes in which dependencies amongst a portion of the nodes are time-dependent. Based on the received data, a graph index is generated for a database that specifies, for each node, all corresponding direct and indirect successor nodes and associated validity time windows. Subsequently, the database receives queries that specify, in a single database protocol command, a request for time-dependent hierarchical information of a node. The database then provides results responsive to the queries (if any). Related apparatus, systems, techniques and articles are also described.
Claims20
A computer-implemented method comprising:
- receiving data characterizing a data structure comprising a plurality of hierarchical nodes in which dependencies amongst a portion of the nodes are time-dependent;
- generating, based on the received data, a graph index for a database that specifies, for each node, all corresponding direct and indirect successor nodes and associated validity time windows including a valid from date and a valid to date;
- receiving, by the database from a client, queries each specifying, in a single database protocol command, a request for time-dependent hierarchical information of a node within a requested validity window;
- and
- providing, by the database to the client using the graph index, results responsive to the queries.
A system comprising:
- at least one data processor;
- and
- memory storing instructions which, when executed by the at least one data processor, result in operations comprising:
- receiving data characterizing a data structure comprising a plurality of hierarchical nodes in which dependencies amongst a portion of the nodes are time-dependent;
- generating, based on the received data, a graph index for a database that specifies, for each node, all corresponding direct and indirect successor nodes and associated validity time windows including a valid from date and a valid to date;
- receiving, by the database from a client, queries specifying, in a single database protocol command, a request for time-dependent hierarchical information of a node within a requested validity window;
- and
- providing, by the database to the client using the graph index, results responsive to the queries.
A non-transitory computer product storing instructions which, when executed by the at least one data processor forming part of at least one computing device, result in operations comprising:
- receiving data characterizing a data structure comprising a plurality of hierarchical nodes in which dependencies amongst a portion of the nodes are time-dependent;
- generating, based on the received data, a graph index for a database that specifies, for each node, all corresponding direct and indirect successor nodes and associated validity time windows including a valid from date and a valid to date within a requested validity window;
- receiving, by the database from a client, queries specifying, in a single database protocol command, a request for time-dependent hierarchical information of a node within a requested validity window;
- and
- providing, by the database to the client using the graph index, results responsive to the queries.
Dependencies are inferred from the claim text.