System and method for optimistic caching
AssigneeBEA Systems, Inc.
InventorsSeth White, Adam Messinger, Dean Bernard Jacobs, Rob Woollen
Life of this patent
Estimating the term…
Loading patent…
AssigneeBEA Systems, Inc.
InventorsSeth White, Adam Messinger, Dean Bernard Jacobs, Rob Woollen
Estimating the term…
Transactions are granted concurrent access to a data item through the use of an optimistic concurrency algorithm. Each transaction gets its own instance of the data item, such as in a cache or in an entity bean, such that it is not necessary to lock the data. The instances can come from the data or from other instances. When a transaction updates the data item, the optimistic concurrency algorithm ensures that the other instances are notified that the data item has been changed and that it is necessary to read a new instance, from the database or from an updated instance. This description is not intended to be a complete description of, or limit the scope of, the invention. Other features, aspects, and objects of the invention can be obtained from a review of the specification, the figures, and the claims.
A system for concurrently caching instances of a data item, comprising:
A method for concurrently caching instances of a data item, comprising:
A method for concurrently caching instances of a data item, comprising:
A system for concurrently caching instances of a data item, comprising:
A method for concurrently caching instances of a data item, comprising:
A method for concurrently caching instances of a data item comprising the steps of:
A system for concurrently caching instances of a data item, comprising:
Dependencies are inferred from the claim text.