Openhft Chronicle Map Data Store Specification

Preparation OpenHFT/Chronicle-Map OpenHFT/Chronicle-Map Replication Design Overview Each Chronicle Map is split into N completely independent, ordered segments the number of segments is chosen during the Chronicle Map creation and is never changed. each segment has an associated 3-level lock (the read, update and write levels). Query Flow Compute the hash code of the queried key.

OpenHFT/Chronicle-Map Replication

Preparation OpenHFT/Chronicle-Map Key points Enterprise Edition feature It’s TCP/IP Replication TCP/IP Throttling - only broadcasts the latest update of each entry How Chronicle Map Replication works Refer to an instance of a remote map as a node. Each node can be connected to up to 128 other nodes. each remote map mirrors its changes over to another remote map.

OpenHFT/Chronicle-Map

Replicate your Key Value Store across your network, with consistency, persistance and performance. — OpenHFT Chronicle-Map github.com/OpenHFT/Chronicle-Map Features Ultra low latency: Chronicle Map targets median latency of both read and write queries of less than 1 microsecond in certain tests. High concurrency: Write queries scale well up to the number of hardware execution threads in the server. Read queries never block each other.