CPS-1033 Hazelcast Features
Overview
License : CPS-1026 Hazelcast Licensing
Hazelcast has two types of distributed objects in terms of their partitioning strategies:
Data structures where each partition stores a part of the instance, namely partitioned data structures.
Data structures where a single partition stores the whole instance, namely non-partitioned data structures.
Distributed Data Structures
Distributed Data Structure | Type | Use Case | Comments |
---|---|---|---|
Map | Partitioned | ||
MultiMap | Partitioned | Multiple values inside a single key | |
Cache | Partitioned | ||
Queue | Non-Partitioned | BlockingQueue, PriorityQueue | |
Set | Non-Partitioned | No order Preserved, No duplicates | |
List | Non-Partitioned | Preserves Order, Duplicates allowed | |
Ringbuffer | Non-Partitioned | Like a Circular Array | |
FencedLock | Non-Partitioned | Works like Locks in java. | |
ISemaphore | Non-Partitioned | ||
IAtomicLong | Non-Partitioned | ||
IAtomicReference | Non-Partitioned | ||
FlakeIdGenerator | Non-Partitioned | ||
ICountdownLatch | Non-Partitioned | ||
Few Other useful datastructures.
Flake ID Generator : Cluster-Wide Unique IDs.
References
https://docs.hazelcast.com/imdg/4.2/