Techniques and structures to facilitate instantiating a data model, including receiving a parameterized encoding of a data model including one or more scenarios, receiving data from a source, executing one or more operations associated with each of the one or more scenarios to transform the received data and creating a plurality of records for the data model based on the transformed data.

Aspects of the disclosure relate to dynamic model configuration and execution. A computing platform may receive first model data comprising first model execution configuration data and first model output configuration data. The computing platform may generate a first model based on the first model execution configuration data. The computing platform may distribute, to a plurality of computing platforms, the first model, the first model execution configuration data, and the first model output configuration data. The computing platform may receive a second request to execute one or more models from a third computing platform. The computing platform may receive, from the third computing platform, first model execution data. The computing platform may execute the first model based on the first model execution data and the first model execution configuration data to generate a first model output score.

Disclosed herein are system, method, and device embodiments for consuming application-owned database objects via an API schema. An embodiment operates by determining that an application-owned database object is classified as API exposable, creating an API schema for proxy access to database objects that have been identified as API exposable, generating an API object within the API schema based on assigning the database object to the API schema, and providing, via the API schema and independent of the application, access to the API object by a privileged consumer.

A system and method for analyzing directory service environment attack path choke points for an enterprise may continuously collect data about the attack paths and provide alerts.

Techniques are disclosed to safely and performantly store data in a distributed graph database. In various embodiments, a combination of a replication protocol for data redundancy with a chain-commit protocol is used to ensure a safe ordering of concurrent updates across servers. The resulting protocol allows a distributed graph database to simultaneously uphold ACID properties and a useful degree of scalability through concurrent processing of updates in the typical case, and serialization of updates only where data integrity would otherwise be at risk.

A management system of the present invention includes a design database storing member identification information, member coordinates, and member shapes of construction members constituting a construction object, a management member selecting unit configured to select a management member to be managed among the construction members stored in the design database, a related member selecting unit configured to select a related member adjacent to the management member from the design database, a boundary information creating unit configured to select an adjacent portion between the management member and the related member, and with respect to the adjacent portion, as boundary information, associate identification information, adjacent portion coordinates, an adjacent portion shape of the adjacent portion, member identification information of the management member, and member identification information of the related member with each other, and a comparison result database configured to store information associated by the boundary information creating unit.

Systems, methods, and other embodiments associated with migrating key-value data to a relational database. A method comprises retrieving a namespace from a key-value store and querying the key-value store for all kinds associated with the namespace. For a first kind, retrieving all entities associated with the namespace and the first kind and generating an entity list including an entry for each of the entities retrieved and the corresponding entity data. The entity list is traversed to identify each property name and associated property value. A relational database model is generated including a table based on the namespace and kind. Columns are defined in the table corresponding to each property name from the entity list. Data from each entity is then inserted into a table row and each property value from the entity is mapped to a corresponding column that is defined with the corresponding property name.

Techniques for customizing knowledge representation systems including identifying, based on a plurality of concepts in a knowledge representation (KR), a group of one or more concepts relevant to user context information, and providing the identified group of one more concepts to a user. The KR may include a combination of modules. The modules may include a kernel and a customized module customized for the user. The kernel may accessible via a second KR.

In order to perform a semantic search based on a graph database, sets of nodes are selected from a plurality of nodes in a graph database. A set of nodes semantically matches a keyword in a natural language query. At least one target node is identified in the sets of nodes. A path is selected from candidate paths based on similarities between the candidate paths and a plurality of paths in the graph database. A graph query for retrieving information from the graph database is generated based on the selected path and the query target.

Systems and processes for managing an information retrieval database are provided. In a method for modeling a data object storing table relationships for tables belonging to a computer application, a first set of table links are retrieved from the data object and an enhanced set of table links are generated by appending additional table links to the first set based on linkages within the tables and/or code extensions/add-ins. A first set of field links are generated for the data object by matching metadata of the enhanced set of table links, and an enhanced set of field links are generated by performing additions, deletions, or replacements within the first set based on characteristics of the field links in the first set and/or code extensions/add-ins. A model for the data object is generated, representing the enhanced set of table links and the enhanced set of field links, and stored in a database.