Unisys Corporation

Jennifer J Smith

James M Plasek

Ralph E Sipple

Thomas P Cooper

Lee-Chin Hsu Liu

John R Jordan

Ronald Q Smith

Michael S Jende

Michael J Bierma

James R Mettling

Rajeev P Tandon

James A Elke

Ronald H Menzhuber

Lester Y Lee

Joseph M Sandin

Katsuhiko Kihara

Sheng-te Chiang

Systems and methods for evaluating analytic queries comprising disjunctive Boolean expressions are described. A method may include receiving an analytic query comprising a first disjunctive Boolean expression. The method may further include transforming the analytic query to obtain a transformed analytic query comprising at least one nondisjunctive Boolean expression and at least a second disjunctive Boolean expression. The method may also include evaluating the transformed analytic query, wherein complete evaluation of the at least one nondisjunctive Boolean expressions and the at least a second disjunctive Boolean expressions yields the same results as evaluation of the first disjunctive Boolean expression.

Handling of analytic queries

Altering tables in a database system may be difficult because the tables may only be altered when all connection to the tables have been released. A free resources parameter may be set on in a management system for the database system to specify that resources should be attempted to be released. Connections to the database may be closed earlier than conventionally closed. For example, connections that are idle may be released. Once the connections have been released the database may be altered and the free resources parameter turned off. The free resources parameter notifies the database system of a pending alteration and allows the database to gracefully close connections to provide an opportunity for the alteration to occur.

Free resources parameter for improving performance of database alterations

A method and apparatus for improving search performance in databases organized in B Tree or B+ Tree format has an automatic determination and switching between two methods. It also searches to the end of a current leaf page even if a current value for all key parameters has been fulfilled in the search prior to reaching the end of the current leaf page. Swinging across and thus skipping leaf pages to fetch a next leaf page (trapeze fetching or swinging) is activated only either initially or where a B Tree search has resulted in a skipping of leaf pages previously in a search. User interference with the automatic selection of search type between next sequential leaf or trapeze type is not provided for and not allowed.

Database searching using trapeze fetch

A method and system for processing statements of a first language embedded in a program having statements of a second language are described in various embodiments. Statements of the first and second languages are compiled into an executable program, the executable program including original executable instructions associated with the statements of the first language. The executable program is executed, and during execution, recompilation conditions are detected for statements of the first language. In response to the recompilation conditions, selected statements of the first language are recompiled, during execution of the executable program, into new executable instructions. The new executable instructions are respectively associated with the selected statements and are executed in place of the original executable instructions.

Method and system for dynamic recompilation of statements of a first language embedded in a program having statements of a second language

A system for concurrent processing of queries and transactions against a shared database. The system includes multiple processors wherein a processor is available for processing queries and another processor is available for concurrently processing transactions. A query buffer is established for performing the query search while the data accessed by transactions is available in a database cache. Control logic in a database management system distinguishes between transactions and queries and initiates file-read control for reading the file containing the database. File-read control contains logic for logical sequential reading and logical non-sequential reading of the file. Control structures provide a means for control over the load that the query is allowed to place on the system.

System for optimally processing a transaction and a query to the same

Growing community of inventors

Eden Prairie, MN, United States of America

Jennifer J Smith