Hewlett-packard Development Company, L.p.

Hewlett Packard Enterprise Development LP

Tandem Computers Incorporated

David W Birdsall

Goetz Graefe

Gary Martin Gilbert

Yung-Li L Jow

Michael James Hanlon

Gunnar D Tapper

Meichun Hsu

Qiming Chen

Bin Zhang

Hansjorg Zeller

Ren Wu

Robert Matthew Wehrmeister

Gary Stephen Smith

Anoop Sharma

Subbarao Kakarlamudi

Harry Anthony Leslie

Shang-Sheng Tung

Sean L Broeder

Arvind Narain

Roberta S Marton

Gordon J Bowring

Tharaknath Capirala

Azim Fatehi

Rohit N Jain

Carol Jean Pearson

Emile Roth

John M Hausman

Kenneth K Luu

Hedieh Yaghmai

James J Collison

Vilmar Olsen

Thomas Canivel Reyes

Andy Therber

Hans Zeller

Regulating enterprise database warehouse resource usage can include identifying a number of queries in an enterprise database warehouse (EDW) and regulating EDW resource usage among the number of queries.

Regulating enterprise database warehouse resource usage of dedicated and shared process by using OS kernels, tenants, and table storage engines

Distributed data analysis systems and methods are provided. A data broker distributes received data to consumers, such as information and repository consumers, which can be subscribed to the data. A subsystem with a processor for data processing can provide data to the data broker. A first information consumer may include a receiving module for receiving the data from the data broker, an analysis module for analyzing the received data to obtain a result, and a publication module for sending the result to the data broker when a second information consumer is subscribed to the result.

Distributed data analysis

There is provided a computer-implemented method of executing a query plan against a database. An exemplary method comprises accessing a first subset of rows of a database table using a direct access method for an index. The query plan may comprise the direct access method. The exemplary method also comprises determining a processing cost of accessing the first subset of rows. The exemplary method further comprises modifying the direct access method for the index in response to determining that the processing cost exceeds a specified threshold. Additionally, the exemplary method comprises accessing a second subset of rows of the database table using the modified direct access method.

System and method for executing queries

One embodiment is a method that uses MapReduce and Relation Valued Functions (RVFs) with parallel processing to search a database and obtain search results.

Map-reduce and parallel processing in databases

The present disclosure provides a computer system with an event handling architecture. The computer system includes a processing node () comprising an event generator () configured to detect a system error corresponding to the processing node () and generate a tokenized event message. The tokenized event message is structured according to conformance rules. The system also includes a data broker () configured to receive the tokenized event message and send the tokenized event message to a structured query language (SQL) event consumer (). The SQL event consumer () is configured to generate a database record based on the tokenized event message and the conformance rules. The system also includes an event repository () with a relational database configured to receive the database record from the SQL event consumer ().

Method and system for processing events

A method for modifying an original data object in a database using a single command is disclosed. The single command is first validated. Once the command has been validated a ghost data object is created using the new definition. The ghost data object is populated with data from the original object. The transaction log records from the original data object are applied to the ghost data object. The original data object is then locked for exclusive access. The final transaction log records from the original data object are applied to the ghost data object. In the final step the database switches to the new data object. Dependent objects are automatically transformed as part of the same operation.

Single-operation on-line schema evolution

One embodiment is a method that reads audit from an audit trail of a source database distributed across multiple storage systems with independent audit trails and then replicates the audit trail to a target database distributed across multiple storage systems with independent audit trails without manual coordination by a database administrator.

Replication of operations on objects distributed in a storage system

There is provided a computer-implemented method of executing a query plan against a database. An exemplary method comprises accessing a first subset of rows of a database table using a direct access method. The query plan may comprise the direct access method. The exemplary method also comprises determining a processing cost of accessing the first subset of rows. The exemplary method further comprises modifying the direct access method in response to determining that the processing cost exceeds a specified threshold. Additionally, the exemplary method comprises accessing a second subset of rows of the database table using the modified direct access method.

Systems and methods to indicate whether to store a database query language module in a local directory or a global directory are disclosed. An application program can be created once, tested once, and deployed in separate environments. The database query language modules can be shared among a group of application programs running in a common environment. Separate query language modules can be maintained for each environment.

Systems and methods for handling multiple static query modules for distinct environments

A database management system (DBMS) provided with a multi-dimensional improved indexed accessing capability using keyed index searching. Individual search keys are constructed from general expression statements created in the DBMS compiler from search queries supplied to the DBMS. Each key column represents another dimension, and both ranges and IN lists can be specified in the search query and used as the predicate values in multiple columns. Missing predicate values in the search query are interpreted as a specification of the minimum and maximum values for the associated search key column. During compile time, the DBMS compiler produces general expressions to be used by the DBMS executor during run time to create the search keys. The DBMS compiler evaluates search queries by associating predicates with clusters and disjunct numbers assigned to each individual disjunct in the search query expression. The DBMS executor uses the general expression from the compiler and eliminates any conflicts among same column predicates, removes redundancies in predicate values and disjuncts and reduces the number of records to be accessed to the minimum required to complete the search query. The individual search keys are generated in the same order as the index to which the search pertains (i.e., increasing or decreasing order).

Database management system with improved indexed accessing

Growing community of inventors

Santa Clara, CA, United States of America

David W Birdsall