Abstract: A process for mining existing views to generate new views is provided herein. A request to generate a proposed view combining a plurality of tables in a database may be received. One or more existing views in the database applicable to the request may be identified. The applicable existing views may include the plurality of tables in the request. One or more paths combining the plurality of tables may be identified in the respective one or more existing views. The identified one or more paths may be provided. One or more scores for the one or more paths may be generated and provided along with the one or more paths. A path may be automatically selected based on the scores or a path may be selected by a user. A view may be generated based on the selected path.

Abstract: Automatic rule generation is provided herein for generating data mapping, data transformation, or process flow rules or logic statements. The rules may be generated based on a field or attribute, and may be further based on a partial rule or one or more existing rules, or a combination thereof. Proposed rules may be generated based on analysis of a data set, including identifying possible values for the attribute and to calculate scores for the possible values. A score may be the probability of the value based on the data set. The data set may be cleaned or scrubbed based on the partial rule or existing rules. The proposed rules may be provided to a user, or may be automatically selected. Rule generation may include constraint checking. Constraint checking may include detecting empty data sets or detecting when two rules are not mutually exclusive.

Abstract: A method for data model clustering is provided herein. A first representation of a data model may be received. Edge betweenness values may be determined for respective nodes in the first representation. At least one node in the first representation may be identified as a linking node based on the respective edge betweenness values. One or more linking nodes may be removed from the first representation, thereby forming at least a first cluster and a second cluster. Degrees for the respective remaining nodes may be calculated. Respective hub nodes may be identified for the respective clusters based on the respective degrees in the clusters. Respective descriptions may be generated for the respective clusters based on the respective hub nodes. A clustered representation of the first representation may be stored with the clusters and their respective descriptions.

Abstract: A metastructure for representing and manipulating or analyzing a data model is provided herein. A source representation of the first data model may be received. The source representation may include a representation of one or more structural components of the first data model, respectively having identifiers and types. One or more instances of a metastructure schema object datatype may be generated based on the one or more structural components of the source representation. Generating a given instance of the metastructure schema object datatype for a given structural component may include assigning a first identifier of the given structural component to the first data member of the given instance, determining a first type associated with the given structural component, and assigning the first type to the second data member of the given instance. The one or more instances of the metastructure schema object datatype may be stored in association.

Abstract: A method for aligning data model schemas is provided herein. A first schema and a second schema may be received. The schemas may include sets of nodes and links between the nodes. An anchor point between the first schema and the second schema may be received. A source node in the first schema may be identified to be mapped to the second schema. A source distance may be calculated between the source node and the anchor point in the first schema. Option distances may be calculated between the anchor point and the other nodes in the second schema. Penalty scores may be calculated for the option distances. A mapping node may be selected from the nodes in the second schema based on their penalty scores. A new anchor point identifying a correspondence between the source node and the mapping node may be stored.

Abstract: Techniques and solutions are described for determining, evaluating, and selecting data retrieval pathways. A plurality of database objects, such as tables, can be retrieved, and relationships between them determined. The relationships are between various attributes of the database objects. A plurality of pathways are determined between at least two target database objects, where the path determination does not consider attribute-level relationship information. After a path is determined, the relationship-level information can be added. A summary of the path, and relationship information, can be displayed to a user. A user can select paths to remove from the display, and can indicate one or more database objects that are required for a valid path, one or more database objects that are prohibited from valid paths, or combinations thereof. A user can select a path, and a query language statement to implement the path can be generated and displayed to the user.

Abstract: Techniques and solutions are described for determining, evaluating, and selecting data retrieval pathways. A plurality of database objects, such as tables, can be retrieved, and relationships between them determined. The relationships are between various attributes of the database objects. A plurality of pathways are determined between at least two target database objects, where the path determination does not consider attribute-level relationship information. After a path is determined, the relationship-level information can be added. A summary of the path, and relationship information, can be displayed to a user. A user can select paths to remove from the display, and can indicate one or more database objects that are required for a valid path, one or more database objects that are prohibited from valid paths, or combinations thereof. A user can select a path, and a query language statement to implement the path can be generated and displayed to the user.

Abstract: A process for mining existing views to generate join statements is provided herein. A request to generate a join statement may be received, which may include a database object identifier to be part of the join statement. One or more views in the database may be identified, which may include the database object identifier. One or more edges in the one or more views may be identified, which may include the database object identifier. Scores for the one or more edges may be calculated. The edges may be filtered based on their scores according to one or more filtering rules. The filtered edges may be provided. A selected edge may be received, which may be selected from the provided filtered edges. The join statement may be generated in a query language. The join statement may be based on the selected edge. The generated join statement may be provided.

Abstract: A process for mining existing views to generate new views is provided herein. A request to generate a proposed view combining a plurality of tables in a database may be received. One or more existing views in the database applicable to the request may be identified. The applicable existing views may include the plurality of tables in the request. One or more paths combining the plurality of tables may be identified in the respective one or more existing views. The identified one or more paths may be provided. One or more scores for the one or more paths may be generated and provided along with the one or more paths. A path may be automatically selected based on the scores or a path may be selected by a user. A view may be generated based on the selected path.

Abstract: Techniques and solutions are described for determining, evaluating, and selecting data retrieval pathways. A plurality of database objects, such as tables, can be retrieved, and relationships between them determined. The relationships are between various attributes of the database objects. A plurality of pathways are determined between at least two target database objects, where the path determination does not consider attribute-level relationship information. After a path is determined, the relationship-level information can be added. A summary of the path, and relationship information, can be displayed to a user. A user can select paths to remove from the display, and can indicate one or more database objects that are required for a valid path, one or more database objects that are prohibited from valid paths, or combinations thereof. A user can select a path, and a query language statement to implement the path can be generated and displayed to the user.

Abstract: According to an embodiment of the present disclosures, systems, methods, and non-transitory computer-readable mediums having program instructions thereon, provide for a framework for automatically transferring metadata from different sources and different components of a computing platform. Further, the framework also provides for the seamless inclusion of additional metadata sources from the computing platform. The framework also provides for visualizing (e.g., modeling) the extracted metadata with a graphical user interface software application.