博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
RQP-DEF-0177
阅读量:4116 次
发布时间:2019-05-25

本文共 1518 字,大约阅读时间需要 5 分钟。

Problem(Abstract)

User attempts to run any Controller 'standard report' (also known as 'system report'), for example 'Reconcile - Between Accounts/Opening Balances (Preview)'.

User receives error message.

Symptom

Reconcile - Between Accounts/Opening Balances (Preview)

Cognos 8

RQP-DEF-0177
An error occurred while performing operation 'sqlOpenResult' status='-28'
Details
UDA-SQL-0114 The cursor supplied to the operation "sqlOpenResult" is inactive. UDA-SOR-0001 Unable to
allocate memory. RSV-SRV-0042 Trace back: RSReportService.cpp(595): QFException: CCL_CAUGHT:
RSReportService::process() RSReportServiceMethod.cpp(177)....

Cause

The Controller application server has run out of Windows memory. Therefore, the IBM Cognos 8 BI 'reporting' engine cannot process the report correctly.

There are many potential causes for this lack of memory, but if you are running an old/out-of-date version of Controller, it is possible that your system is suffering from a memory leak.

Resolving the problem

Immediate Fix

Ensure all Controller users out of the system. Reboot Controller application server.
Long-term Solution
Optimise the Cognos 8 BI reporting service environment, by:

  1. Ensure that Controller product is upgraded to latest release, to take advantage of memory leak fixes, such as those described inside IBM Technotes #1347915, 1367340 & 1365078.
  2. Afterwards, if the problem persists, follow the advice inside separate IBM Technote articles #1341779, 1021723 & 1032429.

Related information

Historical Number

1037276

转载地址:http://urdpi.baihongyu.com/

你可能感兴趣的文章
Valid Parentheses --括号匹配
查看>>
Remove Element--原地移除重复元素
查看>>
Remove Duplicates from Sorted Array--从有序数组中移除重复元素
查看>>
Count and Say
查看>>
Gas Station
查看>>
Palindrome Partitioning --回文切割 深搜(重重)
查看>>
Valid Palindrome 简单的回文判断
查看>>
Pascal's Triangle -- 生成杨辉三角
查看>>
Pascal's Triangle II 生成杨辉三角中的某行
查看>>
Minimum Depth of Binary Tree -- 二叉树的最小深度 DFS 加剪枝
查看>>
Climbing Stairs 爬楼梯方法 动态规划
查看>>
Merge Two Sorted Lists 合并两个有序链表
查看>>
pow(x,n) 为什么错这么多次
查看>>
Jump Game 动态规划
查看>>
Binary Tree Maximum Path Sum 自底向上求解(重重重重)
查看>>
Subsets 深搜
查看>>
Subsets II
查看>>
Edit Distance 字符串距离(重重)
查看>>
Gray Code 格雷码
查看>>
对话周鸿袆:从程序员创业谈起
查看>>