Leaf nodes of B*Tree index are connected by
Doubly Linked list
Singly linked list
Pointers
Structures
Different steps in SQL execution
a. Parse
b. Fetch
c. Retrieve
d. Bind
e. Execute
Hard parse is expensive than Soft Parse
True
False
Ideal Elapsed time for a SQL in OLTP type of Application
Less than 10ms
100ms
150ms
50ms
Usage of Hints is advisable in a SQL statement
Provision should be there for Blind searches
Which of the following can be used as first steps to tune SQL Statements
Explain Plan
Trace
Parse
Bind
Ideal Blocks/Row ratio for selecting data from a table . BLocks=Number of BLocks accessed ROws=Number of rows retrieved
5
10
100
1
Bind variables should be used in SQL statements
How many minimum join conditions should exist if a SQL statement has 3 tables
2
3
4