Fuzzy searching and concatenated datastore query performance problems.

I am using the concatenated datastore and indexing two columns.
The query I am executing includes an exact match on one column and a fuzzy match on the second column.
When I execute the query, performance should improve as the exact match column is set to return less values.
This is the case when we execute an exact match search on both columns.
However, when one column is an exact match and the second column is a fuzzy match this is not true.
Is this normal processing??? and why??? Is this a bug??
If you need more information please let me know.
We are under a deadline and this is our final road block.
TIA
Colleen GEislinger

I see that you have posted the message in the Oracle text forum, good! You should get a better, more timely answer there.
Larry

Similar Messages

Concatenated datastore fuzzy searches and performance...

Oracle 8.1.7:
I am using the concatenated datastore and indexing two columns.
The query I am executing includes an exact match on one column and a fuzzy match on the second column.
When I execute the query, performance should improve as the exact match column is set to return less values.
This is the case when we execute an exact match search on both columns.
However, when one column is an exact match and the second column is a fuzzy match this is not true.
Is this normal processing??? and why??? Is this a bug??
If you need more information please let me know.
We are under a deadline and this is our final road block.
TIA
Colleen GEislinger

This is more information about our scenario:
We have two groups in the datastore:
concat:
1.) hierarchy:(example text) 321826 325123 543123
2.) page: Actual document text.
321826 325123 543123 represents ids in a hierarchy structure. As you move from left to right the number of times the number occurs is less so there should be less exact matches.
Example: In this index all pages have 321826 as the first value. A few pages have 543123 and all others will have some other number as the last value.
if I do this query:
contains(concat,(321826 within hierarchy ) and ('personnel') within page)
it takes about 10 seconds because it 321826 will hit all pages.
if I do this query:
contains(concat,(543123 within hierarchy ) and ('personnel') within page)
it takes only about 1 second because it 543123 will hit just a few pages.
BUT:::::::
Fuzzy search....
if I do this query:
search A.) contains(concat,(321826 within hierarchy ) and ?('personnel') within page)
it takes about 30 seconds because it 321826 will hit all pages. This is okay for performance for this.
BUT if I do this query:
search B.) contains(concat,(543123 within hierarchy ) and ?('personnel') within page)
it takes about 30 seconds even though 543123 will hit only a few pages.
This should be faster than 30 seconds because you're searching over only a fraction of material for the fuzzy search part.
We've played with different variations on the () and the '' but nothing seems to change this.
Any advice on how to make search B.) faster??
We don't understand why see the different speeds in the exact match and we DON'T see the different speeds in the fuzzy search...
I can send you some test data with the index and query scripts if you want.
Our indexes are on large tables (2,000,000) rows.
TIA
Colleen Geislinger.

Query performance problem - events 2505-read cache and 2510-write cache

Hi,
I am experiencing severe performance problems with a query, specifically with events 2505 (Read Cache) and 2510 (Write Cache) which went up to 11000 seconds on some executions. Data Manager (400 s), OLAP data selection (90 s) and OLAP user exit (250 s) are other the other event with noticeable times. All other events are very quick.
The query settings (RSRT) are
persistent cache across each app server -> cluster table,
update cache in delta process is checked ->group on infoprovider type
use cache despite virtual characteristics/key figs checked (one info-cube has1 virtual key figure which should have a static result for a day)
=>Do you know how I can get more details than what's in 0TCT_C02 to break down the read and write cache events time or do you have any recommandation?
I have checked and no dataloads were in progres on the info-providers and no master data loads (change run). Overall system performance was acceptable for other queries.
Thanks

Hi,
Looks like you're using BDB, not BDB JE, and this is the BDB JE forum. Could you please repost here?:
Berkeley DB
Thanks,
mark

Query performance problem

I am having performance problems executing a query.
System:
Windows 2003 EE
Oracle 9i version 9.2.0.6
DETAIL table with 120Million rows partitioned in 19 partitions by SD_DATEKEY field
We are trying to retrieve the info from an account (SD_KEY) ordered by date (SD_DATEKEY). This account has about 7000 rows and it takes about 1 minute to return the first 100 rows ordered by SD_DATEKEY. This time should be around 5 seconds to be acceptable.
There is a partitioned index by SD_KEY and SD_DATEKEY.
This is the query:
SELECT * FROM DETAIL WHERE SD_KEY = 'xxxxxxxx' AND ROWNUM < 101 ORDER BY SD_DATEKEY
The problem is that all the 7000 rows are read prior to be ordered. I think that it is not necessary for the optimizer to access all the partitions to read all the rows because only the first 100 are needed and the partitions are bounded by SD_DATEKEY.
Any idea to accelerate this query? I know that including a WHERE clause for SD_DATEKEY will increase the performance but I need the first 100 rows and I don't know the date to limit the query.
Anybody knows if this time is a normal response time for tis query or should it be improved?
Thank to all in advance for the future help.

Thank to all for the replies.
- We have computed statistics and no changes in the response time.
- We are discussing about restrict the query to some partitions but for the moment this is not the best solution because we don't know where are the latest 100 rows.
- The query from Maurice had the same response time (more or less)
select * from
(SELECT * FROM DETAIL WHERE SD_KEY = 'xxxxxxxx' ORDER BY SD_DATEKEY)
where ROWNUM < 101
- We have a local index on SD_DATEKEY. Do we need another one on SD_KEY? Should it be created as BITMAP?
I can't test inmediately your sugestions because this is a problem with one of our customers. In our test system (that has only 10Million records) the indexes accelerate the query but this is not the same in the customer system. I think the problem is the total records on the table.

Query Performance Problem!! Oracle 25 minutes || SQLServer 3 minutes

Hi all,
I'm having a performance problem with this query bellow. It runs in 3 minutes on SQLServer and 25 minutes in Oracle.
SELECT
CASE WHEN (GROUPING(a.estado) = 1) THEN 'TOTAL'
ELSE ISNULL(a.estado, 'UNKNOWN')
END AS estado,
CASE WHEN (GROUPING(m.id_plano) = 1) THEN 'GERAL'
ELSE ISNULL(m.id_plano, 'UNKNOWN')
END AS id_plano,
sum(m.valor_2s_parcelas) valor_2s_parcelas,
convert(decimal(15,2),convert(int,sum(convert(int,(m.valor_2s_parcelas+.0000000001)*100)*
isnull(e.percentual,0.0))/100.0+.0000000001))/100 BB_Educar
FROM
movimento_dco m ,
evento_plano e,
agencia_tb a
WHERE
m.id_plano = e.id_plano
AND m.agencia *= a.prefixo
--AND m.id_plano LIKE 'pm60%'
AND m.data_pagamento >= '20070501'
AND m.data_pagamento <= '20070531'
AND m.codigo_retorno = '00'
AND m.id_parcela > 1
AND m.valor_2s_parcelas > 0.
AND e.id_evento = 'BB-Educar'
AND a.banco_id = '001'
AND a.ordem = '00'
group by m.id_plano, a.estado WITH ROLLUP
order by a.estado, m.id_plano DESC
Can anyone help me with this query?

What version of Oracle, what version of SQL? Are the tables the same exact size? are they both indexed the same? Are you running on the some or similar hardware? Are the Oracle parameters similar like SGA size and PGA_AGGREGATE Target? Did you run statistics in Oracle?
Did you compare execution plans in SQL Server vs Oracle to see if SQl Servers execution plan is more superior than the one Oracle is trying to use? (most likely stale statistics).
There are many variables and we need more information than just the Query : ).

Structures Vs RKFs and CKFs In Query performance

Hi Gurus,
I am creating a GL query which will be returning with a couple of KFs and some calculations as well with different GL accounts and I wanted to know which one is going to be more beneficial for me either to create Restricted keyfigures and Calculated Keyfigures or to just use a structure for all the selections and formula calculations?
Which option will be better for query performance?
Thanks in advance

As compared to formulas that are evaluated during query execution, calculated key figures are pre-calculated and their definitions are stored in the metadata repository for reuse in queries. The incorporation of business metrics and key performance indicators as calculated key figures, such as gross profit and return on investment (which are frequently used, widely understood, and rarely changed), improve query performance and ensure that calculated key figures are reported consistently by different users. Note that this approach improves query runtime performance but slows InfoCube or ODS object update time. As a rule of thumb, if multiple and frequently used queries use the same formula to compute calculated fields, use calculated key figures instead of formulas.
RKFs result in additional database processing and complexity in retrieving the query result and therefore should be avoided when possible.

Adding existing field to a UI Search and Modifying UI Query

Hello.
I want to add the "central archiving flag" to the Contact search BP_CONT_SEARCH/Search. I've added the field into the SEARCH node via BSP_WD wizard but the field created does not appear as available in the Search because it is not into the context structure. ¿Is there any solution to this? ¿I must append a new field to the standard structure?
Although I get the "archiving flag" available I think I will need to modify the selection query ¿Is that possible? If it's possible ¿How can I do it?
I have another problem with a result field of another search for activities (BT126S_APPT/ApptSR). I would like to know how can I reach the selection ( based on BOL result model BTQRAct ) and how can I modify that selection/quety.
Thanks in advance.
Kind regards.

You can create a copy of the standard design layer, add your field and define it as dropdown listbox 0 coding is required
Otherwise you will need to code in the GET_V method and the GET_P, there's a lot of information about this if you have a little of patience to search
If fits your requirement (dropdown listbox) I would go for the design layer approach, of course there's info about this through scn too

Query performance problem when using hierarchies

Hello All,
I've a query which is built on a hieracrhy with the following structure for eg.
A
|_B
| |_L1
|
|_C
|_L2
When I restrict the query to hierarchy levels B and C simultaneously the query executes fine. But when i directly restrict the query to heirarchy level A , the query runs endlessly.
Could some one please help me out as to why this is the case ?
I don't have aggregates built on any of the hierarchy level.
Best Regards,
Sanjay

Hi Roberto,
thanks for your response. However, the problem is not solved even after applying the suggestions of the note 738098 :(. These queries used to execute fine until yesterday and there have been no major additions to the hierarchy. Please let me know if there is any thing else that can be done. We are planning to bounce the system and see if there are any performance improvements.
PS: I've awarded points to you nevertheless, as the option suggested in the note seems useful and should be tried in case of these kind of performance issues
Best Regards,
Sanjay

Query Performance problem after upgrade from 8i to 10g

Following query takes longer time in 10g.
SELECT LIC_ID,FSCL_YR,KEY_NME,CRTE_TME_STMP,REMT_AMT,UNASGN_AMT,BAD_CK_IND,CSH_RCPT_PARTY_ID,csh_rcpt_id,REC_TYP,XENT_ID,CLNT_CDE,BTCH_CSH_STA,file_nbr,
lic_nbr,TAX_NBR,ASGN_AMT FROM (
SELECT /*+ FIRST_ROWS*/
cpty.lic_id,
cpty.clnt_cde,
cpty.csh_rcpt_party_id,
cpty.csh_rcpt_id,
cpty.rec_typ,
cpty.xent_id,
cr.fscl_yr,
cbh.btch_csh_sta,
nam.key_nme,
lic.file_nbr,
lic.lic_nbr,
cr.crte_tme_stmp,
cr.remt_amt,
cr.unasgn_amt,
ee.tax_nbr,
cr.asgn_amt,
cr.bad_ck_ind
FROM lic lic
,csh_rcpt_party cpty
,name nam
,xent ee
,csh_rcpt cr
,csh_btch_hdr cbh
WHERE 1 = 1
AND ee.xent_id = nam.xent_id
AND cbh.btch_id = cr.btch_id
AND cr.csh_rcpt_id = cpty.csh_rcpt_id
AND ee.xent_id = cpty.xent_id
AND cpty.lic_id = lic.lic_id(+)
AND (cpty.clnt_cde IN ( SELECT clnt_cde
FROM clnt
START WITH clnt_cde = '4006'
CONNECT BY PRIOR clnt_cde_prnt = clnt_cde)
OR cpty.clnt_cde IS NULL)
AND nam.cur_nme_ind = 'Y'
AND nam.ent_nme_typ = 'P' AND nam.key_nme LIKE 'WHITE%')
order by lic_id
Explain Plan in 8i
0 SELECT STATEMENT Optimizer=HINT: FIRST_ROWS (Cost=17 Card=1
Bytes=107)
1 0 FILTER
2 1 NESTED LOOPS (Cost=17 Card=1 Bytes=107)
3 2 NESTED LOOPS (Cost=15 Card=1 Bytes=101)
4 3 NESTED LOOPS (OUTER) (Cost=13 Card=1 Bytes=73)
5 4 NESTED LOOPS (Cost=11 Card=1 Bytes=60)
6 5 NESTED LOOPS (Cost=6 Card=1 Bytes=35)
7 6 INDEX (RANGE SCAN) OF 'NAME_WBSRCH1_I' (NON-UN
IQUE) (Cost=4 Card=1 Bytes=26)
8 6 TABLE ACCESS (BY INDEX ROWID) OF 'XENT' (Cost=
2 Card=4649627 Bytes=41846643)
9 8 INDEX (UNIQUE SCAN) OF 'EE_PK' (UNIQUE) (Cos
t=1 Card=4649627)
10 5 TABLE ACCESS (BY INDEX ROWID) OF 'CSH_RCPT_PARTY
' (Cost=5 Card=442076 Bytes=11051900)
11 10 INDEX (RANGE SCAN) OF 'CPTY_EE_FK_I' (NON-UNIQ
UE) (Cost=2 Card=442076)
12 4 TABLE ACCESS (BY INDEX ROWID) OF 'LIC' (Cost=2 Car
d=3254422 Bytes=42307486)
13 12 INDEX (UNIQUE SCAN) OF 'LIC_PK' (UNIQUE) (Cost=1
Card=3254422)
14 3 TABLE ACCESS (BY INDEX ROWID) OF 'CSH_RCPT' (Cost=2
Card=6811443 Bytes=190720404)
15 14 INDEX (UNIQUE SCAN) OF 'CR_PK' (UNIQUE) (Cost=1 Ca
rd=6811443)
16 2 TABLE ACCESS (BY INDEX ROWID) OF 'CSH_BTCH_HDR' (Cost=
2 Card=454314 Bytes=2725884)
17 16 INDEX (UNIQUE SCAN) OF 'CBH_PK' (UNIQUE) (Cost=1 Car
d=454314)
18 1 FILTER
19 18 CONNECT BY
20 19 INDEX (UNIQUE SCAN) OF 'CLNT_PK' (UNIQUE) (Cost=1 Ca
rd=1 Bytes=4)
21 19 TABLE ACCESS (BY USER ROWID) OF 'CLNT'
22 19 TABLE ACCESS (BY INDEX ROWID) OF 'CLNT' (Cost=2 Card
=1 Bytes=7)
23 22 INDEX (UNIQUE SCAN) OF 'CLNT_PK' (UNIQUE) (Cost=1
Card=1)
Explain Plan in 10g
0 SELECT STATEMENT Optimizer=HINT: FIRST_ROWS (Cost=19 Card=1
Bytes=112)
1 0 SORT (ORDER BY) (Cost=19 Card=1 Bytes=112)
2 1 FILTER
3 2 NESTED LOOPS (Cost=18 Card=1 Bytes=112)
4 3 NESTED LOOPS (Cost=16 Card=1 Bytes=106)
5 4 NESTED LOOPS (OUTER) (Cost=14 Card=1 Bytes=78)
6 5 NESTED LOOPS (Cost=12 Card=1 Bytes=65)
7 6 NESTED LOOPS (Cost=6 Card=1 Bytes=34)
8 7 INDEX (RANGE SCAN) OF 'NAME_WBSRCH1_I' (INDE
X) (Cost=4 Card=1 Bytes=25)
9 7 TABLE ACCESS (BY INDEX ROWID) OF 'XENT' (TAB
LE) (Cost=2 Card=1 Bytes=9)
10 9 INDEX (UNIQUE SCAN) OF 'EE_PK' (INDEX (UNI
QUE)) (Cost=1 Card=1)
11 6 TABLE ACCESS (BY INDEX ROWID) OF 'CSH_RCPT_PAR
TY' (TABLE) (Cost=6 Card=1 Bytes=31)
12 11 INDEX (RANGE SCAN) OF 'CPTY_EE_FK_I' (INDEX)
(Cost=2 Card=4)
13 5 TABLE ACCESS (BY INDEX ROWID) OF 'LIC' (TABLE) (
Cost=2 Card=1 Bytes=13)
14 13 INDEX (UNIQUE SCAN) OF 'LIC_PK' (INDEX (UNIQUE
)) (Cost=1 Card=1)
15 4 TABLE ACCESS (BY INDEX ROWID) OF 'CSH_RCPT' (TABLE
) (Cost=2 Card=1 Bytes=28)
16 15 INDEX (UNIQUE SCAN) OF 'CR_PK' (INDEX (UNIQUE))
(Cost=1 Card=1)
17 3 TABLE ACCESS (BY INDEX ROWID) OF 'CSH_BTCH_HDR' (TAB
LE) (Cost=2 Card=1 Bytes=6)
18 17 INDEX (UNIQUE SCAN) OF 'CBH_PK' (INDEX (UNIQUE)) (
Cost=1 Card=1)
19 2 FILTER
20 19 CONNECT BY (WITH FILTERING)
21 20 TABLE ACCESS (BY INDEX ROWID) OF 'CLNT' (TABLE) (C
ost=2 Card=1 Bytes=15)
22 21 INDEX (UNIQUE SCAN) OF 'CLNT_PK' (INDEX (UNIQUE)
) (Cost=1 Card=1)
23 20 NESTED LOOPS
24 23 BUFFER (SORT)
25 24 CONNECT BY PUMP
26 23 TABLE ACCESS (BY INDEX ROWID) OF 'CLNT' (TABLE)
(Cost=2 Card=1 Bytes=7)
27 26 INDEX (UNIQUE SCAN) OF 'CLNT_PK' (INDEX (UNIQU
E)) (Cost=1 Card=1)
28 20 TABLE ACCESS (FULL) OF 'CLNT' (TABLE) (Cost=5 Card
=541 Bytes=5951)
Explain plan looks different in steps 19 to 28. I am not sure why 10g have more steps

Hi
I have no experience in 8i. I do know 10g does costing different from 8i. So I think the other plan might got elliminated.
Normally when I see differences. I just collect statistics on the tables and the indexes and remove the hints. Hints are not good . This has helped me to solve few problems.
Thanks
CT

Spatial query performance problem after upgrade to 10G

I am in the process of converting my database from a 9i box to a new 10G 64-bit box. But I have found a problem which is causing some reports to be slower on the new box. I have simplified the queries down to having the user_sdo_geom_metadata table joined to use the diminfo in the queries (I know that I am not using them in these queries, but I simplified for testing purposes...)
If I run the following I get and look at the explain plan I get full table scans for both spatial tables and index lookups for the user_sdo_geom_metadata table queries and runs for about 14 seconds.
SELECT ROWNUM
from COUNTIES s,
NOMINATIONS O,
(select diminfo from user_sdo_geom_metadata where table_name='COUNTIES') S_DIM,
(select diminfo from user_sdo_geom_metadata where table_name='NOMINATIONS') O_DIM
where sdo_filter(S.GEOM,o.geom, 'querytype=WINDOW')='TRUE'
and sdo_geom.within_distance(o.geom,0,S.GEOM,.5)='TRUE';
If I just remove the two user_sdo_geom_metadata joins, I get spatial index usage on COUNTIES and the whole thing runs in less that a second.
SELECT ROWNUM
from COUNTIES s,
NOMINATIONS O
where sdo_filter(S.GEOM,o.geom, 'querytype=WINDOW')='TRUE'
and sdo_geom.within_distance(o.geom,0,S.GEOM,.5)='TRUE';
I have rebuilt the indexes, gathered stats, and tried hints to force the first query to use the spatial index. None of which made any change.
Has anyone else seen this?
Gerard Vidrine

Hi Gerard,
When the query window comes from a table Oracle always recommends:
1) Use the /*+ ordered */ hint
2) Put the table the quiery window comes from (geometry-2 in the query) first in the from clause
However, your query is also written very strange. Do you know about SDO_WITHIN_DISTANCE? Or are you trying to do SDO_ANYINTERACT (since the distance is 0)?
So I would write the query you have as:
SELECT s.ROWNUM
from NOMINATIONS O, COUNTIES s
where sdo_relate(S.GEOM,o.geom, 'querytype=WINDOW mask=anyinteract')='TRUE';
or in Oracle10g:
SELECT s.ROWNUM
from NOMINATIONS O, COUNTIES s
where sdo_anyinteract(S.GEOM,o.geom)='TRUE';

Spatial query performance problems

In preparation for making using of spatial data in our oracle database, I wanted to create a view (materialised) that brings together data from a few different tables into one place ready for publishing as a WMS layer.
I'm being stumped at first base by crippling performance of Oracle spatial function. Later joins of ordinary fields are ok, but the spatial joining of two tables using the following sql runs for an absurd length of time (i've given up - I don't know how long it actually takes only that it takes far too long)
SELECT /*+ ordered */
lg.GRIDREF, lg.SYSTEM, lg.PARENT, lg.TYPE,
lrd.REGION_CODE
FROM TABLE (SDO_JOIN('L_GRIDS','BOUNDARY','L_REGION_DEFINITION','BOUNDARY','mask=COVERS')) c,
L_GRIDS lg, L_REGION_DEFINITION lrd
WHERE c.rowid1 = lg.rowid AND c.rowid2 = lrd.rowid
ORDER BY lrd.REGION_CODE
Both tables have spatial indexs. L_REGION_DEFINITION contains 200 rows with complex boundaries stored as spatial objects. L_GRIDS contains 475,000 rows, each with a trivially simple spatial object consisting of a square polygon of 4 points.
The database is 10g patched to latest. The server is dual quad Xeon processors with 16gb of ram. I didn't expect it to be a lightning query, but surely it should be usable?
Any ideas?

Try to upgrade to at least 11.2.0.2 and use the following query
SELECT /*+ leading(lrd lg) */
lg.GRIDREF, lg.SYSTEM, lg.PARENT, lg.TYPE,
lrd.REGION_CODE
FROM L_GRIDS lg, L_REGION_DEFINITION lrd
WHERE sdo_relate(lg.boundary, lrd.boundary, 'mask=COVEREDBY') = 'TRUE'
ORDER BY lrd.REGION_CODE;
And since not sure about your query's intention, maybe it is "mask=INSIDE+COVEREDBY",
please check out oracle spatial developer guide for details about different masks.

Physical query (performance)problem in obiee11.1.1.6.8

Hi all,
i have built same Logical model for sql server database and Oracle database.i have performance issue in sql server where as it not showing the filter in physical query(nqs query log) hitting the DB of SQL server( so its taking more time to respond) but same model i m using for oracle Db its passing the physical query with filter to oracle DB (it is not taking more time )to respond in obiee11.1.1.6.8
Please help me

Can you run the same query on Physical SQL Server DB and let us know the outcome ?
Thanks,

Mdx Query performance problem

Hi
Is there any way to control the performance of Mdx expressions that use the Filter function? The following Mdx statement is an example of a query we are generating to return filtered characteristic values for users to make selections for variables.
Note: It is intentional that the column axis is not populated as we are interested only in the returned characteristic values.
SELECT {} N COLUMNS,
Order(
 Filter(
 {[ZPLANTYPE].[All].Children},
 (([ZPLANTYPE].CurrentMember.Name >= 'a' AND [ZPLANTYPE].CurrentMember.Name < 'b') OR
 ([ZPLANTYPE].CurrentMember.Name >= 'A' AND [ZPLANTYPE].CurrentMember.Name < 'B'))
 [ZPLANTYPE].CurrentMember.Name, BASC
) ON ROWS FROM [$IC_FLT]
In a real example with 162,000 charateristics this query is taking up to 5 minutes to run - clearly unacceptable as part of a user interface. It appears that behind the scenes a sequential read of the underlying dimesnion table is being carried out.
It is difficult to create a more sophisticated query due to the lack of string handling logic in the raw Mdx language.

Hi,
I have been through the queries, and understand that the "_MSCM1" is being aggregated across Product and Paid Amount from the query extract below:
member [Accounts].[_MSCM1] as 'AGGREGATE({[_Product2]}, [Accounts].[Paid Amount])'
If I am getting it right, there is an aggregation rule missing for [Paid Amount] (I think that's the reason, the query is to aggregate _MSCM1 by "Paid Amount" ie just like any other dimension).
Could you please check this once and this is why I think BI is generating two queries? I am sorry, if I got this wrong.
Hope this helps.
Thank you,
Dhar

Query, Performance Problem in apex

Hi All,
I am using
select address1,address2,address3,city,place,pincode,siteid,bpcnum_0, contactname,fax,mobile,phone,website,rn from (select address1,address2,address3,city,place,pincode,siteid,bpcnum_0, contactname,fax,mobile,phone,website,dense_rank() over(order by contactname,address1)as rn, row_number() over (partition by contactname, address1 order by contactname, address1) as rn1 from vw_sub_cl_add1 where siteid=v('P10_SITENO') and bpcnum_0 = v('P10_CLNO')) emp where rn1 =1 and rn >= v('P10_RN')
the above query to extract the details from a view, in a pl/sql region
pagination is also working fine.
ie only 4 records at a time will get displayed.
Problem is
it is taking 1min and 5 seconds to display, next set of records.
please, could any tell me how to reduce the time of rendering the page.?
Thanks in advance
bye
Srikavi

If it's really true, that when using bind variables the query is fast, than can you rewrite your query in your application to use bind variables?
Try to rewrite your query to use :P10_SITENO instead of v('P10_SITENO') etc. where possible.
You can find more details at Patrick Wolf's blog http://www.inside-oracle-apex.com/2006/12/drop-in-replacement-for-v-and-nv.html

New HP EVA6000 SAN and now bad database performance problems

Hello,
we changed our SAN Hardware to a HP EVA6000 and moved all Data to there.
It is intended that storagesystem is for all Servers (File/Print, Exchange, Oracle Databases and MSSQL Databases).
According to the best practice papers of HP we created one big discgroup (fata harddiscs) and created virtual discs for our servers.
After doing this the database performance was terrible bad!
Especially the multiple random IO is absolutely worse.
As a first countermeasure we created a second discgroup on faster harddiscs and moved the database contents to there. We analyzed the IO and moved several database file to different virtual discs.
The performance is better now, but still not like the 4 year old SAN System!
Of course we questioned HP and even let them do a performance analysis but up to now we have no solution... The performance analysis report will be available on thursday.
Does anybody had the same experience or how did you configure the Database and EVA SAN to work with an appropiate performance?

Hi,
I'm not an Oracle person, but do work with EVA SAN's.
Your 48 FATA disk, disk group is capable of 4800 I/O operations per second [48 x 100] but the disks are only rated for 30% duty cycle and spin at 7200 rpm.
The 16 FC drive Disk Group I/O operations rating depends on the speed the disks spin at. 10K rpm disks are rated at 130 I/O per sec [2080 for the group] and if they are 15K rpm disks then 170 I/O per sec [2720 for the group]. Both are rated for 100% duty cycle.
I seem to recall having have read somewhere that Oracle prefers to have it's logs on separate storage to it's data.
If your shelves had the spare disk slots I would put in 72 GB 15K rpm disks up to the capacity required {+ overhead } + head room for reasonably predictable growth over the anticpated life of the equipment.
Here is a link to the HP Best Practice guide for EVA 4/6/8000's
http://h71028.www7.hp.com/ERC/downloads/4AA0-2787ENW.pdf
I hope this helps you understand the storage that you are working with a bit better. The old saying of "more heads make for better performance" is still true, however budget can have some affect in performance. ;-)
Jim

Fuzzy searching and concatenated datastore query performance problems.

Similar Messages

Maybe you are looking for