Abstract: A method, apparatus, system, and signal-bearing medium that in an embodiment collect a performance metric of a first partition in a logically-partitioned computer. If the difference between the performance metric and an expected performance metric exceeds a threshold, then a job or another partition is shut down or suspended. The expected performance metric is calculated based on the performance that is expected if the first partition is the only partition.

Abstract: Optimized query execution is disclosed for queries that return data sorted by a derived column. The query optimizer is used to determine if the data is already sorted or if existing database metadata can be utilized to provide the sort. The optimizer will examine the query field being derived and attempt to determine if there are existing index structures that can be used to sort the data. The optimizer can also look at the values of the data in the column to determine what existing structures can be used to sort the data.

Abstract: Optimized query execution is disclosed for queries that return data sorted by a derived column. The query optimizer is used to determine if the data is already sorted or if existing database metadata can be utilized to provide the sort. The optimizer will examine the query field being derived and attempt to determine if there are existing index structures that can be used to sort the data. The optimizer can also look at the values of the data in the column to determine what existing structures can be used to sort the data.

Abstract: Optimized query execution for queries that return data sorted by a derived column. The query optimizer is used to determine if the data is already sorted or if existing database metadata can be utilized to provide the sort. The optimizer will examine the query field being derived and attempt to determine if there are existing index structures that can be used to sort the data. The optimizer can also look at the values of the data in the column to determine what existing structures can be used to sort the data.

Abstract: A database optimizer collects statistics regarding applications accessing a database, and makes one or more changes to the database schema to optimize performance according to the collected statistics. In a first embodiment, the optimizer detects when a certain type of application accesses the database a percentage of time that exceeds a predefined threshold level, and if the data in the database is stored in a less-than-optimal format for the application, the data type of one or more columns in the database is changed to a more optimal format for the application. In a second embodiment, the optimizer detects when one type of application accesses a column a percentage of time that exceeds a first predefined threshold level and is less than a second predefined threshold level, and creates a new column in the database so the data is present in both formats.

Abstract: A run-time monitor allows defining sets of run-time error criteria and corresponding diagnostic action to take when the run-time error criteria is satisfied. One way to define the run-time error criteria is to take a baseline measurement of run-time errors that occur during normal processing conditions. A run-time error criteria may then be defined that is based on the baseline measurement. In this manner, a rate of run-time errors that normally occur may be ignored, while a rate of run-time errors in excess of the run-time error criteria could automatically initiate diagnostic action. In this manner, the ability of a programmer to debug run-time errors is significantly enhanced.

Abstract: An apparatus, program product and method sample at different times nodes that are performing similar work. Performance data associated with first and second node subsets performing the similar work are sampled at different times, e.g., in a round-robin fashion, and in accordance with a given sampling rate. The performance data is analyzed. Nodes whose performance suffers as a result of a sampling operation may be identified and removed from a subsequent operation.

Abstract: An apparatus and method for a query governor to govern query execution in a parallel computer system with one or more networks. The query governor uses a network monitor to gather network status information to determine how to govern query execution. The query governor may also use historical information of previous query execution stored in a query file to determine if the query should be allowed to execute. The query governor may also use node and network restrictions to determine what networks the query can use.

Abstract: A run-time monitor allows defining sets of run-time error criteria and corresponding diagnostic action to take when the run-time error criteria is satisfied. One way to define the run-time error criteria is to take a baseline measurement of run-time errors that occur during normal processing conditions. A run-time error criteria may then be defined that is based on the baseline measurement. In this manner, a rate of run-time errors that normally occur may be ignored, while a rate of run-time errors in excess of the run-time error criteria could automatically initiate diagnostic action. In this manner, the ability of a programmer to debug run-time errors is significantly enhanced.

Abstract: An apparatus and method utilize MQTs in a more efficient manner in a high availability computer database to improve database performance and utility. In preferred embodiments, an MQT control file indicates whether journal entries for specific tables are to be propagated to replicated databases residing on other computer servers. In other embodiments, the MQT control file includes metrics that are used to control when the propagation is turned on and off.

Abstract: An apparatus and program product monitor performance of a computer system via a result size including a result set size of accesses to a database and a page size. Preferred embodiments are directed to a performance monitor that correlates data from existing tools that report data concerning access to the database and the use of system resources. Other embodiments are directed to a performance monitor that is included in an application server associated with the database.

Abstract: A method for monitoring the performance of a computer system via a result size including a result set size of accesses to a database and a page size. Preferred embodiments are directed to a performance monitor that correlates data from existing tools that report data concerning access to the database and the use of system resources. Other embodiments are directed to a performance monitor that is included in an application server associated with the database.

Abstract: An apparatus and program product monitors performance of a computer system via a result size including a result set size of accesses to a database and a page size. Preferred embodiments are directed to a performance monitor that correlates data from existing tools that report data concerning access to the database and the use of system resources. Other embodiments are directed to a performance monitor that is included in an application server associated with the database.

Abstract: Database indexes include multiple fields that are used to track how the components of the index are used. An index component monitoring mechanism tracks how the components of the index are used, and updates fields in the index accordingly. Such component-level statistics allow a query optimizer to make more intelligent decisions regarding when to build a new index and when to discard an index, and also provide information regarding which queries are using the index, the maintenance cost of the index, and the selectivity of the index when used to process a query.

Abstract: A method and apparatus for pre-loading an in memory database in a parallel computing system. A node manager uses empirical evidence gained from monitoring prior query execution times and patterns to determine how to effectively load the in memory database. The structure of the database may also be analyzed to determine effective ways to pre-load the database. The node manager may also allow a system administrator to force placement of database structures in particular nodes.

Abstract: An apparatus and method use ontological relationships in a query language and a computer database to improve database performance and utility. A set of ontological relationships are stored in the database and new query clauses are used to query the data in advantageous ways. Ontological relationships are preferably stored in a tree structure. This tree structure then can be used to reflect the ontological relationships of data stored in the columns of a database.

Abstract: Database indexes include multiple fields that are used to track how the components of the index are used. An index component monitoring mechanism tracks how the components of the index are used, and updates fields in the index accordingly. Such component-level statistics allow a query optimizer to make more intelligent decisions regarding when to build a new index and when to discard an index, and also provide information regarding which queries are using the index, the maintenance cost of the index, and the selectivity of the index when used to process a query.

Abstract: A handheld electronic book reader, program product, and method incorporate enhanced annotation and/or usage tracking capabilities. Users may create “contexts” for defined terms in an electronic document. Moreover, annotation data such as contexts, comments and highlighting may be associated with various users, and displayed in connection with the display of an electronic document so as to indicate that different annotation data has been originated by different users. In addition, from the standpoint of usage tracking, usage statistics for an electronic document displayed in a handheld electronic reader may be generated on a page-by-page basis, and/or in association with term definitions. Moreover, usage statistics for multiple users may be combined and analyzed.

Abstract: In an embodiment, content is received on a channel between a scheduled start time and a scheduled stop time. A schedule specifies a planned transmission of a scheduled program between the scheduled start time and the scheduled stop time. The received content is recorded to a saved program. A determination is made that the saved program includes interruption content that is different from lost content of the scheduled program. A request for the lost content is sent to a content provider, the lost content is received from the content provider, and the interruption content is replaced in the saved program with the lost content. The request includes a begin time of the lost content relative to a beginning of the scheduled program and an amount of the lost content.

Abstract: An apparatus and method for a multi-partition query governor in a partitioned computer database system. In preferred embodiments a query governor uses data of a query governor file that is associated with multiple partitions to determines how the query governor manages access to the database across multiple partitions. Also, in preferred embodiments, the query governor in a local partition that receives a query request communicates with a query governor in a target partition to accumulate the total resource demands of the query on the local and target partitions. In preferred embodiments, a query governor estimates whether resources to execute a query will exceed a threshold over all or a combination of database partitions.