Performance problem with Oracle

We are currently getting a system developed in Unix/Weblogic/Tomcat/Oracle environment. We have developed a screen that contains 5 or 6 different parameters to select from. We could select multiple parameters in each of these selections. The idea behind the subsequent screens is to attach information to already existing data/ possible future data that matches the selection criteria.
Based on these selections, existing data located within the system in a table is searched and those that match are selected. Also new rows are created in the table against combinations that do not currently have a match. Frequently multiple parameters are selected, and 2000 different combinations need to be searched in the table. Of these selections, only about 100 or 200 combinations will be available in existing data. So the system is having to insert 1800 rows. The user meanwhile waits for the system to come up with data based on their selections. The user is not willing to wait more than 30 seconds to get to the next screen. In the above mentioned scenario, the system takes more than an hour to insert the new records and bring the information up. We need suggestions to see if the performance can be improved this drastically. If not what are the alternatives? Thanks

The #1 cause for performance problems with Oracle is not using it correctly.
I find it hard to believe that with the small data volumes mentioned, that you can have perfornance problems.
You need to perform a sanity check. Are you using Oracle correctly? Do you know what bind variables are? Are you using indexes correctly? Are you using PL/SQL correctly? Is the instance setup correctly? What about storage, are you using SAME (RAID10) or something else? Etc.
Facts. Oracle peforms exceptionally well. Oracle exceptionally well.
Simple example from a benchmark I did on this exact same subject. App-tier developers not understanding and not using Oracle correctly. Incorrect usage of Oracle doing a 100,000 SQL statements. 24+ minutes elapsed time. Doing those exact same 100,000 SQL statement correctly (using bind variables) - 8 seconds elapsed time. (benchmark using Oracle 10.1.0.3 on a Sunfire V20z server)
But then you need to use Oracle correctly. Are you familiar with the Oracle Concepts Guide? Have you read the Oracle Application Developer Fundamentals Guide?

Similar Messages

SAP Performance Problem with Oracle 10 on Sun SPARC T5240 server

Dear Friends,
We have a performance problem after migrating our SAP ERP 6.0 basis system. We moved to new servers a month ago.
According to SAP EarlyWatchAlert Report, CPU response time is too high, altough CPU utilization is never more than 5%,
The current system is :
Database server : Sun SPARC Enterprise T5240 Server - 2 CPU´s with 6 core, 8 thread, 1.2 Ghz 32 GB RAM
and we use another identical configured server as an application server.
Database is Oracle 10.2.0 and operating system is Solaris 10.
The problem is average CPU response time is 450 ms, and max. CPU load is %5 percent.
Pre-migration configuration with old servers, we had CPU response : 150 ms and max CPU load: 50%.
Old configuration : 2 X HP rp3440, 2 X PA 8800 CPU (2 core, 1.0 GHz).
Have you got any experience with a similar situation, which setting might be wrong for not fully utilizing server CPU´s?
or do you know any similar configuration for benchmark?
Thanks in advance
Uzan

Our organization upgraded an application - The vendor had originally suggested a T2000. When we finally migrated onto it, the performance was worse than the older version of the application. The vendor hadn't yet tested the combination of T2000 and 10.2 with their application when they had made that hardware recommendation, they subsequently revised their recommendations. We ended up with an M4000.
The application performance, IMHO, still stinks. But that's because it's a java based application written for database independence.
The interesting item to note here, is that in the application teams 'selective' testing - everything worked fine. When the testing was extended to include users who didn't follow the 'test plan', they found performance begin to tank. Then with more users, more testing, they found that the T2000 was not going to perform well. The test plan by the apps team was not sufficient to find the issues, and they did not include any load testing!
Edited by: dbtoo on Jun 5, 2009 11:20 AM

Performance problems with Oracle 9.2.0.2 Database with optimizer_mode=RULE

If I make an explain plan for a query of the following form:
SELECT a.*
FROM a, b
WHERE a.pk = b.fk
AND b.pk IN (1, 2);
the explain plan states, that a FULL-TABLE-SCAN on table b is performed and a HASH-JOIN is done to execute the query.
On 8.0.6 Database the Indexes on the tables are used and a NESTED-LOOP join is performed.
Why is the 9.2.0.2 Database using HASH-JOINS when the Database is explicitly set to optimizer_mode=RULE, as I think HASH-JOINS are only possible with CBO?
How can I force the 9.2.0.2 database to perform exactly like the 8.0.6 database with RBO?

some options:
set the hash_join_enabled parameter to false in the init.ora file.
set the compatible parameter to 8.0 in the init.ora file.
documentation:
HASH_JOIN_ENABLED specifies whether the optimizer should consider using a
hash join as a join method. When set to FALSE, hash join is turned off; that is, it is
not available as a join method that the optimizer can consider choosing. When set to
TRUE, the optimizer will compare the cost of a hash join to other types of joins, and
choose it if it gives the best cost.
COMPATIBLE allows you to use a new release, while at the same time guaranteeing
backward compatibility with an earlier release. This is in case it becomes necessary
to revert to the earlier release. This parameter specifies the release with which the
Oracle server must maintain compatibility. Some features of the current release may
be restricted.

Performance problem with Orcacle / Crystal reports 8.5 / ASP

Hi,
I have a performance problem with reports running crystal reports 8.5 with oracle databases.
Fetching data appears to be slow. Oracle trace reports (tkprof) shows that fetchsize=1.
Fetchsize in Oracle ODBC is 15 (default).
How can I update te fetchsize in crystal reports?
I would appreciate any help.

CR XI R2 is also still available for purchase. This is the last version of CR to use the RDC. Contact sales at 866-681-3435.
Make sure the installed versin is 11.5.12.1838 - if it is not, apply SP6:
https://smpdl.sap-ag.de/~sapidp/012002523100015859952009E/crxir2win_sp6.exe
MSM:
https://smpdl.sap-ag.de/~sapidp/012002523100000634032010E/crxir2sp6_rdc_mm.zip
- Ludek
Edited by: Ludek Uher on Jan 4, 2011 10:05 AM

Performance problem with ojdbc14.jar

Hi,
We are having performance problem with ojdbc14.jar in selecting and updating (batch updates) entries in a table. The queries are taking minutes to execute. The same java code works fine with classes12.zip ans queries taking sub seconds to execute.
We have Oracle 9.2.0.5 Database Server and I have downloaded the ojdbc14.jar from Oracle site for the same. Tried executing the java code from windows 2000, Sun Solaris and Opteron machines and having the same problem.
Does any one know a solution to this problem? I also tried ojdbc14.jar meant for Oracle 10g, that did not help.
Please help.
Thanks
Yuva

My code is doing some thing which might be working well with classes12.zip and which does not work well with ojdbc14.jar? Any general suggestions to make the code better, especially for batch updates.
But for selecting a row from the table, I am using index columns in the where cluase. In the code using PreparedStatement, setting all the reuired fields. Here is the code. We have a huge index with 14 fields!!. All the parameters are for where clause.
if(longCallPStmt == null) {
longCallPStmt = conn.prepareStatement(longCallQuery);
log(Level.FINE, "CdrAggLoader: Loading tcdragg entry for "
+GeneralUtility.formatDate(cdrAgg.time_hour, "MM/dd/yy HH"));
longCallPStmt.clearParameters();
longCallPStmt.setInt(1, cdrAgg.iintrunkgroupid);
longCallPStmt.setInt(2, cdrAgg.iouttrunkgroupid);
longCallPStmt.setInt(3, cdrAgg.iintrunkgroupnumber);
longCallPStmt.setInt(4, cdrAgg.iouttrunkgroupnumber);
longCallPStmt.setInt(5, cdrAgg.istateregionid);
longCallPStmt.setTimestamp(6, cdrAgg.time_hour);
longCallPStmt.setInt(7, cdrAgg.icalltreatmentcode);
longCallPStmt.setInt(8, cdrAgg.icompletioncode);
longCallPStmt.setInt(9, cdrAgg.bcallcompleted);
longCallPStmt.setInt(10, cdrAgg.itodid);
longCallPStmt.setInt(11, cdrAgg.iasktodid);
longCallPStmt.setInt(12, cdrAgg.ibidtodid);
longCallPStmt.setInt(13, cdrAgg.iaskzoneid);
longCallPStmt.setInt(14, cdrAgg.ibidzoneid);
rs = longCallPStmt.executeQuery();
if(rs.next()) {
cdr_agg = new CdrAgg(
rs.getInt(1),
rs.getInt(2),
rs.getInt(3),
rs.getInt(4),
rs.getInt(5),
rs.getTimestamp(6),
rs.getInt(7),
rs.getInt(8),
rs.getInt(9),
rs.getInt(10),
rs.getInt(11),
rs.getInt(12),
rs.getInt(13),
rs.getInt(14),
rs.getInt(15),
rs.getInt(16)
}//if
end_time = System.currentTimeMillis();
log(Level.INFO, "CdrAggLoader: Loaded "+((cdr_agg==null)?0:1) + " "
+ GeneralUtility.formatDate(cdrAgg.time_hour, "MM/dd/yy HH")
+" tcdragg entry in "+(end_time - start_time)+" msecs");
} finally {
GeneralUtility.closeResultSet(rs);
GeneralUtility.closeStatement(pstmt);
Why that code works well for classes12.zip (comes back in around 10 msec) and not for ojdbc14.jar (comes back in 6-7 minutes)?
Please advise.

Performance problem between Oracle.DataAccess v1 and v2

Hi, I have serious performance problem with OracleDataReader when I use the GetValues method.
My server is Oracle 9.2.0.7, and i use ODAC v10.2.0.221
I create a dummy table for benchmark :
create table test (a varchar2(50), b number)
begin
for i in 1..62359 loop
insert into test values ('Values ' || i, i);
end loop;
commit;
end;
I use the same code for benchmark Framework v1 and Framework v2.
Code :
try {
OracleConnection c = new OracleConnection("user id=saturne_dbo;password=***;data source=satedfx;");
c.Open();
go(c);
c.Close();
catch (Exception ex) {
MessageBox.Show(ex.Message);
private void go(IDbConnection c) {
IDbCommand cmd = c.CreateCommand();
cmd.CommandText = "select * from test";
cmd.CommandType = CommandType.Text;
DateTime dt = DateTime.Now;
IDataReader reader = cmd.ExecuteReader();
int count = 0;
while (reader.Read()) {
object[] fields = new object[reader.FieldCount];
reader.GetValues(fields);
count++;
reader.Close();
TimeSpan eps = DateTime.Now - dt;
MessageBox.Show("Time " + count + " : " + eps.TotalSeconds);
Result are :
Framework v1 with OracleDataAccess 1.10.2.2.20 "Time 62359 : 0.5"
Framework v2 with OracleDataAccess 2.10.2.2.20 "Time 62359 : 3.57" FACTOR 6 !!!!!
I notice same problem with oleDb provider and Microsoft Oracle Client provider..
It's a serious problem for my production server, the time calculation explode...
Where is the explication ?
Do u know solution ?

Can you please try out following -
1. Create a .NET 1.x DLL with your benchmark code. This will obviously use ODP.NET for .NET 1.x.
2. Call this assembly routine from a .NET 1.x executable and note the results.
3. Now call this assembly routine from a .NET 2.0 executable and note the results.
The idea is to always use "ODP.NET for .NET 1.x" even in .NET 2.0 runtime. This will tell us whether the performance degradation is a runtime issue.

Performance problem with sdn_nn - new 10g install

I am having a performance problem with sdn_nn after migrating to a new machine. The old Oracle version was 9.0.1.4. The new is 10g. The new machine is faster in general. Most (non-spatial) batch processes run in half the time. However, the below statement is radically slower. The below statement ran in 45 minutes before. On the new machine it hasn't finished after 10 hours. I am able to get a 5% sample of the customers to finish in 45 minutes.
Does anyone have any ideas on how to approach this problem? Any chance something isn't installed correctly on the new machine (the nth version of the query finishe, albeit 20 times slower)?
Appreciate any help. Thanks.
- Jack
create table nearest_store
as
select /*+ ordered */
a.customer_id,
b.store_id nearest_store,
round(mdsys.sdo_nn_distance(1),4) distance
from customers a,
stores b
where mdsys.sdo_nn(
b.geometry,
a.geometry,
'sdo_num_res=1, unit=mile',
1
) = 'TRUE'
;

Dan,
customers 110,000 (involved in this query)
stores 28,000
Here is the execution plan on the current machine:
CREATE TABLE STATEMENT cost = 81947
LOAD AS SELECT
PX COORDINATOR
PX SEND QC (RANDOM) :TQ10000
ROW NESTED LOOPS
1 1 PX BLOCK ITERATOR
1 1ROW TABLE ACCESS FULL CUSTOMERS
1 3 PARTITION RANGE ALL
1 3 TABLE ACCESS BY LOCAL INDEX ROWID STORES
DOMAIN INDEX STORES_SIDX
I can't capture the execution plan on the old database. It is gone. I don't remember it being any different from the above (full scan customers, probe stores index once for each row in customers).
I am trying the query without the create table (just doing a count). I'll let you know on that one.
I am at 10.0.1.3.
Here is how I created the index:
create index stores_sidx
on stores(geometry)
indextype is mdsys.spatial_index LOCAL
Note that the stores table is partitioned by range on store type. There are three store types (each in its own partition). The query returns the nearest store of each type (three rows per customer). This is by design (based on the documented behavior of sdo_nn).
In addition to running the query without the CTAS, I am also going try running it on a different machine tonight. I let you know how that turns out.
The reason I ask about the install, is that the Database Quick Installation Guide for Solaris says this:
"If you intend to use Oracle JVM or Oracle interMedia, you must install the Oracle Database 10g Products installation type from the Companion CD. This installation optimizes the performance of those products on your system."
And, the Database Installlation Guide says:
"If you plan to use Oracle JVM or Oracle interMedia, Oracle strongly recommends that you install the natively compiled Java libraries (NCOMPs) used by those products from the Oracle Database 10g Companion CD. These libraries are required to improve the performance of the products on your platform."
Based on that, I am suspicious that maybe I have the product installed on the new machine, but not correctly (forgot to set fast=true).
Let me know if you think of anything else you'd like to see. Thanks.
- Jack

Performance issues with Oracle EE 9.2.0.4 and RedHat 2.1

Hello,
I am having some serious performance issues with Oracle Enterprise Edition 9.2.0.4 and RedHat Linux 2.1. The processor goes berserk at 100% for long (some 5 min.) periods of time, and all the ram memory gets used.
Some environment characteristics:
Machine: Intel Pentium IV 2.0GHz with 1GB of RAM.
OS: RedHat Linux 2.1 Enterprise.
Oracle: Oracle Enterprise Edition 9.2.0.4
Application: We have a small web-application with 10 users (for now) and very basic queries (all in stored procedures). Also we use the latest version of ODP.NET with default connection settings (some low pooling, etc).
Does anyone know what could be going on?
Is anybody else having this similar behavior?
We change from SQL-Server so we are not the world expert on the matter. But we want a reliable system nonetheless.
Please help us out, gives some tips, tricks, or guides
Thanks to all,
Frank

Thank you very much and sorry I couldnt write sooner. It seems that the administrator doesnt see the kswap going on so much, so I dont really know what is going on.
We are looking at some queries and some indexing but this is nuts, if I had some poor queries, which we dont really, the server would show pick right?
But he goes crazy and has two oracle processes taking all the resources. There seems to be little swapping going on.
Son now what? They are all ready talking about MS-SQL please help me out here, this is crazy!!!
We have, may be the most powerful combinations here. What is oracle doing?
We even kill the Working Process of the IIS and have no one do anything with the database and still dose two processes going on.
Can some one help me?
Thanks,
Frank

Performance problems with jdk 1.5 on Linux plattform

Performance problems with jdk 1.5 on Linux plattform
(not tested on Windows, might be the same)
After refactoring using the new features from java 1.5 I lost
performance significantly:
public Vector<unit> units;
The new code:
for (unit u: units) u.accumulate();
runs more than 30% slower than the old code:
for (int i = 0; i < units.size(); i++) units.elementAt(i).accumulate();
I expected the opposite.
Is there any information available that helps?

Here's the complete benchmark code I used:package test;
import java.text.NumberFormat;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Vector;
public class IterationPerformanceTest {
     private int m_size;
     public IterationPerformanceTest(int size) {
          m_size = size;
     public long getArrayForLoopDuration() {
          Integer[] testArray = new Integer[m_size];
          for (int item = 0; item < m_size; item++) {
               testArray[item] = new Integer(item);
          StringBuilder builder = new StringBuilder();
          long start = System.nanoTime();
          for (int index = 0; index < m_size; index++) {
               builder.append(testArray[index]);
          long end = System.nanoTime();
          System.out.println(builder.length());
          return end - start;
     public long getArrayForEachDuration() {
          Integer[] testArray = new Integer[m_size];
          for (int item = 0; item < m_size; item++) {
               testArray[item] = new Integer(item);
          StringBuilder builder = new StringBuilder();
          long start = System.nanoTime();
          for (Integer item : testArray) {
               builder.append(item);
          long end = System.nanoTime();
          System.out.println(builder.length());
          return end - start;
     public long getArrayListForLoopDuration() {
          ArrayList<Integer> testList = new ArrayList<Integer>();
          for (int item = 0; item < m_size; item++) {
               testList.add(item);
          StringBuilder builder = new StringBuilder();
          long start = System.nanoTime();
          for (int index = 0; index < m_size; index++) {
               builder.append(testList.get(index));
          long end = System.nanoTime();
          System.out.println(builder.length());
          return end - start;
     public long getArrayListForEachDuration() {
          ArrayList<Integer> testList = new ArrayList<Integer>();
          for (int item = 0; item < m_size; item++) {
               testList.add(item);
          StringBuilder builder = new StringBuilder();
          long start = System.nanoTime();
          for (Integer item : testList) {
               builder.append(item);
          long end = System.nanoTime();
          System.out.println(builder.length());
          return end - start;
     public long getArrayListIteratorDuration() {
          ArrayList<Integer> testList = new ArrayList<Integer>();
          for (int item = 0; item < m_size; item++) {
               testList.add(item);
          StringBuilder builder = new StringBuilder();
          long start = System.nanoTime();
          Iterator<Integer> iterator = testList.iterator();
          while(iterator.hasNext()) {
               builder.append(iterator.next());
          long end = System.nanoTime();
          System.out.println(builder.length());
          return end - start;
     public long getLinkedListForLoopDuration() {
          LinkedList<Integer> testList = new LinkedList<Integer>();
          for (int item = 0; item < m_size; item++) {
               testList.add(item);
          StringBuilder builder = new StringBuilder();
          long start = System.nanoTime();
          for (int index = 0; index < m_size; index++) {
               builder.append(testList.get(index));
          long end = System.nanoTime();
          System.out.println(builder.length());
          return end - start;
     public long getLinkedListForEachDuration() {
          LinkedList<Integer> testList = new LinkedList<Integer>();
          for (int item = 0; item < m_size; item++) {
               testList.add(item);
          StringBuilder builder = new StringBuilder();
          long start = System.nanoTime();
          for (Integer item : testList) {
               builder.append(item);
          long end = System.nanoTime();
          System.out.println(builder.length());
          return end - start;
     public long getLinkedListIteratorDuration() {
          LinkedList<Integer> testList = new LinkedList<Integer>();
          for (int item = 0; item < m_size; item++) {
               testList.add(item);
          StringBuilder builder = new StringBuilder();
          long start = System.nanoTime();
          Iterator<Integer> iterator = testList.iterator();
          while(iterator.hasNext()) {
               builder.append(iterator.next());
          long end = System.nanoTime();
          System.out.println(builder.length());
          return end - start;
     public long getVectorForLoopDuration() {
          Vector<Integer> testVector = new Vector<Integer>();
          for (int item = 0; item < m_size; item++) {
               testVector.add(item);
          StringBuilder builder = new StringBuilder();
          long start = System.nanoTime();
          for (int index = 0; index < m_size; index++) {
               builder.append(testVector.get(index));
          long end = System.nanoTime();
          System.out.println(builder.length());
          return end - start;
     public long getVectorForEachDuration() {
          Vector<Integer> testVector = new Vector<Integer>();
          for (int item = 0; item < m_size; item++) {
               testVector.add(item);
          StringBuilder builder = new StringBuilder();
          long start = System.nanoTime();
          for (Integer item : testVector) {
               builder.append(item);
          long end = System.nanoTime();
          System.out.println(builder.length());
          return end - start;
     public long getVectorIteratorDuration() {
          Vector<Integer> testVector = new Vector<Integer>();
          for (int item = 0; item < m_size; item++) {
               testVector.add(item);
          StringBuilder builder = new StringBuilder();
          long start = System.nanoTime();
          Iterator<Integer> iterator = testVector.iterator();
          while(iterator.hasNext()) {
               builder.append(iterator.next());
          long end = System.nanoTime();
          System.out.println(builder.length());
          return end - start;
      * @param args
     public static void main(String[] args) {
          IterationPerformanceTest test = new IterationPerformanceTest(1000000);
          System.out.println("\n\nRESULTS:");
          long arrayForLoop = test.getArrayForLoopDuration();
          long arrayForEach = test.getArrayForEachDuration();
          long arrayListForLoop = test.getArrayListForLoopDuration();
          long arrayListForEach = test.getArrayListForEachDuration();
          long arrayListIterator = test.getArrayListIteratorDuration();
//          long linkedListForLoop = test.getLinkedListForLoopDuration();
          long linkedListForEach = test.getLinkedListForEachDuration();
          long linkedListIterator = test.getLinkedListIteratorDuration();
          long vectorForLoop = test.getVectorForLoopDuration();
          long vectorForEach = test.getVectorForEachDuration();
          long vectorIterator = test.getVectorIteratorDuration();
          System.out.println("Array      for-loop: " + getPercentage(arrayForLoop, arrayForLoop) + "% ("+getDuration(arrayForLoop)+" sec)");
          System.out.println("Array      for-each: " + getPercentage(arrayForLoop, arrayForEach) + "% ("+getDuration(arrayForEach)+" sec)");
          System.out.println("ArrayList for-loop: " + getPercentage(arrayForLoop, arrayListForLoop) + "% ("+getDuration(arrayListForLoop)+" sec)");
          System.out.println("ArrayList for-each: " + getPercentage(arrayForLoop, arrayListForEach) + "% ("+getDuration(arrayListForEach)+" sec)");
          System.out.println("ArrayList iterator: " + getPercentage(arrayForLoop, arrayListIterator) + "% ("+getDuration(arrayListIterator)+" sec)");
//          System.out.println("LinkedList for-loop: " + getPercentage(arrayForLoop, linkedListForLoop) + "% ("+getDuration(linkedListForLoop)+" sec)");
          System.out.println("LinkedList for-each: " + getPercentage(arrayForLoop, linkedListForEach) + "% ("+getDuration(linkedListForEach)+" sec)");
          System.out.println("LinkedList iterator: " + getPercentage(arrayForLoop, linkedListIterator) + "% ("+getDuration(linkedListIterator)+" sec)");
          System.out.println("Vector     for-loop: " + getPercentage(arrayForLoop, vectorForLoop) + "% ("+getDuration(vectorForLoop)+" sec)");
          System.out.println("Vector     for-each: " + getPercentage(arrayForLoop, vectorForEach) + "% ("+getDuration(vectorForEach)+" sec)");
          System.out.println("Vector     iterator: " + getPercentage(arrayForLoop, vectorIterator) + "% ("+getDuration(vectorIterator)+" sec)");
     private static NumberFormat percentageFormat = NumberFormat.getInstance();
     static {
          percentageFormat.setMinimumIntegerDigits(3);
          percentageFormat.setMaximumIntegerDigits(3);
          percentageFormat.setMinimumFractionDigits(2);
          percentageFormat.setMaximumFractionDigits(2);
     private static String getPercentage(long base, long value) {
          double result = (double) value / (double) base;
          return percentageFormat.format(result * 100.0);
     private static NumberFormat durationFormat = NumberFormat.getInstance();
     static {
          durationFormat.setMinimumIntegerDigits(1);
          durationFormat.setMaximumIntegerDigits(1);
          durationFormat.setMinimumFractionDigits(4);
          durationFormat.setMaximumFractionDigits(4);
     private static String getDuration(long nanos) {
          double result = (double)nanos / (double)1000000000;
          return durationFormat.format(result);
}

Performance problems with new Java Tiger style recommendations

Performance problems with jdk 1.5 on Linux plattform
(not tested on Windows, might be the same)
using the new style recommendations.
I need fast Vector loops for high speed mathematical calculations, some
hints about the fastest way to program that loop would be also great!
After refactoring using the new features from java 1.5 (as recommended from
SUN) I lost performance significantly:
using a vector:
public Vector<unit> units;
The new code (recommended from SUN for Java Tiger for redesign):
for (unit u: units) u.accumulate();
runs more than 30% slower than the old code:
for (int i = 0; i < units.size(); i++) units.elementAt(i).accumulate();
I expected the opposite.
Is there any information available that helps?
The following additional information I got from Mr. Shankar Unni:
I got some fairly anomalous results comparing ArrayList and Vector: for the
1.5-style loops, ArrayList was faster then Vector, but for a loop with get()
calls, Vector was faster. Vector was even faster than that using
elementAt(), which was a surprise:
For a million summing iterations over a 100-element array:
vector elementAt loop took 3446 ms.
vector get loop took 3796 ms.
vector iterator loop took 5469 ms.
arraylist get loop took 4136 ms.
arraylist iterator loop took 4668 ms.

If your topic doesn't change, please stay in your original post.

Performance problems with SAP GUI 7.10 and BEx 3.5 Patch 400?

Hi everybody,
we installed SAP GUI 7.10 and BEx 3.5 Patch 400 and detected hugh performance problems with this version in comparison to the SAP GUI 6.40 and BEx 3.5 or BEx 7.0 Patch 800.
Does anybody detect the same problems?
Best regards,
Ulli

Most important question when you are talking about performance-issues:
which OC are you working on and which excel version?
ciao
Joke

Performance Problems with "For all Entries" and a big internal table

We have big Performance Problems with following Statement:
SELECT * FROM zeedmt_zmon INTO TABLE gt_zmon_help
FOR ALL ENTRIES IN gt_zmon_help
    WHERE
    status = 'IAI200' AND
    logdat IN gs_dat AND
    ztrack = gt_zmon_help-ztrack.
In the internal table gt_zmon_help are over 1000000 entries.
Anyone an Idea how to improve the Performance?
Thank you!

>
Matthias Weisensel wrote:
> We have big Performance Problems with following Statement:
>
>
SELECT * FROM zeedmt_zmon INTO TABLE gt_zmon_help
>   FOR ALL ENTRIES IN gt_zmon_help
>     WHERE
>     status = 'IAI200' AND
>     logdat IN gs_dat AND
>     ztrack = gt_zmon_help-ztrack.
>
> In the internal table gt_zmon_help are over 1000000 entries.
> Anyone an Idea how to improve the Performance?
>
> Thank you!
You can't expect miracles. With over a million entries in your itab any select is going to take a bit of time. Do you really need all these records in the itab? How many records is the select bringing back? I'm assuming that you have got and are using indexes on your ZEEDMT_ZMON table.
In this situation, I'd first of all try to think of another way of running the query and restricting the amount of data, but if this were not possible I'd just run it in the background and accept that it is going to take a long time.

Performance problems with EP 6 and MS IE

Hi everybody,
since a couple of days, we are facing a sever performance problem with our SAP EP 6.0. When I access the system with MS Internet Explorer 6.0, it takes 5-10 minutes after the Login. With Firefox Browser, the performance is ok. Therefore I assume that it must be a problem with the IE settings. Does anybody know a solution?
Best regards,
Michael

There are a few things that this could be. I've seen the setting "Empty Temporary Internet Files folder when browser is closed" cause a lot of performance problems (This is in the advanced settings in your IE).
This will cause your cache to be cleared out each time the browser is closed and cause a lot more data to be downloaded each time you login to the system.
For more analysis I'd recommend putting a tool like HTTPWatch into your IE browser and seeing which requests are using the most time.

Performance problem with Mavericks.

Performance problem with Mavericks. My Mac is extremly slow after upgrading to Mavericks. What can i do to solve that?

If you are still experiencing slow down issues, it maybe because of a few other reasons.
Our experience with OS X upgrades, and Mavericks is no exception, is that users have installed a combination of third party software and/or hardware that is incompatible and/or is outdated that causes many negative performance issues when upgrading to a new OS X version.
Your Mac's hard drive maybe getting full.
Do you run any antivirus software on your Mac? Commercial Antivirus software can slow down and negatively impact the normal operation of OS X.
Do you have apps like MacKeeper or any other maintenance apps like CleanMyMac 1 or 2, TuneUpMyMac or anything like these apps, installed on your Mac? These types of apps, while they appear to be helpful, can do too good a job of data "cleanup" causing the potential to do serious data corruption or data deletion and render a perfectly running OS completely dead and useless leaving you with a frozen, non-functional Mac.
Your Mac may have way too many applications launching at startup/login.
Your Mac may have old, non-updated or incompatible software installed.
Your Mac could have incompatible or outdated web browser extensions, plugins or add-ons.
Your Mac could have connected third party hardware that needs updated device drivers.
It would help us to help you if we could have some more technical info about your iMac.
If you so choose, please download, install and run Etrecheck.
Etrecheck was developed as a simple Mac diagnostic report tool by a regular Apple Support forum user and technical support contributor named Etresoft. Etrecheck is a small, unobstrusive app that compiles a static snapshot of your entire Mac hardware system and installed software.
This is a free app that has been honestly created to provided help in diagnosing issues with Macs running the new OS X 10.9 Mavericks.
It is not malware and can be safely downloaded and installed onto your Mac.
http://www.etresoft.com/etrecheck
Copy/paste and post its report here in another reply thread so that we have a complete profile of your Mac's hardware and installed software so we can all help continue with your Mac performance issues.
Thank you.

There is any Performance problem with Creation of many Y or Z Programs.

HI,
There is any Performance problem with Creation of many Y or Z Programs. plz give clarity regarding this to me......
regards
ganesh

Ganesh,
Can you please mention the context and the purpose of creating these custom program. And application are you referring to?
Regards,
Rohit

Performance problem with Oracle

Similar Messages

Maybe you are looking for