Bug 7715339 - Logon failures causes "row cache lock" waits - Allow disable of logon delay


(文档 ID 7715339.8) 究竟部 

改动时间:2012-7-26类型:PATCH 

为此文档评级 通过电子邮件发送此文档的链接 在新窗体中打开文档 可打印页

Bug 7715339  Logon failures causes "row cache lock" waits - Allow disable of logon delay

This note gives a brief overview of bug 7715339.

 The content was last updated on: 19-JUN-2012

 Click here for details of each of the sections below.

Affects:

Product (Component)  Oracle Server (Rdbms)

Range of versions believed to be affected  Versions >= 11.1

Versions confirmed as being affected 

11.1.0.7

Platforms affected  Generic (all / most platforms affected)

Fixed:

This issue is fixed in 

11.2.0.1 (Base Release)

Symptoms:

Related To:

Performance Affected (General)

Waits for "row cache lock"

Security ( Authentication / Privileges / Auditing )

Description

In 11g there is an intentional delay between allowing failed logon

attempts to retry. For some specific application types this can cause

a problem as the row cache entry is locked for the duration of the

delay . This can lead to excessive row cache lock waits for DC_USERS

for specific users / schemas .

 

This "fix" allows the logon delay to be disabled in 11.2.0.1 onwards

by setting event 28401 in the init.ora.

eg:

    event="28401 trace name context forever, level 1" # disable logon delay.-----该事件会禁用登录延迟,一种假死的状态

This "event" will disable the logon sleep delay system-wide,

ie. it will affect all user accounts, system-wide, and so should be used

    with extreme caution.

 

Example scenario:

 A mix of correct and incorrect logon attempts occur for user X

 On each successive failed login attempt the failed logon count

  is incremented for user X.

 

 Without this fix (without the event set):

  After 3 successive failures a sleep delay is introduced starting

   at 3 seconds and extending to 10 seconds max. During each delay

   the user X row cache lock is held in exclusive mode preventing

   any concurrent logon attempt as user X (and preventing any

   other operation which would need the row cache lock for user X).

 

 With the fix (with the event set):

  There is no sleep delay.

 

 In either scenario the configured logon profile rules are still

 applied (eg: The profile option FAILED_LOGIN_ATTEMPTS is still

 honoured and so if the account becomes locked due to exceeeding

 this FAILED_LOGIN_ATTEMPTS then further attempts to

 log in will then correctly fail immediately with no delay).

 

Note:

 One off fixes for this issue for 11.1.0.7 do not need an event set -

 interim patches for 11.1 disable the delay unconditionally.

 

Work Around:

 Ensure the correct password is used - especially for connection

 intensive logons

 

Getting a Fix

 Use one of the "Fixed" versions listed above

 (for Patch Sets / bundles use the latest version available as

  contents are cumulative - the "Fixed" version listed above is

  the first version where the fix is included)

 or

 You can check for existing interim patches here: Patch:7715339

 

Please note: The above is a summary description only. Actual symptoms can vary. Matching to any symptoms here does not confirm that you are encountering this problem. For questions about this bug please consult Oracle Support.

References

Bug:7715339 (This link will only work for PUBLISHED bugs)

Note:245840.1 Information on the sections in this article

bug 7715339 登录失败触发 ‘row cache lock’ 等待的更多相关文章

  1. Database hang and Row Cache Lock concurrency troubleshooting

    http://www.dadbm.com/database-hang-row-cache-lock-concurrency-troubleshooting/ Issue backgroundThis ...

  2. 【转载】row cache lock

    转自:http://blog.itpub.net/26736162/viewspace-2139754/   定位的办法: --查询row cache lock等待 select event,p1   ...

  3. row cache lock

    SQL> col name format a30 SQL> select * from (select SAMPLE_TIME, SESSION_ID, NAME, P1, P2, P3, ...

  4. 关于library cache lock和row cache lock产生的常见原因

    这两个等待事件其实很少出现在top5列表中,一般都没什么印象,在此整理记录以便以后查阅. 常见的library cache lock产生的原因在<高级OWI与Oracle性能调查>这本书和 ...

  5. Sessions Hang on row cache lock

    Sessions Hang on "row cache lock" (dc_objects) While Creating & Dropping a Table Concu ...

  6. 【等待事件】序列等待事件总结(enq: SQ - contention、row cache lock、DFS lock handle和enq: SV - contention)

    [等待事件]序列等待事件总结(enq: SQ - contention.row cache lock.DFS lock handle和enq: SV -  contention) 1  BLOG文档结 ...

  7. library cache lock和cursor: pin S wait on X等待

    1.现象: 客户10.2.0.4 RAC环境,出现大量的library cache lock和cursor: pin S wait on X等待,经分析是由于统计信息收集僵死导致的.数据库在8点到9点 ...

  8. Library cache lock/pin详解

    Library cache lock/pin 一.概述 ---本文是网络资料加metalink 等整理得来一个实例中的library cache包括了不同类型对象的描述,如:游标,索引,表,视图,过程 ...

  9. 如何使用event 10049分析定位library cache lock and library cache pin

    Oracle Library Cache 的 lock 与 pin 说明 一. 相关的基本概念 之前整理了一篇blog,讲了Library Cache 的机制,参考: Oracle Library c ...

随机推荐

  1. 题解 P3521 【[POI2011]ROT-Tree Rotations】

    这道题采用权值线段树合并的解法. 首先讲一下解法中出现的两个概念:权值线段树与线段树合并. 所谓权值线段树,可以理解为维护的信息反过来的普通线段树,我个人认为值域线段树这个名字其实要准确一些. 举个例 ...

  2. ArcGIS api for javascript——渲染-计算相等间隔分级

    描述 本例展示了如何配置分级渲染使用一个相等间隔分类.在这个分类类型中,断点被设置为相等的距离. 可以手工添加相等距离的断点:然而,如果数据被修改了,那些断点就会是不合理的.本例自动地计算断点,因此相 ...

  3. BZOJ5105: [CodePlus2017]晨跑

    [传送门:BZOJ5105] 简要题意: 给出a,b,c,求a,b,c的最小公倍数 题解: 直接搞(最近刷水题有点心态爆炸) 参考代码: #include<cstdio> #include ...

  4. Python列表插入字典(转)

    https://blog.csdn.net/qq_29721419/article/details/70310183

  5. CSS的水平居中和垂直居中解决方案

    在写CSS样式的时候,有时为了美观,会添加水平居中和垂直居中,这时候你有可能会遇到很棘手的问题,有些水平居中和垂直居中的属性添加上去完全没反应,下面给大家列举一些CSS水平居中和垂直居中的终极解决方案 ...

  6. phpMyAdmin出现找不到mysql扩展和Cannot log in to the MySQL server问题

    环境:Centos6.5,Apache2.4, PHP5.5, MySql5.6. phpMyAdmin版本:https://files.phpmyadmin.net/phpMyAdmin/4.4.1 ...

  7. Dom4j 查找节点或属性

    Dom4j  查找节点或属性 例如 1 查找下面xml中的student节点的age属性, xpathstr="/students/student/@age"; 2 查找下面xml ...

  8. JS取出两个数组的不同或相同元素

    JS合并两个数组的方法 我们在项目过程中,有时候会遇到需要将两个数组合并成为一个的情况.比如: var a = [1,2,3]; var b = [4,5,6]; 有两个数组a.b,需求是将两个数组合 ...

  9. 【Django】模板系统

    目录 一.变量 二.过滤器 Filters 2. length 3. filesizeformat 4. slice 5. add 6. first.last 7. join 8. truncatec ...

  10. 今日SGU 5.16

    SGU 119 题意:给你N.A0.B0,然后问所有X.Y,若A0X+B0Y能被N整除,则AX+BY也能被N整除,求所有的A.B.(0<=A.B<N) 收获:枚举 因为a0x+b0y=k1 ...