版权声明:本文为博主原创文章,遵循 CC 4.0 BY-SA 版权协议,转载请附上原文出处链接和本声明。
本文链接:https://blog.csdn.net/weixin_42528266/article/details/102857697
简介:当新增⼀个⽂档时,这个⽂档会存放在那个分⽚中呢?
shard = hash(routing) % number_of_primary_shards
PUT /nba/_doc/1
{
"name": "哈登",
"team_name": "⽕箭",
"position": "得分后卫",
"play_year": "10",
"jerse_no": "13"
}
GET /nba/_search_shards?routing=1
{
"nodes": {
"V1JO7QXLSX-yeVI82WkgtA": {
"name": "node-1",
"ephemeral_id": "_d96PgOSTnKo6nrJVqIYpw",
"transport_address": "192.168.1.101:9300",
"attributes": {
"ml.machine_memory": "8589934592",
"xpack.installed": "true",
"ml.max_open_jobs": "20"
}
},
"z65Hwe_RR_efA4yj3n8sHQ": {
"name": "node-3",
"ephemeral_id": "MOE_Ne7ZRyaKRHFSWJZWpA",
"transport_address": "192.168.1.101:9500",
"attributes": {
"ml.machine_memory": "8589934592",
"ml.max_open_jobs": "20",
"xpack.installed": "true"
}
}
第3集 剖析elastic search的乐观锁
简介: 剖析elastic search的乐观锁
锁的简单分类
悲观锁
顾名思义, 就是很悲观, 每次去拿数据的时候都认为别⼈ 会修改, 所以每次在拿数据的时候
都会上锁, 这样别⼈ 想拿这个数据就会阻塞, 直到它拿到锁。 传统的关系型数据库⾥ 边就⽤
到了很多这种锁机制,⽐ 如⾏ 锁, 表锁等, 读锁, 写锁等, 都是在做操作之前先上锁。
},
"indices": {
"nba": {}
},
"shards": [
[{
"state": "STARTED",
"primary": true,
"node": "V1JO7QXLSX-yeVI82WkgtA",
"relocating_node": null,
"shard": 2,
"index": "nba",
"allocation_id": {
"id": "leX_k6McShyMoM1eNQJXOA"
}
},
{
"state": "STARTED",
"primary": false,
"node": "z65Hwe_RR_efA4yj3n8sHQ",
"relocating_node": null,
"shard": 2,
"index": "nba",
"allocation_id": {
"id": "6sUSANMuSGKLgcIpBa4yYg"
}
}
]
]
}