public interface MapStore<K,V>
Hazelcast distributed map implementation is an in-memory data store, but
it can be backed by any type of data store such as RDBMS, OODBMS, NOSQL, or simply
a file-based data store.
IMap.put(key, value) normally stores the entry into JVM's memory. If MapStore
implementation is provided then Hazelcast will also call the MapStore
implementation to store the entry into a user-defined storage, such as
RDBMS or some other external storage system. It is completely up to the user
how the key-value will be stored or deleted.
Same goes for IMap.remove(key).
Store implementation can be called synchronously (write-through)
or asynchronously (write-behind) depending on the configuration.
Stores multiple entries. Implementation of this method can optimize the
store operation by storing all entries in one database connection.
storeAll is used when writeDelaySeconds is positive (write-behind).
If an exception is thrown, the entries will try to be stored one by one using the store() method.
Note: on the retry phase only entries left in the map will be stored one-by-one. In this way a
MapStore implementation can handle partial storeAll cases when some entries were stored successfully
before failure happens. Entries removed from the map will be not passed to subsequent call to
store() method any more.
Deletes multiple entries from the store.
If an exception is thrown the entries will try to be deleted one by one using the delete() method.
Note: on the retry phase only entries left in the keys will be deleted one-by-one. In this way a
MapStore implementation can handle partial deleteAll cases when some entries were deleted successfully
before failure happens. Entries removed from the keys will be not passed to subsequent call to
delete() method any more.