System and method for optimistic caching
First Claim
1. A computer implemented system for concurrently caching instances of a data item, comprising:
- a database capable of storing a data item;
a plurality of cluster nodes capable of executing a transaction using the data item;
a cache for cluster nodes executing a transaction, the cache capable of storing an instance of the data item; and
an optimistic caching algorithm running concurrently on multiple cluster nodes, the algorithm capable of directing the clusters node to notify other cluster nodes when updating the data item in the database.
1 Assignment
0 Petitions
Accused Products
Abstract
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.
62 Citations
22 Claims
-
1. A computer implemented system for concurrently caching instances of a data item, comprising:
-
a database capable of storing a data item;
a plurality of cluster nodes capable of executing a transaction using the data item;
a cache for cluster nodes executing a transaction, the cache capable of storing an instance of the data item; and
an optimistic caching algorithm running concurrently on multiple cluster nodes, the algorithm capable of directing the clusters node to notify other cluster nodes when updating the data item in the database. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18)
-
-
9. A computer implemented system for concurrently caching instances of a data item, comprising:
-
a plurality of nodes capable of executing a transaction wherein the transaction is adapted to use an instance of a data item derived from a data item stored in a database;
at least one cache associated with the plurality of nodes being capable of storing the instance of a data item; and
an optimistic caching algorithm running concurrently on at least some of the plurality of nodes, the optimistic caching algorithm capable of directing nodes to notify other nodes when updating the data item in the database.
-
-
19. A computer implemented system for concurrently caching instances of a data item, comprising:
-
a plurality of nodes capable of executing a transaction wherein the transaction is adapted to use an instance of a data item derived from a data item stored in a database;
at least one cache associated with the plurality of nodes being capable of storing the instance of a data item; and
an optimistic caching algorithm running concurrently on at least some of the plurality of nodes, the optimistic caching algorithm capable of directing nodes to notify other nodes when updating the data item in the database, data items are stored as enterprise beans at the at least one cache. - View Dependent Claims (20, 21, 22)
-
Specification