Oracle International Corporation

Mehul Dilip Bastawala

Srinath Krishnaswamy

Lakshminarayanan Luxi Chidambaran

Sreenivas Gollapudi

Debashish Chatterjee

Sanjay Kaluskar

Juan R Loaiza

Tirthankar Lahiri

Bipul Sinha

Srinivas Vemuri

Ming Zhu

Vivekanandhan Raja

Ajit Mylavarapu

George Eadon

Ramesh Kumar

Atrayee Mullick

Nancy Reiko Ikeda

Rajendra Pingte

Ravikanth Kasamsetty

Sundeep Abraham

Jonathan Giloni

Santanu Datta

Robert Jenkins

An approach for implementing function semantic based partition-wise SQL execution and partition pruning in a data processing system is provided. The system receives a query directed to a range-partitioned table and determines if operation key(s) of the query include function(s) over the table partitioning key(s). If so, the system obtains a set of values corresponding to each partition by evaluating the function(s) on a low bound and/or a high bound table partitioning key value corresponding to the partition. The system may then compare the sets of values corresponding to different partitions and determine whether to aggregate results obtained by executing the query over the partitions based on the comparison. The system may also determine whether to prune any partitions from processing based on a set of correlations between the set of values for each partition and predicate(s) of the query including function(s) over the table partitioning key(s).

Consistent client-side caching for fine grained invalidations

Techniques are described that are performed by one or more database management system (DBMS) of the plurality of DBMS nodes comprising one or more database servers performing database operations on one or more databases of the DBMS nodes. The techniques describe receiving, at a QC node, a distributed query that specifying a database of a target DBMS node. Without requesting from the target DBMS node a current logical timestamp of the DBMS node, calculating a synchronization timestamp for the distributed query. In one embodiment, the calculation of the synchronization timestamp for the distributed query is based on a current logical timestamp of the QC node and one or more previous logical timestamps of the target DBMS node that were received prior to the receiving the distributed query. The QC node sends a request to the target DBMS node to execute an operation of the query at the target DBMS node based on the synchronization timestamp. The QC node may receive result set(s) from all the target DBMS nodes based on the synchronization timestamp, and aggregate the final result set to return to the client application.

Global consistency with recency in distributed database management systems

Described is an improved approach to implement parallel queries where session states are saved for parallelization resources. When work needs to be performed in the parallel query system for a given session, a search can be performed to identify a resource (from among the pool of available resources) that had previously been used by that session, and which had saved a session state object for that previous connection to the session. Instead of incurring the entirety of setup costs each time workload is assigned to a resource, the saved session state can be used to re-set the context for the resource to the configuration requirements for that session.

Method and system for implementing parallel database queries

The embodiments disclosed herein select and assign a floating IP address (FIP) to an application based on characteristics of the application. Floating IP addresses are assigned a classification, and one or more network adapters are mapped to a FIP according to the FIPs assigned classification. The endpoint of a connection for an application initiating a network connection with a target application may be assigned a floating IP address according to attributes of the application being consistent with the classification of a FIP. Applications may be grouped according to their respective classification, and the group of applications may share a corresponding FIP. FIPs may be dynamically configured for an application with mapped network adapters selected based on the attributes of the application. An application's characteristics may change during executions, and the network adapters mapped to the FIP assigned to the application's connection may be reassigned.

Client connection failover

A server receives a query and checks how columns in rows responsive to the query are to be sent to a client. Based on one result of checking, the server prepares and transmits a redacted version of one or more rows or portions thereof. The redacted version may be prepared by discarding from the retrieved rows or portions thereof, any columns that are to not be sent, by applying a specific redaction technique, while maintaining columns that are to be sent in a database storage format in which the retrieved rows are stored. Based on another result of checking, the server prepares and transmits a raw version of the retrieved rows or portions thereof, in the database storage format. Based on yet another result of checking, the server extracts columns selected by the query to memory and sends processed versions of the rows or portions thereof.

Framework to transfer rows in storage format, standard format, or combination thereof

Disclosed are methods and apparatuses that implement automatic resizing of statement caches in response to cache metrics. One embodiment provides an approach for periodically calculating a session eligibility index for each session cache, wherein the session eligibility index indicates the priority level of the session cache for resizing, and selecting and resizing one or more cache sessions based at least in part on the session eligibility index.

Statement cache auto-tuning

A method, system, and computer program product is disclosed for interacting with a client supported by a client-side cache. Embodiments of a method, a system, and a computer program product are disclosed that retrieve a first snapshot, indicating a state of the database after a last database request by the client, associated with the client, determine any number of invalid cached results for the client based on the first snapshot, and transmit the any number of invalid cached results and a second snapshot, an update for the first snapshot.

Server supporting a consistent client-side cache

A method, system, and computer program product is disclosed for caching results in a client-side cache. Embodiments of a method, a system, and a computer program product are disclosed that associate a first snapshot of a database with a client that indicates a state of the database after a last database request by the client, and indicate any number of invalid cached results in the client cache for the client based upon the first snapshot. In some embodiments, the method further includes receiving a second snapshot that indicates a state of the database upon receipt of a database server request by the client, and updating the first snapshot with the second snapshot.

Consistent client-side cache

Some embodiments are directed to a method and apparatus for implementing an automatic failover mechanism for a resource. A client accesses a source through a first server using a first session. During the session, the client stores checksum information corresponding to data received via the session with the first server. When it is detected that the session between the first server and the client has failed, the client is automatically connected with second server that has access to the resource. The checksum information is transmitted from the client to the second server, where it is compared with checksum information calculated at the second server, so that a determination can be made as to whether the client can continue processing where it left off when connected to the second server.

Method and system for automatic failover for clients accessing a resource through a server using hybrid checksum location

A system, method, computer program and system for suspending a result set and continuing from a suspended result set for a scrollable cursor is disclosed. The rows from a row source corresponding to the scrollable cursor result set are suspended into storage so that when a fetch is requested the data can be sent (continued) from the suspended storage and does not depend on the original scrollable cursor row source or session to be available.

Suspending a result set and continuing from a suspended result set for scrollable cursors

A system, method, computer program and system for suspending a result set and continuing from a suspended result set for a cursor is disclosed. The rows from a row source corresponding to the cursor result set are suspended into storage so that when a fetch is requested the data can be sent (continued) from the suspended storage and does not depend on the original cursor row source or session to be available.

Suspending a result set and continuing from a suspended result set

A system, method, computer program and system for suspending a result set and continuing from a suspended result set for transparent session migration is disclosed. The rows from a row source are suspended into storage, so that after session migration, the client fetches can transparently continue from the suspended result set.

Suspending a result set and continuing from a suspended result set for transparent session migration

A method and system for implementing scrollable cursors is described. A multi-tier caching structure is maintained, in which a partial result set is cached at the client computer and a more-complete result set is cached at the server computer. If the cursor is scrolled in either the forward or backward directions, the partial result set cached at the client computer is first checked to see if requested data is present. If so, then the requested data is fetched from the client cache and the current position of the cursor is moved to the appropriate position in the result set. If the requested data is not present in the client cache, then those data items are fetched from the cache at the server computer.

Method and system for scrollable cursors

Schema conversion approaches convert images of complex objects. The schema conversion is performed on images of complex objects belonging to a root class, whether those objects are instances of the root class or instances of a subclass of the root class. A complex object is an object that is comprised of a collection of objects or that has another object as an attribute. The approaches use change vectors to represent changes to make to an image to convert it between the target schema version and source schema version. Change vectors are generated based on schema version records, each of which describes the properties of a schema version, including the attributes in the schema version and the data type of each of the attributes. The approaches evolve changes that includes addition, modification and deletion of object attributes. They convert from an earlier schema version to a later schema version, and vice versa, i.e. from a later schema version to a earlier schema version.

Growing community of inventors

Sunnyvale, CA, United States of America

Mehul Dilip Bastawala