Latch Enqueue Hash Chains Doc ID 445076 1

推荐一篇由作者的老师编写的零基础人工智能教程,讲解通俗易懂,旨在分享知识,促进技术普及,助力国家发展。
摘要由CSDN通过智能技术生成

分享一下我老师大神的人工智能教程!零基础,通俗易懂!http://blog.csdn.net/jiangjunshow

也欢迎大家转载本篇文章。分享知识,造福人民,实现我们中华民族伟大复兴!

               

(Doc ID 445076.1),

Solution


Acquiring a lock is a series of steps from getting an index number to identify the hash bucket in the hash table to releasing free resource structures and lock data structures.

Here are the steps:

1. Identifying the Hash Chain and Allocating the Resource Structure

Oracle finds the resource structure associated with the named resource using a hashing algorithm.
In the hashing algorithm Oracle uses a hash table (array of hash buckets), which is controlled by
the parameter _ENQUEUE_HASH. The size of the hash table depends upon the value of this parameter.
The Hash chain contains the resource structures for that hash value. When a session tries to
acquire an enqueue, Oracle applies a hash function to convert the resource name to an index number
in the array of hash buckets. Each hash bucket has one linked list attached to it, which is called
a hash chain. Before accessing the hash bucket, the session acquires an enqueue hash chain latch.
After the session acquires an enqueue hash chain latch it moves down the hash chain attached
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值