Abstract: In various example embodiments, multiple workspaces have access to modify values in a graph database. The graph database can comprise a collection of entity nodes, where each entity node is connected to an identifier node and one or more state nodes. An update to an entity node can be recorded by generating a new state node to store the update and connecting the new state node to the entity node. How each workspace views the database is based, at least in part, on which state nodes are associated with each workspace. The workspaces are independent of one another, and changes made to an entity node in one workspace do not affect how another workspace views the same entity node. By managing database data for each of the workspaces using the same graph database and recording changes in state nodes in an additive manner, the computational overhead is greatly reduced and simplified.

Abstract: Systems and methods for multiple updates to a database using paths is disclosed. Updates to a graph database can be performed by associating an attribute node, that stores the updated value, to the entity node to-be updated. When the entity node is queried for the value, the nearest attribute node is identified using a shortest path determination.

Abstract: Systems and methods for multiple updates to a database using paths is disclosed. Updates to a graph database can be performed by associating an attribute node, that stores the updated value, to the entity node to-be updated. When the entity node is queried for the value, the nearest attribute node is identified using a shortest path determination.

Abstract: In various example embodiments, multiple workspaces have access to modify values in a graph database. The graph database can comprise a collection of entity nodes, where each entity node is connected to an identifier node and one or more state nodes. An update to an entity node can be recorded by generating a new state node to store the update and connecting the new state node to the entity node. How each workspace views the database is based, at least in part, on which state nodes are associated with each workspace. The workspaces are independent of one another, and changes made to an entity node in one workspace do not affect how another workspace views the same entity node. By managing database data for each of the workspaces using the same graph database and recording changes in state nodes in an additive manner, the computational overhead is greatly reduced and simplified.

Abstract: In various example embodiments, multiple workspaces have access to modify values in a graph database. The graph database can comprise a collection of entity nodes, where each entity node is connected to an identifier node and one or more state nodes. An update to an entity node can be recorded by generating a new state node to store the update and connecting the new state node to the entity node. How each workspace views the database is based, at least in part, on which state nodes are associated with each workspace. The workspaces are independent of one another, and changes made to an entity node in one workspace do not affect how another workspace views the same entity node. By managing database data for each of the workspaces using the same graph database and recording changes in state nodes in an additive manner, the computational overhead is greatly reduced and simplified.

Abstract: In various example embodiments, multiple workspaces have access to modify values in a graph database. The graph database can comprise a collection of entity nodes, where each entity node is connected to an identifier node and one or more state nodes. An update to an entity node can be recorded by generating a new state node to store the update and connecting the new state node to the entity node. How each workspace views the database is based, at least in part, on which state nodes are associated with each workspace. The workspaces are independent of one another, and changes made to an entity node in one workspace do not affect how another workspace views the same entity node. By managing database data for each of the workspaces using the same graph database and recording changes in state nodes in an additive manner, the computational overhead is greatly reduced and simplified.

Abstract: Systems and methods for multiple updates to a database using paths is disclosed. Updates to a graph database can be performed by associating an attribute node, that stores the updated value, to the entity node to-be updated. When the entity node is queried for the value, the nearest attribute node is identified using a shortest path determination.

Abstract: According to some embodiments, a method and apparatus are provided to receive an indication of data corrections to a database and receive an indication that the data corrections to the database were verified. A first amount of points to award to a first user associated with the data corrections and a second amount of points to award to a second user associated with the verification of the data corrections is determined. The first amount of points is awarded to the first user and the second amount of points is awarded to the second user.

Abstract: According to some embodiments, a plurality of source records may be received from a plurality of data sources, with each source record including a plurality of fields. It may be determined that a match group of source records from different data sources relate to the same entity, and a single best record may be automatically created for the match group based on field values from different source records in the match group. The creating may includes, for example, assigning a first set of fields to a first survivorship group associated with a first survivorship rule and a second set of fields to a second survivorship group associated with a second survivorship rule. All records in the match group may then be simultaneously ranked in accordance with the first and second survivorship rules using a single query. The best record could then be stored for subsequent use by other applications.

Abstract: According to some embodiments, a script written in a scripting programming language may be received (e.g., by a script executer). It may be determined that a first line in the script comprises a first comment, and the first comment may be interpreted as an embedded parallel part control statement. Parallel execution of a portion of the script may then be automatically arranged in accordance with the parallel part control statement.

Abstract: According to some embodiments, a data source is accessed from which data will be retrieved via a plurality of processing threads. The data source may have, for example, a plurality of records with each record being associated with a plurality of identifiers. Each of the plurality of identifiers may be dynamically evaluated as a potential range identifier, and the evaluation may be based at least in part on a number of distinct values present within each identifier. One of the potential range identifiers may be selected as a selected range identifier, and the plurality of records may be divided into ranges defined using the selected range identifier.

Abstract: According to some embodiments, a method and apparatus are provided to receive a syntax correct query, analyze the syntax correct query, and output a message associated with the syntax correct query.

Abstract: According to some embodiments, a method and apparatus are provided to receive an indication of data corrections to a database and receive an indication that the data corrections to the database were verified. A first amount of points to award to a first user associated with the data corrections and a second amount of points to award to a second user associated with the verification of the data corrections is determined. The first amount of points is awarded to the first user and the second amount of points is awarded to the second user.

Abstract: According to some embodiments, a method and apparatus are provided to receive a syntax correct query, analyze the syntax correct query, and output a message associated with the syntax correct query.

Abstract: According to some embodiments, a plurality of source records may be received from a plurality of data sources, with each source record including a plurality of fields. It may be determined that a match group of source records from different data sources relate to the same entity, and a single best record may be automatically created for the match group based on field values from different source records in the match group. The creating may includes, for example, assigning a first set of fields to a first survivorship group associated with a first survivorship rule and a second set of fields to a second survivorship group associated with a second survivorship rule. All records in the match group may then be simultaneously ranked in accordance with the first and second survivorship rules using a single query. The best record could then be stored for subsequent use by other applications.

Abstract: According to some embodiments, a script written in a scripting programming language may be received (e.g., by a script executer). It may be determined that a first line in the script comprises a first comment, and the first comment may be interpreted as an embedded parallel part control statement. Parallel execution of a portion of the script may then be automatically arranged in accordance with the parallel part control statement.

Abstract: According to some embodiments, a data source is accessed from which data will be retrieved via a plurality of processing threads. The data source may have, for example, a plurality of records with each record being associated with a plurality of identifiers. Each of the plurality of identifiers may be dynamically evaluated as a potential range identifier, and the evaluation may be based at least in part on a number of distinct values present within each identifier. One of the potential range identifiers may be selected as a selected range identifier, and the plurality of records may be divided into ranges defined using the selected range identifier.