Augmenting relational databases via database structure graph

One or more computer-readable media storing instructions which, when executed by one or more processors, cause performance of a method of augmenting a relational database environment that is partly described by a database structure graph, wherein nodes of the database structure graph represent fields of the relational database environment and edges of the database structure graph represent associations or hierarchical relationships between respective pairs of fields, the method comprising:

• receiving a command to spawn a new instance of an existing edge among the edges of the database structure graph;
• based on a classification of the existing edge, obtaining a first target set comprising at least one key field multiset and a second target set of non-key fields;
• and
• responsive at least partially to determining that a complete key field multiset of a first database table of the relational database environment satisfies a condition relative to the first target set and that a complete set of non-key fields of the first database table is a subset of the second target set, selecting the first database table for augmentation;
• and
• augmenting the first database table with an augmentation entry for the new instance of the existing edge of the database structure graph.

A method of augmenting a relational database that is partly described by a database structure graph, wherein nodes of the database structure graph represent fields of the relational database and edges of the database structure graph represent associations or hierarchical relationships between pairs of fields, the method comprising:

• at a computer comprising a processor and memory attached thereto:
• receiving a request to spawn a new instance of an existing node among the nodes of the database structure graph;
• based on a classification of the existing node:
• determining a first target set of key field multisets consisting of (i) a singleton multiset corresponding to the existing database structure graph node, or (ii) the singleton corresponding to the existing database structure graph node and a two-member multiset corresponding to the existing database structure graph node and to a parent node of the existing database structure graph node;
• and
• determining a second target set of non-key fields consisting of (iii) a field corresponding to the existing database structure graph node, or (iv) the field corresponding to the existing database structure graph node and a field corresponding to the parent node;
• for each of a third set of a plurality of database tables of the relational database environment:
• determining at least one of:
• a complete key field multiset of the database table;
• or
• a complete set of non-key fields of the database table;
• determining whether the complete key field multiset of the database table is a member of the first target set and/or the complete set of non-key fields of the database table is a subset of the second target set;
• based on determining whether the complete key field multiset is a member of the first target set and the complete set of non-key fields is a subset of the second target set, switching between (i) augmenting the database table with a new entry for the new instance of the existing database structure graph node and (ii) not augmenting the database table with a new entry for the new instance of the existing database structure graph node;
• wherein the relational database is based on a database structure graph comprising a plurality of nodes connected by edges, and the complete key field multiset and the complete set of non-key fields are restricted to fields corresponding to nodes of the database structure graph.