Oracle International Corporation

Other

Daniel S Tow

Karl Dias

Girish Kumar Balachandran

Prabhaker Gongloor

Bruce Tow

Sriram Vrinda

Tira Oskoui

John T Kucera

Shantanu Joshi

Techniques for generating recommendations based on the predicted performance of an execution plan are disclosed. A system predicts the future characteristics of a set of data objects associated with a set of structured query language (SQL) statements. The system predicts how the changes to the set of data objects will result in changes to a query execution plan associated with the SQL statements. The system predicts a set of performance metrics for the changed query execution plan. Based on the predicted performance, the system generates recommendations for modifying data, applications, or database server operations to improve performance.

Generating recommendations based on predicted query execution plan performance

Techniques for selectively aggregating records based on a downstream function to be applied to the records are disclosed. A system obtains an instruction corresponding to a set of records and a function to be applied to the set of records. The system determines whether the function meets a particular criteria for aggregating records prior to transmitting the records to an application for executing the function on the records. If the system determines that the function does meet the records-aggregation criteria, the system stores a set of records in a buffer prior to sending the set of records to the function-executing application. The system sends the set of records to the application together as a group with an instruction to generate a set of function results that includes a separate value for each record in the set of records.

Selective aggregation of records for the application of a function

Techniques are disclosed hereafter for efficiently enforcing a 'WITHOUT OVERLAP' range constraint by confirming primary-key integrity for a new or modified row (the “target row”) by checking just two neighboring index entries, using a new “two-sided halted range scan” of the same key index on entities which have range-endpoints data as part of their primary key. Techniques are described for reducing search time and resources in situations where a query specifies an entity and a point within a non-overlapping range. Techniques are also described for optimized handling of queries that do not specify a primary key but have both a range condition and a filter on a non-key column.

Automated enforcement of range-keyed data

Enables a synergy between a consumer's Smartphone such as an IPHONE&#xae; and an inexpensive, energy-efficient electronic-reader type device, to provide the consumer the features of a more-expensive and higher-energy-use device by relegating capabilities requiring keyboard use e.g., physical or electronic, touch-screen, wireless-connection, telephony-connection e.g., 3G/4G, microphone, speaker, and more to the Smartphone while supporting where desired full-power standalone document-display features to the electronic reader. Apparatus includes an electronic-reader device with an electronic-ink screen and a small number of buttons to perform standalone features such as 'display next page'; a low power transceiver, memory, processing hardware, and associated software and battery. The electronic-reader device is especially designed to prevent inappropriate distribution of copyright-protected material.

Remote viewing apparatus for smartphone

In a database table with rows each having respective key values, the locking of a key value to enforce key-value uniqueness is accomplished by (a) mapping the key value into a set of hash values to produce a resulting hash value, and (b) locking all key values (i.e., preventing writing of key values in new rows and preventing updates creating new key values in existing rows) that map into the resulting hash value. This provides a compromise between the high-granularity and high-cost solution of indexing, and the low-cost but very low-granularity solution of table-level locking. One useful application of this technique lies in the enforcement of uniqueness of multi-column keys in the table without incurring the cost of indexing all possible combinations of column values that might comprise key values.

Method and apparatus of enforcing uniqueness of a key value for a row in

A method of constructing an aid to tuning of database statements comprises a data structure (stored in a memory on a computer system) which compactly represents that information which is needed about a database statement to determine the optimal series of operations (e.g., table data fetches) needed to execute the statement. The information includes the relationships between tables joined in the statement and the selectivities of logical conditions applied to rows in those tables.

Growing community of inventors

Palo Alto, CA, United States of America

Daniel S Tow