首页 > 其他分享 >ORA-00600: [rworupo.1], [34], [32]

ORA-00600: [rworupo.1], [34], [32]

时间:2023-06-04 20:12:38浏览次数:45  
标签:rworupo.1 00600 DBMS 34 SYS line 06512 ORA

环境信息

操作系统:windows 2019
ORACLE:11.2.0.1
补丁情况:无

故障现象

手动收集用户统计信息时提示ora-00600错误,具体信息如下

SQL> exec dbms_stats.gather_schema_stats(ownname=>'CS',granularity=>'ALL',estimate_percent=>10,method_opt=>'for all indexed columns',cascade=>TRUE,degree=>16);

ORA-00600: internal error code, arguments: [rworupo.1], [34], [32], [], [], [], [], [], [],[], [], []
ORA-06512: 在 "SYS.DBMS_STATS", line 20508
ORA-06512: 在 "SYS.DBMS_STATS", line 20993
ORA-06512: 在 "SYS.DBMS_STATS", line 21073
ORA-06512: 在 "SYS.DBMS_STATS", line 21030
ORA-06512: 在 line 1

经查阅网络资料以及mos文档,确定该错误信息为bug。

mos相关资料

Format: ORA-600 [rworupo.1] [a] [b]
VERSIONS:
  versions 9.0.1 to 11.2

DESCRIPTION:

  This error is raised when the length of a column value in a row which
  we are unpacking from the queue buffer exceeds the length recorded in
  the corresponding operand descriptor.

ARGUMENTS:
  Arg [a] Length of column value
  Arg [b] Length of operand descriptor

FUNCTIONALITY:
  rwoima - RoW Operand vector IMPlementation A

IMPACT:
  PROCESS FAILURE
  NON CORRUPTIVE - No underlying data corruption.

SUGGESTIONS:

  If the Known Issues section below does not help in terms of identifying
  a solution, please submit the trace files and alert.log to Oracle
  Support Services for further analysis.

最终解决办法如下:

#修改会话级别
alter session set "_newsort_enabled"=false;
#修改实例级别
alter system set "_newsort_enabled"=false scope=both;

标签:rworupo.1,00600,DBMS,34,SYS,line,06512,ORA
From: https://www.cnblogs.com/Roobbin/p/17456210.html

相关文章

  • 159.342 操作系统和网络
    159.342-OperatingSystemsandNetworksAssignment#3(dueon11/Jun)MemoryManagementUsingtheBuddySystemStrategyOBJECTIVE:ThemainobjectiveinthisassignmentistoimplementtheBuddySystemmemorymanagementstrategybywritingtwofunctionsthat......
  • leetcode 1341 电影评分
    leetcode1341 电影评分(selectu1.nameasresultsfromUsersu1leftjoin(selectmr1.user_id,count(mr1.rating)asc1fromMovieRatingasmr1groupbymr1.user_idhavingc1=(selectmax(p.c2)fromUsersasu2......
  • 算法学习day41动态规划part03-343、96
    packageLeetCode.DPpart03;/***343.整数拆分*给定一个正整数n,将其拆分为k个正整数的和(k>=2),并使这些整数的乘积最大化。*返回你可以获得的最大乘积。*示例:*输入:n=2*输出:1*解释:2=1+1,1×1=1。**/publicclassIntegerBre......
  • CF101234A Hacker Cups and Balls【二分+线段树】
    Description给一个长度为n的排列,对它做m次操作,每次对[l,r]区间内进行升序/降序排序。问最后的序列处于最中心的数是多少(n为奇数)。Solution是一类没有写过的题,参考题解。二分答案,对于当前的mid,将大于等于mid的数设置为1,小于mid的数设置为0。这样一来,叶结点的值......
  • LeetCode 343.整数拆分
    1.题目:给定一个正整数 n ,将其拆分为k个正整数的和( k>=2 ),并使这些整数的乘积最大化。返回你可以获得的最大乘积 。示例1:输入:n=2输出:1解释:2=1+1,1×1=1。示例 2:输入:n=10输出:36解释:10=3+3+4,3× 3× 4=36。来源:力扣(LeetCo......
  • 1341. 电影评分
    【题目】表:Movies+---------------+---------+|ColumnName|Type|+---------------+---------+|movie_id|int||title|varchar|+---------------+---------+movie_id是这个表的主键。title是电影的名字。表:Users+---------------+---------......
  • 算法学习day34贪心part03-1005、134、135
    packageLeetCode.greedypart03;/***1005.K次取反后最大化的数组和*给你一个整数数组nums和一个整数k,按以下方法修改该数组:*选择某个下标i并将nums[i]替换为-nums[i]。*重复这个过程恰好k次。可以多次选择同一个下标i。*以这种方式修改数组后,返回......
  • 34 KVM管理设备-管理虚拟磁盘
    34KVM管理设备-管理虚拟磁盘34.1概述虚拟磁盘类型主要包含virtio-blk、virtio-scsi、vhost-scsi等。virtio-blk模拟的是一种block设备,virtio-scsi和vhost-scsi模拟的是一种scsi设备。virtio-blk:普通系统盘和数据盘可用,该种配置下虚拟磁盘在虚拟机内部呈现为vd[a-z]或vd[a-z][......
  • leetcode 344. Reverse String
    Writeafunctionthattakesastringasinputandreturnsthestringreversed.Example:Givens="hello",return"olleh".classSolution(object):defreverseString(self,s):""":types:str......
  • leetcode 342. Power of Four
    Givenaninteger(signed32bits),writeafunctiontocheckwhetheritisapowerof4.Example:Givennum=16,returntrue.Givennum=5,returnfalse.Followup:Couldyousolveitwithoutloops/recursion?解法1,经典的数学解法:classSolution(object):def......