Answer Posted / lova raju allumalla

when performing joins on two or more tables, we normally
write a query making use relational operators such as =
etc. which means each and every row of every table is
compared with each other,which is a unwanted situation when
looked in the perspective performance issue. where as
making use of corelated query one can minimise the tedoius
checks as described above. consider the example below with
a normal join
select * from emp e,dept d where e.deptno=d.deptno;

now the above same can be performed by using the co related
query
select * from emp where deptno in (select deptno from dept);

u can now make up the difference, in the first approach in
emp table, each row deptno value compared for each row
deptno value of dept table.where as in second approach the
(select deptno from dept) is executed only once for all
checks of the outer query select * from emp where deptno

What is the cause of mutating table error and how can we solve it?

1065

---

explain access control lists. : Sql dba

1009

---

Why do we use procedures?

966

---

What is the difference between sql and isql*plus?

1111

---

What is the difference between join and natural join?

937

---

Are stored procedures faster than dynamic sql?

1050

---

What is break?

1204

---

What is #table in sql?

1117

---

What is rowid in sql?

995

---

how to calculate expressions with sql statements? : Sql dba

1046

---

What is query execution plan in sql?

1195

---

What is graph sql?

998

---

how to drop an existing index in mysql? : Sql dba

1076

---

How do I order by ascending in sql?

1034

---

Explain the rollback statement?

1017

---