摘要:
Disclosed are improved methods, systems, and media for cursor sharing and cursor pruning. According to some approaches, existing child cursors are distinguished using a cursor sharing criteria node structure. A sharing criteria node (also referred to as a “diagnostic” node) is created when a sharing criteria mismatch/failure happens. The node contains information about why the child cursor could not be shared and also information that can be used to quickly re-evaluate this sharing criterion in the future.
摘要:
A method and apparatus for efficiently managing cached objects is provided. A mapping is a typed relationship between cached objects. A base object contains content, and a mapped object is mapped to a base object when there is a particular relationship between the mapped object and the base object. The type of mapping defines how the objects in the relationship are treated when the mapped object is created, read, or written. At creation time, the mapping type may define how the mapping relationship is recognized. Sometimes recognizing a relationship requires establishing equivalence between the objects. At read and write time, the mapping type may define on which object a mutual exclusion lock is held, which content is returned or which object's content is updated. A wide range of applications can benefit from enhanced object caching performance, and in addition, application may define application-specific semantics on mapping types as well.
摘要:
A method and apparatus for efficiently managing cached objects is provided. A mapping is a typed relationship between cached objects. A base object contains content, and a mapped object is mapped to a base object when there is a particular relationship between the mapped object and the base object. The type of mapping defines how the objects in the relationship are treated when the mapped object is created, read, or written. At creation time, the mapping type may define how the mapping relationship is recognized. Sometimes recognizing a relationship requires establishing equivalence between the objects. At read and write time, the mapping type may define on which object a mutual exclusion lock is held, which content is returned or which object's content is updated. A wide range of applications can benefit from enhanced object caching performance, and in addition, application may define application-specific semantics on mapping types as well.
摘要:
A standby database system or another replica data system replicates changes, made to data blocks at a source database system or another primary data copy, to replicas of the data blocks at the standby database system or other replica. While replicating the changes to the data blocks thereof, the standby database system (or other replica) receives queries (or reads) issued thereto and computes the queries based on data read from the data blocks thereof.
摘要:
A standby database system or another replica data system replicates changes, made to data blocks at a source database system or another primary data copy, to replicas of the data blocks at the standby database system or other replica. While replicating the changes to the data blocks thereof, the standby database system (or other replica) receives queries (or reads) issued thereto and computes the queries based on data read from the data blocks thereof.
摘要:
A database may facilitate zero-downtime upgrades by concurrently maintaining multiple editions of database objects for use by both pre-upgrade and post-upgrade clients of a database application. Operations performed within the database are associated with an edition based on, for example, an initiating client or transaction. When an operation references an object or data, the database automatically performs the operation using the object or data associated with the edition with which the operation is itself associated. The database may determine the associated edition without explicit identification of the associated edition in a query or in code. Thus, no client or stored procedure code changes are necessary to reflect a new edition added during an update. Data changes in one edition may be automatically and immediately propagated to the other edition through the use of cross-edition triggers, thereby allowing both pre-upgrade and post-upgrade clients to remain fully functional throughout an upgrade.
摘要:
A database may facilitate zero-downtime upgrades by concurrently maintaining multiple editions of database objects for use by both pre-upgrade and post-upgrade clients of a database application. Operations performed within the database are associated with an edition based on, for example, an initiating client or transaction. When an operation references an object or data, the database automatically performs the operation using the object or data associated with the edition with which the operation is itself associated. The database may determine the associated edition without explicit identification of the associated edition in a query or in code. Thus, no client or stored procedure code changes are necessary to reflect a new edition added during an update. Data changes in one edition may be automatically and immediately propagated to the other edition through the use of cross-edition triggers, thereby allowing both pre-upgrade and post-upgrade clients to remain fully functional throughout an upgrade.
摘要:
A method and apparatus for updating databases are disclosed. An update vector for an object is created for identifying updated attributes. A dependent object is identified and a dependency vector of the dependent object is compared with update vector to determine whether the dependent object depends on the updated attributes.
摘要:
A method and apparatus for updating databases are disclosed. An update vector for an object is created for identifying updated attributes. A dependent object is identified and a dependency vector of the dependent object is compared with update vector to determine whether the dependent object depends on the updated attributes.
摘要:
A method and system for using a requeueing procedure to resolve deadlocks in a computing system is disclosed. A request for a resource may be requeued after a designated period of time or wait cycles if it is blocked from being granted. For example, a request for exclusive ownership of a resource could be requeued if it cannot be granted within an appropriate period of time. These types of requests are requeued to allow other requests for the same resource to move ahead in the wait queue. This allows other grantable requests behind the blocked request to be immediately granted. Using this approach, it is possible that allowing the other requests behind the timed-out request to move ahead in the queue will set off a chain reaction of accesses to resources which will clear the deadlock situation that initially causes the requeued request(s) to be blocked.