Easy Scaling with Open Source Data Structures
summary
Hazelcast runs as a single 5MB jar that creates a distributed, thread-safe hashmap across JVMs with maps, queues, topics, locks and transactions; default partitioning is 271 partitions so keys hash to fixed partitions and data rebalances automatically when nodes join. Demo shows ownership, synchronous backups, locks surviving failover and transactions transferring ownership. Use entry processor to run updates on the owning node (implicit lock, fewer round trips). Management via Management Center and optional MapStore persistence.
AI-written summary · about
chapters (27)
- 0:00Introduction
- 0:35What is Hazelcast
- 1:35Demo
- 3:03Starting the application
- 4:15Map layout
- 8:00Lock operation
- 13:03Transaction client perspective
- 17:13Multicast
- 21:58Partitioning
- 25:08Hazelcast
- 29:04API
- 29:55Data Distribution
- 32:23Multimap
- 33:02Transaction
- 33:40Partition
- 34:18xqService
- 34:48Scenario
- 36:30Deletion Task
- 37:08Entry Processor
- 38:36Entry Pass
- 38:52Query Hazel Customers
- 39:33Web Applications
- 39:51Talking to Hazelcast
- 40:16How to access your database
- 41:07Load all keys
- 42:04Persistence
- 44:19Wildcard
related talks
05mStartup Showcase: Hazelcast
55mHazelcast - Hitchhiker’s Guide. Grzegorz Piwowarek. Java Fest 2020 Online
50mNoSQL Databases You Have to Know
34mHigh Performance Cloud-Native Microservices
38mHazelcast That Could: Getting Lightning-Fast Responses at Hundreds of RPS
41mDistributed Java DBs Under the Hood: Main Components and Interactions Between Them
01h 08mDistributed Java Databases Under the Hood
43mCaching and Beyond - Smarter Data Processing with Java