Abstract: A computer identifies a location that is associated with a task, included in a first list of tasks, based on a first information. The computer determines a first travel time from a second location that is associated with a mobile device to the first location based on a second information. The second information indicates an amount of travel time that is associated with a route from the second location to the first location. The computer generates a plurality of permutations of the tasks included in the first list of tasks. The computer selects a permutation from the plurality of permutations based on the first travel time. The computer generates a second list of tasks using the selected permutation. The organization of the tasks included in the second list of tasks reduces the travel time that is required to complete those tasks.

Abstract: A computer identifies a location that is associated with a task, included in a first list of tasks, based on a first information. The computer determines a first travel time from a second location that is associated with a mobile device to the first location based on a second information. The second information indicates an amount of travel time that is associated with a route from the second location to the first location. The computer generates a plurality of permutations of the tasks included in the first list of tasks. The computer selects a permutation from the plurality of permutations based on the first travel time. The computer generates a second list of tasks using the selected permutation. The organization of the tasks included in the second list of tasks reduces the travel time that is required to complete those tasks.

Abstract: A computer identifies a location that is associated with a task, included in a first list of tasks, based on a first information. The computer determines a first travel time from a second location that is associated with a mobile device to the first location based on a second information. The second information indicates an amount of travel time that is associated with a route from the second location to the first location. The computer generates a plurality of permutations of the tasks included in the first list of tasks. The computer selects a permutation from the plurality of permutations based on the first travel time. The computer generates a second list of tasks using the selected permutation. The organization of the tasks included in the second list of tasks reduces the travel time that is required to complete those tasks.

Abstract: Methods and apparatus, including computer program products, implementing and using techniques for optimizing query performance in a relational database management system. A query is received at the relational database management system. It is determined whether the query is expected to be a long-running query. In response to determining that the query is expected to be a long-running query, a full table scan is started in order to fetch records needed to satisfy the query from the relational database management system. In parallel with conducting the full table scan, a performance object is built, which is capable of satisfying the query in the relational database management system. In response to completing the construction of the performance object prior to completing the full table scan, the full table scan is stopped and the newly built performance object is used instead to satisfy the query.

Abstract: Methods for optimizing query performance in a relational database management system. A query is received at the relational database management system. It is determined whether the query is expected to be a long-running query. In response to determining that the query is expected to be a long-running query, a full table scan is started in order to fetch records needed to satisfy the query from the relational database management system. In parallel with conducting the full table scan, a performance object is built, which is capable of satisfying the query in the relational database management system. In response to completing the construction of the performance object prior to completing the full table scan, the full table scan is stopped and the newly built performance object is used instead to satisfy the query.

Abstract: A method, system and computer program product for identifying anomalous behavior (e.g., suspicious transactions). Information from at least one social media source (e.g., a posting) and from at least one non-social media source (e.g., a booking) are monitored. A transaction (e.g., credit card transaction) involving a user is identified. The monitored information is then analyzed to identify one or more characteristics (e.g., location of the user) of the user. A rating of invalidity of the transaction is generated based on the one or more characteristics, where the rating of invalidity refers to the likelihood that the transaction is likely to be anomaly, such as a suspicious transaction. If the rating exceeds a threshold, then an anomaly may be said to have occurred. By identifying anomalous behavior using both social media and non-social media sources, anomalous activities that truly occurred will be more accurately detected.

Abstract: Methods for optimizing query performance in a relational database management system. A query is received at the relational database management system. It is determined whether the query is expected to be a long-running query. In response to determining that the query is expected to be a long-running query, a full table scan is started in order to fetch records needed to satisfy the query from the relational database management system. In parallel with conducting the full table scan, a performance object is built, which is capable of satisfying the query in the relational database management system. In response to completing the construction of the performance object prior to completing the full table scan, the full table scan is stopped and the newly built performance object is used instead to satisfy the query.

Abstract: Methods and apparatus, including computer program products, implementing and using techniques for optimizing query performance in a relational database management system. A query is received at the relational database management system. It is determined whether the query is expected to be a long-running query. In response to determining that the query is expected to be a long-running query, a full table scan is started in order to fetch records needed to satisfy the query from the relational database management system. In parallel with conducting the full table scan, a performance object is built, which is capable of satisfying the query in the relational database management system. In response to completing the construction of the performance object prior to completing the full table scan, the full table scan is stopped and the newly built performance object is used instead to satisfy the query.

Abstract: A business process catalog is built using pattern analysis of historical data of a database and deploying the built business process catalog to perform database recovery, A first set of statements are logged for transactions of a first business process batch and compared with a second set of statements. The second set of statements is included in a second business batch process stored in the business process catalog. The business process catalog is updated based on the comparison of the first and second sets of statements. The built business process catalog is deployed to identify and present business process batches to a database system user to select a business process batch used to perform the database system recovery.

Abstract: A method, a system and a computer program of database system recovery are disclosed. The method includes building a business process catalog using a pattern analysis of historical data of the database system and also includes deploying the built business process catalog to perform the database system recovery. The method further includes logging a first set of statements corresponding to a plurality of transactions of a first business process batch and comparing the first set of statements with a second set of statements wherein the second set of statements is included in a second business batch process being stored in the business process catalog. The business process catalog is updated based on the comparison of the first set of statements and the second set of statements. The method further includes deploying the built business process catalog to identify and present business process batches to the database system user to select a business process batch.

Abstract: A method and system for improving the functionality of real-time messaging (chat) applications and services. The method and system may use temporary storage directories to enhance user experience and provide new functionalities, such as instant previewing and forwarding of electronic files received via the chat application.