Abstract: A computer-implemented method, system and computer program product for recommending join operations of relational data among different tables. Relationships between one or more pairs of columns of relational data for one or more pairs of tables are identified by determining the semantic similarity between each pair of columns of relational data. The data content join converge for each of the identified relationships in connection with joining the tables involved in such identified relationships is determined. Furthermore, a join strength (indication of the degree that the relational data in the paired columns match) is calculated for each of the identified relationships based on the semantic similarity and the data content join coverage for such identified relationships. Based on the calculated join strength as well as other factors, a combination optimization algorithm identifies the best join combinations of relational data of the tables among a set of tables.

Abstract: A computer-implemented method, system and computer program product for recommending join operations of relational data among different tables. Relationships between one or more pairs of columns of relational data for one or more pairs of tables are identified by determining the semantic similarity between each pair of columns of relational data. The data content join converge for each of the identified relationships in connection with joining the tables involved in such identified relationships is determined. Furthermore, a join strength (indication of the degree that the relational data in the paired columns match) is calculated for each of the identified relationships based on the semantic similarity and the data content join coverage for such identified relationships. Based on the calculated join strength as well as other factors, a combination optimization algorithm identifies the best join combinations of relational data of the tables among a set of tables.

Abstract: An approach is disclosed that determines an amount of time before a webpage is ready to use by a user by performing various actions. The approach captures a recording of the webpage from an invocation of the webpage for a period of time sufficient to load completely load the webpage with the capturing resulting in sequenced image frames. An AI system provides a loading point in the sequenced image frames based on an analysis of the frames input to the trained AI system. Image diversity and saturation measurements are calculated on consecutive image frames from the sequenced image frames resulting in an image change analysis. Native webpage events and times are detected from webpage characteristics gathered from the captured digital recording. The amount of time is then calculated based on the loading point from the AI system, the image change analysis; and the webpage events and their corresponding times.

Abstract: An approach is disclosed that determines an amount of time before a webpage is ready to use by a user by performing various actions. The approach captures a recording of the webpage from an invocation of the webpage for a period of time sufficient to load completely load the webpage with the capturing resulting in sequenced image frames. An AI system provides a loading point in the sequenced image frames based on an analysis of the frames input to the trained AI system. Image diversity and saturation measurements are calculated on consecutive image frames from the sequenced image frames resulting in an image change analysis. Native webpage events and times are detected from webpage characteristics gathered from the captured digital recording. The amount of time is then calculated based on the loading point from the AI system, the image change analysis; and the webpage events and their corresponding times.

Abstract: A method for curating documents, executed by a computer, includes detecting one or more themes in a document, identifying one or more user interests for a user, presenting a ranked list of the one or more themes to the user, and dynamically updating the ranked list based on user feedback. The ranked list may be ranked according to the one or more user interests. A computer program product and computer system corresponding to the above method are also disclosed herein.

Abstract: A method for curating documents, executed by a computer, includes detecting one or more themes in a document, identifying one or more user interests for a user, presenting a ranked list of the one or more themes to the user, and dynamically updating the ranked list based on user feedback. The ranked list may be ranked according to the one or more user interests. A computer program product and computer system corresponding to the above method are also disclosed herein.

Abstract: A method for curating documents, executed by a computer, includes detecting one or more themes in a document, identifying one or more user interests for a user, presenting a ranked list of the one or more themes to the user, and dynamically updating the ranked list based on user feedback. The ranked list may be ranked according to the one or more user interests. A computer program product and computer system corresponding to the above method are also disclosed herein.

Abstract: A method for curating documents, executed by a computer, includes detecting one or more themes in a document, identifying one or more user interests for a user, presenting a ranked list of the one or more themes to the user, and dynamically updating the ranked list based on user feedback. The ranked list may be ranked according to the one or more user interests. A computer program product and computer system corresponding to the above method are also disclosed herein.