When users are not able to log onto database, What are all the probable reasons?
Latest Answer: 1. Database server is not up.2. User not aware of the correct credentials.3. TNS entry is not proper.4. Some network problem. ...
If your database is running slow from last 2 hrs.you can't wait for Statspack report generation. What will be your first step to handle the problem? Where can be the problem?
Latest Answer: Remove unnecessary joins, too much normalization can effect query to perform slow, excess use of cursors, indexes, procedures or temporary tables may effect on query to perform slow. If my answer is wrong please correct me ...
Explain how the cursor can become stuck between two items, resulting in a navigation trap.
Latest Answer: It can be some application interacting the oracle as a server/database. Forms, Toad etc. ...
Latest Answer: Dude Remember!when its your first job you should say"It doesnt matter if you pay me less or more i believe with my good work I would get a handsome salary today or tomorrow and I am sure organisation of your repute doesnt have salary indifferences I am ...
Latest Answer: Try thisCREATE OR REPLACE FUNCTION FIN2008.rowtocol( p_slct IN VARCHAR2,p_dlmtr IN VARCHAR2 DEFAULT ',' ) RETURN VARCHAR2AUTHID CURRENT_USER ASTYPE c_refcur IS REF CURSOR;lc_str VARCHAR2(4000);lc_colval VARCHAR2(4000);c_dummy c_refcur;l number;BEGINOPEN ...
Latest Answer: For example, if tables Emp1 and Emp2 both have identical structure, and some changes were applied in them, then MINUS can show the difference. Likeselect *from Emp1MINUSselect * from Emp2 UNIONselect * from Emp2 MINUSselect * from Emp1 ...
hi how to place different column in on columneg:if we have address column in that we have to place addr1,addr2,addr3.
Latest Answer: Generally oracle uses Cost_based optimisation. In this method it will calculate all the execution plans for the query to execute and chooses the best optimal plan. Sometimes we may know the best execution plan to you rather which is selected by optimisation ...
Latest Answer: B-Tree indexes are usually associated with the index that stores a list of ROWIDs for each key.While Bitmap is also organized as B tree , but the leaf node stores a bitmap for each value instead of a list of ROWIDs. B tree can be used for OLTP while bitmap ...
View page [1] 2 3 4 5 6 7 8 9 10 Next >>
Go Top
