Abstract: A method, an article of manufacture and apparatus for providing user-specific error analysis for a document. Specifically, the invention provides for identifying user-specific proclivities for confusing particular words which, while grammatically correct, are not used as intended by the user. The proclivities are tracked by recording changes made by the user while editing a document. The information collected while tracking the changes is then used to identify problem words to the user at a later period in time.

Abstract: A method, meeting scheduler and computer program product are provided for automated meeting scheduling using delegates, representatives, quorums, and teams. Meeting settings and invitees data are stored for a meeting. The meeting settings and invitees data includes invitee attendance type, delegates, representatives, quorums, and teams data. A solution time block for automated meeting scheduling including at least a subset of a plurality of selected invitees is identified utilizing the invitee attendance type, delegates, representatives, quorums, and teams data. A selection score is calculated for each potential time block for automated meeting scheduling utilizing the stored meeting settings and invitees data including the invitee attendance type, delegates, representatives, quorums, and teams data. The solution time block for automated meeting scheduling including a subset of a plurality of selected invitees is identified utilizing the calculated selection score.

Abstract: A database engine and a system running a database engine utilize a dynamic join reordering feature to change the order of two or more join operations while a query is executing. The database engine starts execution of the query with an initial join order setting but monitors the execution of the query to determine whether the initial join order or some other join order would provide better runtime performance. If another join order would provide better performance, then the database engine can change the join order during query execution and complete the query using the new join order.

Abstract: A web server computer system includes a virus checker and mechanisms for checking e-mails and their attachments, downloaded files, and web sites for possible viruses. The virus checker allows a web server to perform virus checking of different types of information real-time as the information is requested by a web client. In addition, a web client may also request that the server perform virus checking on a particular drive on the web client. If this case, the web server may receive information from the web client drive, scan the information for viruses, and inform the web client whether any viruses were found. In the alternative, the web server may download a client virus checker to the web client and cause the client virus checker to be run on the web client. The preferred embodiments thus eliminate the need for virus checking software to be installed on each web client.

Abstract: A database engine and a system running a database engine utilize a dynamic bitmap updating routine to avoid the delay associated with building an entire bitmap. When running a query on a table, the database engine can build a bitmap over a column of the table that helps avoid unnecessary I/O operations to retrieve records. The database engine initializes the bitmap so that all elements have a value of “1”, or active, and proceeds to scan and retrieve the records of the table according to the bitmap using a first process. Any retrieved record is further analyzed to determine if it is part of the result set. Concurrently, a second process is initiated which continually updates the values within the bitmap according to a set of selection criteria. As the first process continues to operate, more and more elements of the bitmap are set to “0”, or inactive, so that the first process can avoid unnecessary I/O operations.

Abstract: A method, apparatus, and program product utilize intelligent job functionality to diagnose an error in a computer. After detecting an error in a first job processing a task, and in response to another attempt to perform the task, a job selection algorithm selects a predetermined job in which to perform the task and diagnose the error. The predetermined job can be the first job or a new job associated with a signature that corresponds to the task that experienced the error. The predetermined job can be used to diagnose the error in a debugging session. Alternately, the first job may enter a debug session immediately after experiencing an error.

Abstract: A database query optimizer creates a main access plan for a query, and also creates one or more subplans for the same query. The subplans are used in executing a query. When a subplan is generated, all tautological predicates (i.e., predicates that do not narrow the query) are dropped, thereby enhancing the reusability of stored subplans. When a query is processed, its tautological predicates are dropped, and if a subplan for the query with the dropped tautological predicates is found, the subplan is used to execute the query. If the query to be run has no main access plan in the cache, a main access plan is generated, and a subplan is also generated that corresponds to the query to be run, with all tautological predicates dropped. The same query may thus generate many subplans, enhancing the reusability of the query by storing each subplan in the access plan cache.

Abstract: A database query optimizer for a computer system having dynamically configurable logical partitions generates an optimized query strategy which is dependent on a logical partition configuration. When the query is executed, the configuration of the logical partition in which the query is executed is compared to the logical partition configuration for which the query was optimized. If the configurations are different, a new query can be automatically generated. Optimizing database queries to the current system configuration of a dynamic, logically partitioned system potentially offers greater efficiency in the execution of database queries for complex, logically partitioned systems.

Abstract: A method, article of manufacture and apparatus for assisting an electronic mail (e-mail) response message by providing e-mail messages related to an open e-mail message. Specifically, the method determines whether an available e-mail message is related to the open e-mail message. Available e-mail messages may include unopened, previously opened, or incoming e-mail messages. As such, the user is warned of all relevant e-mail messages before responding with a reply message or a forward message.

Abstract: A database query optimizer for a computer system having dynamically configurable logical partitions generates an optimized query strategy which is dependent on a logical partition configuration. When the query is executed, the configuration of the logical partition in which the query is executed is compared to the logical partition configuration for which the query was optimized. If the configurations are different, a new query can be automatically generated. Optimizing database queries to the current system configuration of a dynamic, logically partitioned system potentially offers greater efficiency in the execution of database queries for complex, logically partitioned systems.

Abstract: A database engine and optimizer framework support the use of transitive closure to assist in rewriting GROUP BY and ORDER BY clauses to reduce the number of referenced tables (optimally to a single table if possible) and to free the join order selected for the query plan. The SQL parser and optimizer, by performing transitive closure on the selection, or search, conditions is able to identify which fields referenced by the ORDER BY and GROUP BY clauses can be replaced with equivalent fields to improve the performance of the query. In one instance, the fields are replaced so that the ORDER BY or GROUP BY clause references only a single table. If more than one such possible ORDER BY or GROUP BY clause exists, then the optimizer selects from among the different possible clauses to select the one that provides the best performing join order.

Abstract: A method of providing rebroadcast programming includes encoding a rebroadcast program, specifying a preferred play time, and providing a broadcast that fits the preferred play time. The encoding of the rebroadcast program can use a replay plan which prioritizes portions of the rebroadcast. A priority can be assigned to commercials which have been made to be shortened or dropped, or an alternative commercial substituted, depending on time limitations. A rebroadcast packaging and playlist are provided.

Abstract: A query plan modification system and method relate to a database system that includes a cost-based optimizer for generating access plans. The database system also permits a user to view an access plan that has been generated by a particular SQL query and modify the access plan if desired. The user specifies customizations that are associated with the access plan so that when that plan is executed, the customizations are executed as well. Exemplary customizations include specifying an initialization file specific to a query, specifying different implementation methods than those in the original access plan, prohibiting rebuilding of an access plan, and over-riding or ignoring a clause within the query that is used to generate the access plan.

Abstract: An apparatus, program product and method utilize automated analysis techniques to assist in the determination of acceptable usages of linguistic terms (e.g., words, phrases, acronyms, etc.). In particular, an acceptable usage of a linguistic term in a document on the Internet may be determined by detecting a spell definition tag in the document. In response to detecting the spell definition tag, automatically adding the acceptable variant of the linguistic term to an electronic dictionary.

Abstract: The invention, in an embodiment, relates to optimizing database performance by taking advantage of sleepy drives. The invention analyzes queries to indexes based on usage frequency, and determines whether to access an index stored on a sleepy drive, or perform an alternate access plan based on green optimization. Furthermore, the invention transfers data, such as, for example, indexes, files, data areas, journals, and statistics, between active and sleepy drives based on usage frequency. In another embodiment, the invention provides an improved sleepy drive which optimizes energy savings by a graduated degree based on a speed setting. In yet another embodiment, the invention controls when read-write heads are unloaded from disks to reduce drag and power consumption by a disk drive.

Abstract: A query plan modification system and method relate to a database system that includes a cost-based optimizer for generating access plans. The database system also permits a user to view an access plan that has been generated by a particular SQL query and modify the access plan if desired. The user specifies customizations that are associated with the access plan so that when that plan is executed, the customizations are executed as well. Exemplary customizations include specifying an initialization file specific to a query, specifying different implementation methods than those in the original access plan, prohibiting rebuilding of an access plan, and over-riding or ignoring a clause within the query that is used to generate the access plan.

Abstract: A document and image management system that can manage handwritten comments and/or edits on conventional paper. The invention may be embodied as an enhanced photocopier adapted to locate and classify handwritten notations using optical character recognition techniques. This embodiment allows the user to select options to selectively copy only those pages with notations, to create an index of handwritten notations, to add side margin locator marks to the document, and to compare subsequent comments on different drafts.

Abstract: An apparatus, program product and method utilize automated analysis techniques to assist in the determination of acceptable usages of linguistic terms (e.g., words, phrases, acronyms, etc.). In particular, an acceptable usage of a linguistic term may be determined by scanning a plurality of documents for variants (e.g., based on differing spellings, punctuation, capitalization, meaning or definition, etc.) of the term, and tracking relative occurrences of a plurality of such variants found in the plurality of documents during scanning. By tracking occurrences of linguistic term variants, users may be able to use such statistical information to select which of the available variants represents an acceptable usage, or even a most acceptable usage, of a term. Scanned documents may be retrieved from the Internet, and scanning may occur while a user is browsing the Internet.

Abstract: A method, apparatus and program product use a first index associated with a field in a database table to identify a range of records in the database table that includes instances of a first key value in the field and use the identified range of records to subset a second index associated with another field in a database table. The database query identifies the first key value for the field in the database table and the second key value for the other field in the database table. By doing so, information from an index may be carried over and applied to another index to subset the other index, often reducing the quantity of entries that are searched in the other index and improving performance.

Abstract: A method, apparatus, and program product select a pre-started job from among a plurality of pre-started jobs in which to perform a task in a computer system with a NUMA configuration. An attempt to perform a task is received as a connection. Information associated with the connection is compared to information associated with a plurality of pre-started jobs. In response to comparing the information, it is determined either that a pre-started job was previously used to perform the task or that no pre-started job was previously used to perform the task. In response to either determination, another pre-started job is determined in which to perform the task. The other pre-started job is determined based on affinity with the task, and may be reallocated to perform the task.