International Business Machines Corporation

Nuance Communications, Inc.

Trend Micro Inc.

Infoprintsolutions Company, LLC

Paul Reuben Day

Cary Lee Bates

John Matthew Santosuosso

Brian Robert Muras

Brian John Cragun

Randy Lynn Egan

Roger Alan Mittelstadt

Robert James Crenshaw

Anne Marie Ryg

Jeffrey Michael Ryan

Jeffrey Wayne Tenner

Robert Douglas Driesch, Jr

Steven Gene Halverson

Mark William Theuer

Vadim Berestetsky

William G Barrus

John Michael Adolphson

Harvey Gene Kiel

Peter Joseph Heyrman

Mahdad Majd

David L Johnson

Gregory Paul Andrews

Patrick Leo Glenski

Shawn Joseph Baranczyk

James Richard Coon

Jerry A Blades

Thomas Owen McKinley

Thomas J Ashford

Victor John Gettler

David Richard Poulter

Jody E Berk

Lee William Jameson

Scott W Elliott

Dale M Stahl

A method, apparatus and program product that determine a density of a key value referenced in a database query over at least one range of rows, and utilize the determined density to optimize the database query. By doing so, the density of various key values may be determined and compared, and a bit map may be generated over the range of rows of the key value that is denser, resulting in a reduction of resources to build and use the bit map. Moreover, from the bit map over the range of rows to be selected after using the determined density, dense regions may be identified that can be used to optimize block I/O's according to the number of rows to be selected based on the query.

Determining a density of a key value referenced in a database query over a range of rows

A secure messaging system and method includes receiving an encrypted message, the message having been encrypted using a token of a corresponding pervasive device; wirelessly verifying the presence of the pervasive device; and, if the presence can be verified, decrypting the message using the token. The verification step can include the steps of establishing a wireless link with the pervasive device; and, querying the pervasive device over the wireless link. The establishing step can include the step of establishing a Bluetooth link with the pervasive device. Furthermore, the querying step can include the step of requesting geographic coordinates which locate the pervasive device.

Enhanced message security

A database query optimizer allows specifying a performance specification for a query. When an access plan is created, the actual performance for executing the query using the access plan is determined and compared to the performance specification for the query. If the actual performance does not satisfy the performance specification for the query, the query optimizer autonomically generates a different access plan to see if the performance improves. If an access plan that meets the performance specification is generated, the new access plan is stored in the access plan cache for the query. If no access plan can be generated that meets the performance specification for the query, the access plan that provided the best performance is selected and stored in the access plan cache for the query.

Autonomically generating a query implementation that meets a defined performance specification

An apparatus and method helps a user to determine parts of an electronic document that are of interest by allowing the user to define preferences for processing an electronic document, and by automatically highlighting one or more portions of the document according to the user preferences. Highlighting includes any way to enhance or alter the appearance of text, including bold, italics, underlining, change in font style, change in font size, change in color, change in background color, etc. The automatic highlighting of portions of the document attract the user's eyes to that portion of the document, which helps the user to discern whether or not the highlighted portion is relevant or interesting. The preferred embodiments also include a document generator that takes an input document and generates therefrom an output document that has one or more highlighted portions that are hard-coded into the document according to the user preferences.

Automatically highlighting text in an electronic document

A self-healing database engine and optimizer framework support automatically responding to execution errors to allow continued execution of a query plan. Upon encountering an execution error, the database engine automatically initiates a rebuilding of the query plan and executes the rebuilt execution plan. If an error is encountered in the rebuilt query plan then the query implementation methods are analyzed. If a query function is identified for which an alternative implementation method is available, then this alternative implementation method is substituted to create a new query plan. The new query plan is then executed to determine if the error is corrected.

Method and system for a self-healing query access plan

An enhanced mechanism for intelligently managing an open query cursor built from a query access plan (AP) by a query optimizer of a database management system (DBMS). In an embodiment, a cursor management system (CMS) detects whether an open query cursor was previously requested for use within another job. If the open query cursor was previously requested, the CMS intelligently manages the query cursor for subsequent use within a different job. For example, the open query cursor may be recycled for subsequent use within the different job. Hence, system resources are not wasted in building and destroying the same cursors for multiple jobs. Alternatively, the query cursor may be pre-built before the cursor is requested for subsequent use within the different job. The CMS may also obtain, release and re-obtain locks for cursors being managed. Alternatively, the job that uses the cursor may obtain the lock.

Intelligent open query cursor management

A method, apparatus and program product are provided for servicing a production program. A mirror program is dynamically created using source code associated with the production program. The mirror program includes enhanced serviceability functionally relative to the production program that generates service information relevant to the production program. The mirror program executes while the production program remains in an active state such that the production program may be serviced using service information generated by the mirror program. The source code used to compile the production program is compared to a base line copy of the source code. Portions of the source code that differ from the base line copy of the source code are stored. The stored portions of the source code are associated with a unique identifier which is saved with the compiled production program.

Servicing a production program in an integrated development environment

A method, apparatus and program product use a first index associated with a field in a database table to identify a range of records in the database table that includes instances of a first key value in the field and use the identified range of records to subset a second index associated with another field in a database table. The database query identifies the first key value for the field in the database table and the second key value for the other field in the database table. By doing so, information from an index may be carried over and applied to another index to subset the other index, often reducing the quantity of entries that are searched in the other index and improving performance.

Database query optimization using index carryover to subset an index

A method, apparatus, and program product select a pre-started job from among a plurality of pre-started jobs in which to perform a task in a computer system with a NUMA configuration. An attempt to perform a task is received as a connection. Information associated with the connection is compared to information associated with a plurality of pre-started jobs. In response to comparing the information, it is determined either that a pre-started job was previously used to perform the task or that no pre-started job was previously used to perform the task. In response to either determination, another pre-started job is determined in which to perform the task. The other pre-started job is determined based on affinity with the task, and may be reallocated to perform the task.

Intelligent pre-started job affinity for non-uniform memory access computer system

An apparatus, program product and method utilize voice recognition to process voice messages in an automated manner to detect spoken numbers contained therein. Detected spoken numbers can then be analyzed to automatically determine whether such numbers are telephone numbers, and thus enable such numbers to be automatically dialed.

Automated detection of spoken numbers in voice messages

In an embodiment, a FIRSTIO execution plan is selected that has a lowest estimated execution time for finding a number of records that satisfy the query and are simultaneously viewable. An ALLIO execution plan is selected that has a lowest estimated execution time for finding all records that satisfy the query. The FIRSTIO execution plan is executed for a first time period to create a FIRSTIO result set. The ALLIO execution plan is executed for a second time period to create an ALLIO result set. The FIRSTIO result set is displayed if the FIRSTIO result set comprises more records than the ALLIO result set. The ALLIO result set is displayed if the ALLIO result set comprises more records than the FIRSTIO result set. In an embodiment, the first and second time periods expire in response to the expiration of a maximum time specified by the query.

Executing a query plan with display of intermediate results

Database management systems and methods for searching a database are disclosed. In one embodiment, an inspector examines a plan cache or a program containing embedded queries. A plurality of similar queries is identified, and an alias is generated that satisfies the plurality of queries. The alias may be executed on a database to output a result set. Queries belonging to the alias may be executed on the result set of the alias, rather than on the database. Accordingly, efficiency is improved and runtime costs are reduced as compared to conventional database management systems.

Method of querying relational database management systems

Growing community of inventors

Rochester, MN, United States of America

Paul Reuben Day