Unisys Corporation

Other

James M Plasek

Kelsey L Bruso

Jennifer J Smith

John C Rust

Michael S Jende

Ralph E Sipple

Lee-Chin Hsu Liu

Thomas P Cooper

John R Jordan

Ronald Q Smith

William J Reichow

Rajeev P Tandon

Kenji Yoneda

Roger V Ritchie

Ronald H Menzhuber

James A Elke

Lester Y Lee

James R Mettling

Michael J Bierma

Max Hirsch

Lowell L Baerenwald

Rachel M Noack

Katsuhiko Kihara

Sheng-te Chiang

Mark Rosno

Hayden Donze

Joseph M Sandin

Shardul Patil

Don W Frauendienst

A processor-based method of updating a secondary index for a B-tree in a database in a DBMS to include subsequent changes that occurred during creation of the secondary index includes opening an audit trail and moving back in the audit trail to a captured system time; making the secondary index visible to the DBMS for INSERT, UPDATE and DELETE processing; reading a next committed set of database updates from the audit trail; creating a secondary index modification for each row on each audit trail update and applying it to the secondary index; clearing the captured system time from control information for the B-tree to indicate completion; and making the secondary index visible to the DBMS for all processing.

Updating a secondary index from an audit trail

A processor-based method of building and appending data structures in a multi-host environment includes creating and storing data into a first data structure having a first root node, a first right leaf node and a plurality of other leaf nodes and non-leaf nodes defining multiple hierarchical levels; allowing a search of the first data structure to proceed while creating a second data structure that includes a second root node, a second left leaf node and a plurality of leaf nodes and non-leaf nodes defining multiple hierarchical levels; receiving a command to append the second data structure to the first data structure during searching the first data structure; creating a global lock for all hosts in the multi-host environment to the first root node and the first right leaf node of the first data structure while allowing access to the plurality of other leaf nodes and non-leaf nodes of the first data structure; updating the first root node and the first right leaf node with information about the second data structure; committing the update of the first root node and the first right leaf node; releasing the global lock to the first root node and the first right leaf node; and sending updated copies of the first root node and the first right leaf node to other hosts in a multi-host environment.

Method of building and appending data structures in a multi-host environment

A processor-based method of making a file containing a secondary index recoverable during processing of the secondary index includes: capturing a current system time as a captured system time and writing the captured system time to control information; finding writes to the file containing the secondary index; also writing the writes to an audit trail; using the captured system time in control information for the secondary index as a start time for recovery; determining if there is a primary key value in the control information; using a primary key value in the control information to traverse to a data page continuing the primary key value; placing a read-lock on the data page; creating a corresponding secondary index entry; and releasing the read-lock.

Method of making a file containing a secondary index recoverable during processing

Methods and systems for implementing an object identification system equipped to reduce the number of service calls for remote object identification lookups are disclosed. The object identification management server works to reduce the number of object identification requests, which overall improves the process of quickly and accurately providing object identifications when needed and without unnecessarily wasting computing resources. The object identification server can subsequently manage the number of identification requests by setting a tunable threshold, which allows a system to operate more efficiently and allocate computing resources accordingly.

Object identification system with reduced service calls

An artificially intelligent method includes the steps of monitoring, by a processor, information sources to identify primary semantic information; capturing, by the processor, the primary semantic information; reformatting, by the processor, the primary semantic information according to a predetermined format; analyzing, by the processor, the primary semantic information to establish secondary semantic information; and establishing, by the processor, ontologies from the primary, secondary, and additional secondary semantic information.

Systems and methods for deriving database semantic information using artificial intelligence

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

Disclosure of approaches for processing database transactions against a database. In one approach, a first transaction is received that specifies an operation for changing state of a first record stored in a first database page. In processing the operation, the state of the record is changed, and information is stored in a companion page. The information includes a transaction identifier, data describing the specified operation, a page identifier of the first page, a before look and an after look of the first record for an update operation, and an after look of the first record for an insert operation. In response to a commit of the first transaction, a process determines whether a second transaction, that specifies a change in state for a second stored in the first page, is in-process. In response to determining that the second transaction is in process, the companion page is stored in an audit trail. In response to determining that no such second transaction is in process, a transaction identifier of the first transaction and associated data of the first page are stored in the audit trail.

Record-level locking and page-level recovery in a database management system

Various approaches for processing a B+ tree data structure are described. In one approach, in a first transaction a first insert operation to a first data page of a first index page in the B+ tree data structure is detected, and then it is determined whether performing the first insert operation would block a second insert operation in a second transaction concurrent with the first transaction. At least one empty second data page is created in response to determining that the second insert operation would be blocked by the first insert operation. The B+ tree data structure is updated to include the at least one second data page in the B+ tree data structure, and the updated index pages and second data page are committed to retentive storage. Thereafter, the first insert can be completed.

Dynamic preconditioning of a B+ tree

Various approaches for processing a B+tree data structure of a database are disclosed. In one approach a method determines a pattern of multi-column key values. In response to an insert transaction into the database that requires a new index page and before performing the insert transaction, the method generates a plurality of new multi-column key values based on the pattern and stores one or more of the plurality of multi-column key values in one or more new index pages. Before performing the insert, the method further commits to retentive storage of the one or more new index pages and new data pages as linked to the B+tree. After committing the one or more new index pages and new data pages, the method then proceeds to processes and commits the insert transaction.

Dynamic preconditioning of A B+tree

A system and method for managing a database is provided. The system and method includes logic that supports an atomic synchronization operation initiated by execution of a single synchronization statement. This operation utilizes a single call to a database management system to transform a database table from a first unknown state to a known state that contains a specified target record containing one or more specified data values. The first unknown state may be a state that already contains the target record, or may instead be a state that does not contain the record. In the former instance, a record containing one or more of the data values is created, and in the latter instance, the existing record is updated. A one-step locking mechanism is performed in conjunction with the operation to prevent the occurrence of deadlock and to minimize the number of required lock requests.

System and method for transforming a database state

A system and method is provided for inserting an ascending or descending sequence of data records into a database table represented by a tree structure. A search is performed to locate a node of the tree that includes the insertion point for a record in the sequence. If the node must be divided to store the record, it is determined whether division of the node at the insertion point will prevent a subsequently received record in the sequence from being stored on the same node with other records in the sequence irrespective of the storage space available on that node. If so, the node division is performed so that a record that is not in the sequence but that is adjacent to the insertion point is maintained on the same node as the other records in the sequence.

Database management system and method for maintaining a database in a range sensitive manner

Various approaches for processing a B+ tree data structure are described. In one approach, a first data record is deleted from the database as part of processing a first transaction. After removing the first data record, it is determined whether a first data page from which the record was removed should be merged. If the first data page is to be merged, merging of the data page is delayed until after the first transaction has been committed. After committing the first transaction, a nested transaction is initiated to merge of the first data page, and the nested transaction is committed after the data page has been merged.

Delaying automated data page merging in a B+tree until after committing the transaction

Bypassing loading of memory in accessing large data objects in a relational database. A relational database may include a plurality of first type data items and associated second type data items. In response to an update-type access request, requester memory is bypassed in writing to the relational database a second type data item referenced by a file location specified in the update-type request. In response to retrieve-type request, requester memory is bypassed in reading from the relational database a second type data item referenced in the retrieve-type request and writing the second type data item at a file location specified in the retrieve-type request.

Growing community of inventors

Shoreview, MN, United States of America

James M Plasek