Abstract: Various aspects of this disclosure are directed to receiving, by a computing device, a first table join query that may include a first group of table identifiers that identify the two or more tables. The computing device may determine whether the first table join query includes an outer join command. When the first table join query includes the outer join command, the computing device may compare the first group of table identifiers and a second group of table identifiers of one or more pre-joined tables to determine whether each of the first table identifiers matches at least one of the second group of table identifiers. The computing device may further determine whether a predicate associated with each table identifier matches a predicate associated with a matching second table identifier. When each of the predicates match, the computing device may rewrite the first table join query.

Abstract: Various aspects of this disclosure are directed to receiving, by a computing device, a first table join query that may include a first group of table identifiers that identify the two or more tables. The computing device may determine whether the first table join query includes an outer join command. When the first table join query includes the outer join command, the computing device may compare the first group of table identifiers and a second group of table identifiers of one or more pre-joined tables to determine whether each of the first table identifiers matches at least one of the second group of table identifiers. The computing device may further determine whether a predicate associated with each table identifier matches a predicate associated with a matching second table identifier. When each of the predicates match, the computing device may rewrite the first table join query.

Abstract: A multi-mainframe operating system serialization method can include receiving, in a first computing system, a request to access a data set on behalf of a first peer application, sending, in the first computing system, a notification to a second peer application to obtain a normal enqueue, in response to the second peer application obtaining the normal enqueue, obtaining, in the first computing system, a first rider enqueue for the data set and sending, in the first computing system, a communication to peer instances to obtain additional rider enqueues for the data set, the additional rider enqueues corresponding to the first rider enqueue.

Abstract: A heterogeneous computing system includes a first server module having a first operating system, a second server module communicatively coupled to the first server module, the second server module having a second operating system dissimilar to the first operating system, a data set accessible by the first server module and the second server module; and a process residing on the first server module, the process configured to grant access to the second server module, from the first server module, to the data set.

Abstract: A method and apparatus for transparent analytical query acceleration identifies within a database management system (DBMS) if a query is an analytical type. The query is processed with an analytical query processor if the query is the analytical type. In addition, the query is processed within the DBMS if the query is not the analytical type.

Abstract: A Waist-supported Writing Surface in the short term clipped or clamped by hand to clothes or material about a person's waist line, preferred location or equivalent bodily structure. Hand operated and body having hingedly collapsible surface(s) for holding working papers and the like is connected hingedly to a support member, primarily to be used when collapsible planar horizontal surface(s) are open and support member is used, to read and write while walking, sitting, standing and talking on phone. Supporting and or storing utensils, accessories and numerous forms of writing and reading media one's self, including, but not limited to paper, a notebook, a book, or a combination thereof.

Abstract: A method, apparatus and program storage device for managing buffers during online reorganization. An adaptive buffer is provided having a dynamically adjustable boundary, the adaptive buffer processes log records and pointers associated with the log records during online reorganization of a database. Adaptive switching is provided between a first and a second task during the processing of data log records and index log records during the online reorganization of the database.

Abstract: A method, apparatus and program storage device for determining an optimal number of tasks during reorganization of a database system with memory and processor constraints. The reorganization system identifies memory constraints, identifies processing capabilities and determines a number of reorganization processes and a combination of reorganization processes that provides a minimum reorganization time based upon the identified memory and processing constraints. The identified memory and processing capabilities identify a domain representing a set of rules applicable to the identified memory and processing capabilities. The set of rules of the identified domain are applied to determine an optimal number and combination of reorganization processes that minimizes a reorganization time.

Abstract: One or more indexes are built on data (concurrent with manipulation of data) wherein the index build operation is done without restricting the manipulation of data. The index is brought to consistency with the data based upon processing recovery log records to simulate index manipulations during data insert, update, or delete operations.

Abstract: A method, apparatus and program storage device readable by a computer tangibly embodying a program of instructions executable by the computer is provided for reorganization of database data. The computer database reorganization method reorganizes one set of database data blocks at a time, allowing concurrent data manipulation. Method identifies a set of data blocks for reorganization in a sliding peephole mode, re-orders the set of data blocks and replaces the original set of data blocks with the re-ordered set of data blocks, if possible. Preferred embodiments include an overlapping peephole method, which chooses, for each set of data block to be reorganized, a next succeeding set of data blocks plus an overlap segment, wherein the overlap segment includes a set of empty pages other than intentionally specified free pages, and the overlap segment is a subset of the preceding set of data blocks.

Abstract: The present invention is related to a method and system for preserving an original table schema for a table in a database system that supports dynamic table schema changes. The method and system includes storing the original table schema for the table in a designated table prior to performing a schema change on the table. By storing the original table schema in the designated table, a backup copy of the table that includes rows which are not self-describing can be used for data recovery.

Abstract: A method, apparatus and program storage device for managing buffers during online reorganization. An adaptive buffer is provided having a dynamically adjustable boundary, the adaptive buffer processes log records and pointers associated with the log records during online reorganization of a database. Adaptive switching is provided between a first and a second task during the processing of data log records and index log records during the online reorganization of the database.

Abstract: A method, apparatus and program storage device for determining an optimal number of tasks during reorganization of a database system with memory and processor constraints. The reorganization system identifies memory constraints, identifies processing capabilities and determines a number of reorganization processes and a combination of reorganization processes that provides a minimum reorganization time based upon the identified memory and processing constraints. The identified memory and processing capabilities identify a domain representing a set of rules applicable to the identified memory and processing capabilities. The set of rules of the identified domain are applied to determine an optimal number and combination of reorganization processes that minimizes a reorganization time.

Abstract: The present invention is related to a method and system for preserving an original table schema for a table in a database system that supports dynamic table schema changes. The method and system includes storing the original table schema for the table in a designated table prior to performing a schema change on the table. By storing the original table schema in the designated table, a backup copy of the table that includes rows which are not self-describing can be used for data recovery.

Abstract: A database management system maintains a system catalog for storing information regarding the data definitions of the managed data objects, where all information necessary for the recreation of the data definitions must be available or inferable from the stored information. The inventive database management system also maintains log records or a journal of changes which occur within the database system, especially to the system catalog information. When a drop of a managed data object occurs, the deletion of the system catalog data definition information is recorded in the log. To recreate the data definitions of the dropped objects, first the information about the dropped objects, deleted from the system catalog, is located in the log records. Second, the log records are read and extracted. Third, the definition information is extracted or inferred from the log records.

Abstract: One or more indexes are built on data (concurrent with manipulation of data) wherein the index build operation is done without restricting the manipulation of data. The index is brought to consistency with the data based upon processing recovery log records to simulate index manipulations during data insert, update, or delete operations.