International Business Machines Corporation

Google Inc.

Travis Michael Drucker

Hoa Thu Tran

Richard Joseph Stevens

Joel C Dubbels

David Alan Wall

Judy I Djugash

Thomas John Eggebraaten

Janice R Glowacki

Abdo Esmail Abdo

Richard D Dettinger

Brian Robert Muras

Jeffrey Wayne Tenner

Jeffrey S McAllister

William Craig Rapp

David Glenn Carlson

Timothy John Mullins

Nelson Ramirez

Administering a business transaction, including: receiving a request for a business transaction, the request containing data to be processed by the business transaction and metadata describing the data and the request; creating, in dependence upon classification rules, the data to be processed by the business transaction, and the metadata describing the data and the request, a business object representing the business transaction; selecting, in dependence upon workflow selection rules and attributes of the business object, one or more workflows to process the data to be processed by the business transaction; processing the data to be processed by the business transaction with the workflows, thereby creating a resultant business object and resultant data; and routing, in dependence upon content routing rules and the attributes of the resultant business object, the resultant data to a destination.

Processing system using metadata for administering a business transaction

Statistics for a pattern matching predicate are generated using stored character statistics. A first structure stores, for each of a plurality of character positions, frequently occurring characters in that character position, and a count of the number of occurrences of that character. A second structure stores frequently occurring characters that are subsequent to the frequently occurring characters stored in the first structure, and a probability of occurrence of each frequently occurring subsequent character. To form an estimate of the number of tuples matching a pattern matching predicate, statistics are retrieved for the matching characters in each matching position in the predicate, and then combined to produce the estimate. In the event a statistic is not stored for a desired character, the available statistics are used to make an estimate by accumulating statistics for other characters, and then calculating average frequency of occurrence of characters that do not have stored statistics.

Generating statistics on text pattern matching predicates for access planning

Methods, systems and articles of manufacture are provided for migrating entity relationship data residing in an object oriented program environment to a relational database schema. Further, functionality is provided to facilitate more efficient searching and reconstruction of the entity relationship data in the relational database.

Method and system for reconstruction of object model data in a relational database

Managing failover operations on a cluster of computers, including: identifying, by a failover hold module, a failure to access data storage in the cluster of computers; preventing the execution of all read operations directed to the data storage that were received after the failure to access data storage was identified; executing all write operations directed to the data storage that were received after the failure to access data storage was identified, including writing data to a cache; identifying that a failover to alternative data storage is complete; executing the held read operations, including reading data from the alternative data storage; and copying, from cache to the alternative data storage, the data written to the cache as part of the write operations.

Managing failover operations on a cluster of computers

Methods and apparatus for optimizing an abstract query are disclosed. Embodiments of the present invention allow an abstract database to optimize an abstract query composed from a set of logical fields. Each logical field includes a field name and an access method used to map the logical field to an underlying physical representation of the data. After a user composes an abstract query and submits it for execution, a runtime component and optimization component may be configured to resolve the abstract query to a physical query of the underlying physical data source using an access method associated with each logical field. In addition, as the runtime component builds a query consistent with the schema of the underlying database, an optimizing component may modify the query using any suitable optimization techniques. Different optimization techniques include optimizations based on logical field metadata, optimizations based on the underlying physical data repositories referenced by an access method and optimizations based on the relationships between logical fields or underlying data structures.

Method and process of query optimization to a given environment via specific abstraction layer domain knowledge

Techniques are disclosed for converting data into a format tailored for efficient multidimensional fast Fourier transforms (FFTS) on single instruction, multiple data (SIMD) multi-core processor architectures. The technique includes converting data from a multidimensional array stored in a conventional row-major order into SIMD format. Converted data in SIMD format consists of a sequence of blocks, where each block interleaves s rows such that SIMD vector processors may operate on s rows simultaneously. As a result, the converted data in SIMD format enables smaller-sized 1D FFTs to be optimized in SIMD multi-core processor architectures.

Processing array data on SIMD multi-core processor architectures

Methods, systems and articles of manufacture are provided to facilitate efficient searching and reconstruction of entity relationship data in a relational database. The entity relationship data in the relational database is migrated from an object oriented program environment.

Methods, systems, and articles of manufacture for referencing a selection of data including a plurality of individual data points (e.g., database cells) are provided. Rather than store a reference to each individual data point, only sufficient information necessary to describe a bounding edge of the data selection (an 'edge definition') may be stored, thus significantly reducing the amount of storage. Depending on the application, edge definitions may be used to describe two-dimensional or higher order selections of data.

Growing community of inventors

Rochester, MN, United States of America

Travis Michael Drucker