Unisys Corporation

Other

Kelsey L Bruso

James M Plasek

Uday Datta Shet

Steven M Wierdsma

Michael A Salsburg

Philip J Erickson

Michael S Jende

John C Rust

Roger V Ritchie

Robert Dean Vavra

William J Reichow

Kevin Lui

Ralph W Conner

Carlos T Cardoso

Barry C Andersen

James Combs

Kevin Flanders

Dayln Limesand

Joshua M Chamberland

Rachel M Noack

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

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

A computing system architecture includes a service server and a first validator. The first validator is communicable to the service server. A validation request is sent from the service server to the first validator for validating a transaction. The validation request including a first facial image of a party of the transaction. The validator performs a facial recognition using the first facial image of the party for validating the transaction.

Blockchain mechanism for safety-critical systems

A security system includes a camera having a field of vision. The camera sends image frames to a machine readable memory. A processor is accessible to the machine readable memory. The processor performs acts of receiving from the camera a plurality of frames; detecting an object entering the field of vision; determining whether the object is a person; tracking a moving path of the person; and performing facial recognition on the person using at least one of the plurality of frames.

Systems and methods for facial recognition in a campus setting

A traffic monitoring system includes a first car moving on a first path; a camera having a field of vision including at least a portion of the first path; and a computing system. The computing system receives a plurality of images from the camera. The computing system has a processor. When instructed, the processor performs circling a perimeter of the first car on each of the images with a first rectangle; composing a first set of points, each point of the first set of points representing a center of the first rectangle; finding a first centroid using the first set of points, wherein the first centroid represents the first path; and calculating a speed of the first car using the first centroid.

System and method using complex centroids for detecting object-of-interest speeds from two dimensional pictures

Methods and systems for securing communications with an enterprise from a remote computing system are disclosed. The enterprise is included within a community of interest. One method includes authenticating a bridge appliance with an authentication server associated with an enterprise having secure communications, and receiving a packet at the bridge appliance. The method also includes decrypting the packet to provide a decrypted packet in a case where the packet is encrypted according to a cryptographic key associated with the enterprise, and forwarding the decrypted packet to a remote computing device in communication with the bridge appliance. The method additionally includes, in a case where the packet is received from the remote computing device, encrypting the packet according to a cryptographic key associated with the enterprise, to provide an encrypted packet, and forwarding the encrypted packet to an endpoint within the enterprise.

Secured network bridge

Systems and methods for accessing data secured and encrypted using a file system manager are disclosed. One method includes determining whether a community of interest (COI) key obtained from a security appliance matches a COI key associated with a file structure managed by the file system manager that is the subject of a file system request issued by a caller. The method further includes identifying an entry included in a key bank associated with the COI key and the file structure that is the subject of the file system request, the key bank storing encrypted versions of a metadata key. The method also includes decrypting the metadata key using the COI key, decrypting at least one block encryption key using the metadata key, and decrypting a block of data associated with the at least one block encryption key.

Secured file system management

Systems and methods for establishing a secure file system are disclosed, in which system endpoints such as files and directories in a file system are protected using a security appliance. The security appliance protects each endpoint in the file system from unauthorized access by making those endpoints invisible to unauthorized users. The security appliance organizes users and endpoints into various communities of interest (COI). A user COI groups users such that all users associated with that particular COI have authorization to view the same one or more endpoints located in file storage.

Disclosed herein is a commodity infrastructure operating system that manages and implements the resources and services found in the heterogeneous components of the common infrastructure. The infrastructure operating system managing one or more services residing within an operating system image of a partition. The infrastructure operating system capable of providing a service of a first partition's operating system to a second partition's operating system when the second partition is in need of the service.

Operating system in a commodity-based computing system

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.

Growing community of inventors

Minneapolis, MN, United States of America

Kelsey L Bruso