Abstract: A method of copying a production database to a test environment using one or more processors. The production database includes a plurality of tables and one or more constraints indicating interleaving of the plurality of tables. The method involves constructing a directed acyclic graph (DAG) of the plurality of tables, whereby each table is represented by a respective node of the DAG and interleaving of the tables is represented by edges of the DAG, topologically ordering the tables according to the DAG, and copying data from the production database to the test environment according to the topological ordering of the tables.

Abstract: A method of copying a production database to a test environment using one or more processors. The production database includes a plurality of tables and one or more constraints indicating interleaving of the plurality of tables. The method involves constructing a directed acyclic graph (DAG) of the plurality of tables, whereby each table is represented by a respective node of the DAG and interleaving of the tables is represented by edges of the DAG, topologically ordering the tables according to the DAG, and copying data from the production database to the test environment according to the topological ordering of the tables.

Abstract: Aspects of the disclosure are directed to populating test datastores in a computing environment for integration testing. A datastore populator system identifies the datastore relationships between tables of multiple different datastores and populates data according to those identified relationships when the relationships are not explicitly defined by a database schema or documentation. A datastore relationship can refer to data shared across the same or different datastores. Aspects of the disclosure provide for identifying those implicit relationships for populating test datastores for use in testing a service or application, to accurately simulate the interaction between multiple relational datastores. Relationships between values of columns across tables may be referred to as invisible foreign key relationships.

Abstract: A method of copying a production database to a test environment using one or more processors. The production database includes a plurality of tables and one or more constraints indicating interleaving of the plurality of tables. The method involves constructing a directed acyclic graph (DAG) of the plurality of tables, whereby each table is represented by a respective node of the DAG and interleaving of the tables is represented by edges of the DAG, topologically ordering the tables according to the DAG, and copying data from the production database to the test environment according to the topological ordering of the tables.

Abstract: Methods, systems and computer software program code products enabling the matching of a large number of names across any of a range of different languages comprise: receiving incoming names in any of a set of languages or scripts; generating high-recall keys based on the received incoming names; executing a full-text index process based on the generated high-recall keys; and looking up candidates for matching.

Abstract: A system and method for natural language processing comprises a blackboard data structure for providing a shared knowledge repository over which a collection of natural language agents can execute processes on the processable data form, each agent being capable of providing a processing resource usable for serving requests to execute a natural language process on the processable data form, and determining, based on their respective capabilities and examination of the blackboard, what requests for processing they can best serve; and a dispatcher for coordinating the work of registered agents, maintaining a high-level description of tasks to be completed to provide a solution to a given natural language engineering problem, and determining the registered agents that best provide a solution to the given natural language engineering problem.