Micro Focus Lcc

Hewlett-packard Development Company, L.p.

Benjamin M Vandiver

Jaimin Mukesh Dave

Pratyush Parimal

Shreya Prasad

Styliani Pantela

Lyric Pankaj Doshi

Pratibha Rana

Jason Michael Slaunwhite

Eden Zik

Seyed Amin Saeidi Nyasar

Mark Edward Hayden

Shilpa Lawande

Matthew Steven Fuller

Rajat Venkatesh

Chuck Bear

Sreenath Bodagala

Adam Benjamin Seering

Niccolo Meneghetti

James George Fraumeni

A technique includes performing optimistic concurrency control to process a request associated with a transaction to change a schema of an object. Performing the optimistic concurrency control includes locally modifying the object to change the schema of the object based on the request; after locally modifying the object, locking a global catalog to block the object from being globally modified; validating the locally modified object based on the global catalog; and committing the modified object to a globally shared storage in response to the modified object being validated.

Optimistic concurrency control for database transactions

A technique includes storing, by a computer, a composite metadata object in a catalog. The composite metadata object represents information about a plurality of database objects of a table structure; the table structure includes a plurality of rows and a plurality of columns; the plurality of database objects is associated with a subset of rows of the plurality of rows; and the plurality of database objects is associated with a plurality of files corresponding to the columns. The technique includes processing, by the computer, a database transaction based on the based on composite metadata object.

Composite metadata objects for database systems

In some examples, formatting semi-structured data in a database includes obtaining semi-structured data in a column store database, assigning the semi-structured data to a semi-structured column with a key and value format, and formatting the semi-structured data with an optimal search format.

Formatting semi-structured data in a database

In an example, a flexible schema table may be schematized. Records from the flexible schema table may be queried and, for keys in the records, a data type is estimated for each key. View columns may then be selected from the keys based on a predetermined condition. A view of the flexible schema table may be created from the selected view columns, wherein the view includes the view columns and the data types for the view columns.

Flexible schema table

A non-transitory machine-readable storage medium stores instructions that upon execution cause a processor to, in response to a receipt of a query, communicate, via a first encrypted channel using a first key, first encrypted data between a plurality of nodes of a distributed database system, the first encrypted data comprising query metadata and a second key; communicate, via a second encrypted channel, second encrypted data between the plurality of nodes of the distributed database system, the second encrypted channel using the second key included in the first encrypted data, the second encrypted data comprising query data; and generate, by the plurality of nodes of the distributed database system, results for the query based on the query data in the second encrypted data.

Encrypted communication channels for distributed database systems

A technique includes modeling assignments of a plurality of nodes to a plurality of shards associated with a database operation based on a target throughput for the plurality of nodes. The modeling includes constraining the assignments based on an aggregate outflow from the plurality of nodes. The technique includes initializing the aggregate outflow to be less than the target throughput; and determining the assignments based on the modeling.

Assigning nodes to shards based on a flow graph model

A technique includes applying a first mapping to associate a plurality of data records for a plurality of database nodes with a plurality of segments of a storage that is shared by the database nodes; and applying a many-to-many second mapping to associate the segments with the database nodes.

Assigning segments of a shared database storage to nodes

Data elements are stored at a plurality of nodes. Each data element is a member data element of one of a plurality of layouts. Each layout indicates a unique subset of nodes. All member data elements of the layout are stored on each node in the unique subset of nodes. A stored dependency list includes every layout that has member data elements. The dependency list is used to determine availability of data elements based on ability to access data from nodes from the plurality of nodes.

Determining availability of data elements in a storage system

Methods, systems and program products for database storage. In one implementation, data of a projection of a database is stored at least partly in grouped ROS format and partly in column format based on patterns of updating the projection data. The projection data is updated so that the updated projection is stored partly in grouped ROS format and partly in column format.

Growing community of inventors

Cambridge, MA, United States of America

Benjamin M Vandiver