This talk will introduce how to design a concurrent map suitable for high-concurrency scenarios, as well as the problems existing in the `sync.Map` and built-in maps based on `sync.RWMutex` in high-concurrency scenarios. With this design, we can achieve an implementation that can be at least 10 times faster than `sync.Map` in typical cases (1% Delete, 9% Store, 90% Load).