Which is fast / Smooth performing?

I have 10 circles on the stage, animated on the time line, simple animation like scale, rotation and size changes.
Which will give me best performance in terms of browser load and smoothness of animation?
Ellipse or Svg file
What if it is 100 objects, or even 1000 objects?

Which is fast ? Select * from tableName or Select Column1,Column2 .... From tableName ? and Why ?
select * from Sales.[SalesOrderHeader]
select SalesOrderNumber,RevisionNumber,rowguid from Sales.[SalesOrderHeader]
As you can see both the query execution plan and subtree cost is same. So how selecting the particular columns optimize the query ?
Yes, selecting specific columns is always better than select *.
If you always need few columns in result, then just use SELECT col1, col2 FROM YourTable. If you SELECT * FROM YourTable; that is extra useless overhead.
If in future if someone adds Image/BLOB/Text type columns in your table, using SELECT * will worsen the performace for sure.
Let's say if you have SP and you use INSERT INTO DestTable SELECT * FROM TABLE which runs fine BUT again if someone adds few more columns then your SP will fail saying provided columns don't match.
-Vaibhav Chaudhari

Similar Messages

Which is faster - Member formula or Calculation script?

Hi,
I have a very basic question, though I am not sure if there is a definite right or wrong answer.
To keep the calculation scripts to a minimum, I have put all the calculations in member formula.
Which is faster - Member formula or calculation scripts? Because, if i am not mistaken, FIX cannot be used in member formulas, so I need to resort to the use of IF, which is not index driven!
Though in the calculation script,while aggregating members which have member formula, I have tried to FIX as many members as I can.
What is the best way to optimize member formulas?
I am using Hyperion Planning and Essbase 11.1.2.1.
Thanks.

Re the mostly "free" comment -- if the block is in memory (qualification #1), and the formula is within the block (qualification #2), the the expensive bit was reading the block off of the disk and expanding it into memory. Once that is done, I typically think of the dynamic calcs as free as the amount of data being moved about is very, very, very small. That goes out the window if the formula pulls lots of blocks to value and they get cycled in and out of the cache. Then they are not free and are potentially slower. And yes, I have personally shot myself in the foot with this -- I wrote a calc that did @PRIORS against a bunch of years. It was a dream when I pulled 10 cells. And then I found out that the client had reports that pulled 5,000. Performance when right down the drain at that point. That one was 100% my fault for not forcing the client to show me what they were reporting.
I think your reference to stored formulas being 10-15% faster than calc script formulas deals with if the Formulas are executed from within the default calc. When the default Calc is used, it precompiles the formulas and handles many two pass calculations in a single pass. Perhaps that is what you are thinking of.^^^I guess that must be it. I think I remember you talking about this technique at one of your Kscope sessions and realizing that I had never tried that approach. Isn't there something funky about not being able to turn off the default calc if a user has calc access? I sort of thing so. I typically assing a ; to the default calc so it can't do anything.
Regards,
Cameron Lackpour

Which is faster - Member formula or Calculation scripts?

Hi,
I have a very basic question, though I am not sure if there is a definite right or wrong answer.
To keep the calculation scripts to a minimum, I have put all the calculations in member formula.
Which is faster - Member formula or calculation scripts? Because, if i am not mistaken, FIX cannot be used in member formulas, so I need to resort to the use of IF, which is not index driven!
Though in the calculation script,while aggregating members which have member formula, I have tried to FIX as many members as I can.
What is the best way to optimize member formulas?
I am using Hyperion Planning and Essbase 11.1.2.1.
Thanks.

The idea that you can't reference a member formula in a FIX is false. Here's an example:
- Assume you have an account that has a data storage of Stored or Never Share.
- This account is called Account_A and it has a member formula of Account_B * Account_C;.
- You would calculate this account within a FIX (inside of a business rule) something like this:
FIX(whatever . . . )
"Account_A";
ENDFIX
If you simply place the member named followed by a semi-colon within a business rule, the business rule will execute the code in the in that member's member formula.
Why would you want to do this instead of just putting ALL of the logic inside the business rule? Perhaps that logic gets referenced in a LOT of different business rules, and you want to centralize the code in the outline? This way, if the logic changes, you only need to update it in one location. The downside to this is that it can make debugging a bit harder. When something doesn't work, you can find yourself searching for the code a bit.
Most of my applications end up with a mix of member formulas and business rules. I find that performance isn't the main driving force behind where I put my code. (The performance difference is usually not that significant when you're talking about stored members.) What typically drives my decision is the organization of code and future maintenance. It's more art than science.
Hope this helps,
- Jake

Which execution is more performance effective in SQL Query

Hi
Any one help me regarding oracle performance, which is best for application performance
1) I have multiple option and store in application and the option value or text store in transaction table, and we are querying information filter by option field value.
2) I have a table stored all option with a primary key and select the option query by table , and the value stored in transaction table as foregin key, we qre querying information with joining of two table and filter by option table column
in this scenario , i have two of more question
1) which is faster process for information display
2) which option will use minimum memory
3) which option will effect application performance
4) which option will effect database performance
which is best for application performation ?
Thanks

Hi
I am not a student,
I am analysis the execution time of those query as below
1) Select Name , Age, Country,Zone from Countrydata where zone='EAST'
2) Select a.Name, a.Age, a.Country,b.zone from countrydata a, countryzone b where a.zonecode=b.zonecode and a.zonecode=1
both query result are same
query case 1- No index
query case -2 with index
now please suggest me which as per below my query
1) which query execution time will be short
2) in which query data storage increase or dcrease in the table and data size and what will impact on database performance
3) which query is best for application developer
4) which is best as per data modeling
Regards

Which is Good for Performance?

Hi,
I am bit confused about this code from performance point of view, say If I write like this :
for(int i=0;i<1000;i++)
//declaring variables in the loop
int j, k;
double d;
CustomClassObj classObj = new CustomClassObj();
}And if I declare all the variables before the loop like this
//declaring variables before the loop
int j, k;
double d;
CustomClassObj classObj = new CustomClassObj();
for(int i=0;i<1000;i++)
}so which is faster from performnace point of view? As I have read some white papers and books, but some says the local variables (insode loops) are better as GC will deallocate those variables after loop.
And some suggest that dont create temporary objects inside loop... :(
Please help...!
Thanks in Advance.

Java_Cup wrote:
so which is faster from performnace point of view? As I have read some white papers and books, but some says the local variables (insode loops) are better as GC will deallocate those variables after loop.If they said that, then they were worthless. GC doesn't touch local variables. And if it did, it would be slower, because you'd have one GC task per loop iteration, rather than simply one at the end.
All the local variables used in a method are allocated in one shot when the method starts, by moving the stack pointer by an amount determined at compile time, and they are all released when the method ends by moving it back by the same amount.
It also looks like you may be confusing variables with objects.
>
And some suggest that dont create temporary objects inside loop... :(Well, that depends. If you need one object across the entire life of the loop, you might get better performance by creating it before the loop starts. I wouldn't generally do that though unless I knew that creating that object was expensive relative to the rest of the work being done in the loop. I'd stick with creating it inside the loop, where it's actually used. And of course if your logic dictates a different object for each iteration, then you have to do it inside the loop anyway.
At the end of the day, these microoptimizations don't become relevant until you observe a performance problem, profile it, and confirm by measurement, changing the code, and re-profiling, that it is in fact a problem.

Which is faster ESB or BPEL and why?

Hi,
Can anybody please tell me which is faster, either ESB or BPEL? I believe ESB is more faster than BPEL due to the message payload in BPEL not ESB.
It would be great if anybody can put some info on this plz.
Cheers!
user623695
Edited by: user623695 on Dec 24, 2010 12:31 AM

You are considering only performance as the criteria for choosing between two products which have different purposes which is not the right way to go about it. Lets consider(just an assumption, might not be true) that BPEL is faster for a flow which requires simple routing/mediation to a back end service, even then you should ideally use OSB for that flow/service rather then doing it on BPEL.
If you have to consider only performance then its my understanding that OSB would be faster then BPEL for simple routing.
Architecture of both OSB and SOA Suite/BPEL is different, OSB is optimized for short running, fast and stateless services while BPEL is optimized for long running and stateful processes.

Java io and Java nio, which is faster to binary io?

Anybody can advise me about java io and java nio ?
I want to write the faster code to read and write binary files.
I'm going to read/write
- individual elements (int, double, etc)
- arraylists
- objects
Also I'm going (or I'd want) to use seek functions.
Thanks

Anybody can advise me about java io and java nio ?
I want to write the faster code to read and write binary files.Which is "faster" depends on exactly how you're using them. For example, a MappedByteBuffer is usually faster for random access than a RandomAccessFile, unless your files are so large (and your accesses so random) than you're constantly loading from disk. And it's not at all faster for linear uni-directional access than a simple FileInputStream.
So, rather than expecting some random stranger telling you that one is faster than the other without knowing your project, perhaps you should tell us exactly how you plan to use IO, and why you think that one approach may be faster than the other.

Which is faster while executing statment having Case or Decode.

Pls tell me which execute faster a case or decode.

ajallen wrote:
If you are really concerned about this, then you are being taken over by the tuning virus. You are out of control. You are tuning beyond reason. DECODE() is deprecated - not being enhanced. CASE is the new preferred approach. CASE is simpler and easier to code/follow.I can't find a link saying that DECODE() function is already deprecated. Can you give us a valid link?
Regards.

WHICH IS FASTER AND WHY

Hi Guys,
Just want to knw which is faster
java.lang.String.toLowerCase()
or
java.lang.String.toUpperCase()
Thanks,
Tuniki

A look into the source code tells me that
toUpperCasemay be slightly slower in rare cases when a single lower-case
letter needs to be converted to an array of upper-case double-bytes.
However, this depends somewhat on the frequency of conversions.
If you have frequently strings that are all-upper-case, use
toUpperCase()and -- vice versa -- if the strings are frequently all lower-case, then prefer
toLowerCaseboth methods first test whether a conversion has to be made at all.

Which is fast

Which is fast either stored procedure or stored function in oracle 10g.
Thanks in advance

i would say it depends on what you are trying to do in the body of the procedure or function. i don't think it's a matter of which is faster. it would be more of a question of did you want to return something (in which case use a function) or nothing (in which case you can use a procedure).

Which is fast: between or ( = =)

Hi,
can anyone explain me which is fast?
between
or
<= >= operator.
Thanks in advance.

Hi, you can easy test that and find out that they're in fact the same:
MHO%xe> create table t as select level col from dual connect by level <= 1000000;
Tabel is aangemaakt.
MHO%xe> create index t_i on t(col);
Index is aangemaakt.
MHO%xe> set autotrace traceonly explain
MHO%xe> select * from t where col between 100000 and 300000;
Verstreken: 00:00:01.78
Uitvoeringspan
Plan hash value: 1601196873
| Id | Operation         | Name | Rows | Bytes | Cost (%CPU)| Time     |
|   0 | SELECT STATEMENT |      |   211K| 2679K|   460   (9)| 00:00:06 |
|* 1 | TABLE ACCESS FULL| T    |   211K| 2679K|   460   (9)| 00:00:06 |
Predicate Information (identified by operation id):
   1 - filter("COL">=100000 AND "COL"<=300000) -- See that BETWEEN gets rewritten to >= and <=
Note
   - dynamic sampling used for this statement
MHO%xe> select * from t where col >= 200000 and col <= 400000;
Verstreken: 00:00:00.14
Uitvoeringspan
Plan hash value: 1601196873
| Id | Operation         | Name | Rows | Bytes | Cost (%CPU)| Time     |
|   0 | SELECT STATEMENT |      |   227K| 2885K|   460   (9)| 00:00:06 |
|* 1 | TABLE ACCESS FULL| T    |   227K| 2885K|   460   (9)| 00:00:06 |
Predicate Information (identified by operation id):
   1 - filter("COL">=200000 AND "COL"<=400000)
Note
   - dynamic sampling used for this statement
MHO%xe> select * from t where col >= 500000 and col <= 600000;
Verstreken: 00:00:00.34
Uitvoeringspan
Plan hash value: 4021086813
| Id | Operation        | Name | Rows | Bytes | Cost (%CPU)| Time     |
|   0 | SELECT STATEMENT |      | 48712 |   618K|   109   (2)| 00:00:02 |
|* 1 | INDEX RANGE SCAN| T_I | 48712 |   618K|   109   (2)| 00:00:02 |
Predicate Information (identified by operation id):
   1 - access("COL">=500000 AND "COL"<=600000)
Note
   - dynamic sampling used for this statement
MHO%xe> select * from t where col between 500000 and 600000;
Verstreken: 00:00:00.11
Uitvoeringspan
Plan hash value: 4021086813
| Id | Operation        | Name | Rows | Bytes | Cost (%CPU)| Time     |
|   0 | SELECT STATEMENT |      | 48712 |   618K|   109   (2)| 00:00:02 |
|* 1 | INDEX RANGE SCAN| T_I | 48712 |   618K|   109   (2)| 00:00:02 |
Predicate Information (identified by operation id):
   1 - access("COL">=500000 AND "COL"<=600000)
Note
   - dynamic sampling used for this statement

Which is fast ? Select * from tableName or Select Column1,Column2 .... From tableName ? and Why ?

Which is fast ? Select * from tableName or Select Column1,Column2 .... From tableName ? and Why ?
select * from Sales.[SalesOrderHeader]
select SalesOrderNumber,RevisionNumber,rowguid from Sales.[SalesOrderHeader]
As you can see both the query execution plan and subtree cost is same. So how selecting the particular columns optimize the query ?

Which is fast ? Select * from tableName or Select Column1,Column2 .... From tableName ? and Why ?
select * from Sales.[SalesOrderHeader]
select SalesOrderNumber,RevisionNumber,rowguid from Sales.[SalesOrderHeader]
As you can see both the query execution plan and subtree cost is same. So how selecting the particular columns optimize the query ?
Yes, selecting specific columns is always better than select *.
If you always need few columns in result, then just use SELECT col1, col2 FROM YourTable. If you SELECT * FROM YourTable; that is extra useless overhead.
If in future if someone adds Image/BLOB/Text type columns in your table, using SELECT * will worsen the performace for sure.
Let's say if you have SP and you use INSERT INTO DestTable SELECT * FROM TABLE which runs fine BUT again if someone adds few more columns then your SP will fail saying provided columns don't match.
-Vaibhav Chaudhari

Subquery vs UNION, which is better for performance?

I want to know which in better for performance using a subquery method or a UNION?
Any information would be helpful and appreciated!

Hi,
It depends on the SQL statments and each case is different from an other one. Take a look at the oracle doc: "Designing and Tuning for Performance".
Regards,
CB

My iiPad mini is lagging to much after ios 7 upgrade. Please apple solve this issue. Games which are running smoothly in ios 6 lagging too much. This is the worst experience Apple

my iiPad mini is lagging to much after ios 7 upgrade. Please apple solve this issue. Games which are running smoothly in ios 6 lagging too much. This is the worst experience Apple

Settings>General>Reset>Reset all settings.
*Note:* Settings, preferences, network settings, etc *will* be reset. *NO data or media will be lost*
and/or
Settings>iCloud>Documents and Data (turn it OFF)
If you want to voice your opinion, please do so here:
http://www.apple.com/feedback/

Which phone has best performance?

Which phone has best performance (CPU speed, RAM) ? (Nokia 5800xpress music or Nokia N97)
Glad to help
Solved!
Go to Solution.

If you want Nokia touchscreen, as things stand at the moment , you are looking at the wrong two phones !! Both the X6 and N97 mini are better alternatives, and I would advise a little Google research to get independent reviews as you will probably get 'slightly' prejudice advice here due to the nature of the forum
If I have helped at all, a click on the White Star is always appreciated :
you can also help others by marking 'accept as solution'

Which is fast / Smooth performing?

Similar Messages

Maybe you are looking for