|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
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, 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 can 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.
Method Summary | |
---|---|
void |
delete(K key)
Deletes the entry with a given key from the store. |
void |
deleteAll(Collection<K> keys)
Deletes multiple entries from the store. |
void |
store(K key,
V value)
Stores the key-value pair. |
void |
storeAll(Map<K,V> map)
Stores multiple entries. |
Methods inherited from interface com.hazelcast.core.MapLoader |
---|
load, loadAll, loadAllKeys |
Method Detail |
---|
void store(K key, V value)
key
- key of the entry to storevalue
- value of the entry to storevoid storeAll(Map<K,V> map)
map
- map of entries to storevoid delete(K key)
key
- key to delete from the store.void deleteAll(Collection<K> keys)
keys
- keys of the entries to delete.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |