主页
产品
Red Hat Data Grid
6.1
Administration and Configuration Guide
9.4.5. Implicit Pessimistic Locking Example

此内容没有您所选择的语言版本。

9.4.5. Implicit Pessimistic Locking Example

An example of implicit pessimistic locking using a transaction that runs on one of the cache nodes is as follows:

tx.begin()
cache.put(K,V)
cache.put(K2,V2)
cache.put(K,V5)
tx.commit()

tx.begin()
cache.put(K,V)
cache.put(K2,V2)
cache.put(K,V5)
tx.commit()

Copy to Clipboard

Toggle word wrap

When the line cache.put(K,V) executes, a cluster-wide lock is acquired on K.
When the line cache.put(K2,V2) executes, a cluster-wide lock is acquired on K2.
When the line cache.put(K,V5) executes, the lock acquisition is non operational because a cluster-wide lock for K has been previously acquired. The put operation will still occur.
When the line tx.commit() executes, all locks held for this transaction are released.

返回顶部

学习

尝试、购买和销售

社区

关于红帽文档

通过我们的产品和服务，以及可以信赖的内容，帮助红帽用户创新并实现他们的目标。了解我们当前的更新.

让开源更具包容性

红帽致力于替换我们的代码、文档和 Web 属性中存在问题的语言。欲了解更多详情，请参阅红帽博客.

關於紅帽

我们提供强化的解决方案，使企业能够更轻松地跨平台和环境（从核心数据中心到网络边缘）工作。

Theme

© 2025 Red Hat