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

Explain the commit statement.

848

---

What is nosql db?

711

---

What are the main features of cursor?

825

---

how can we take a backup of a mysql table and how can we restore it. ? : Sql dba

719

---

What is a nested table in word?

705

---

---

Can a table contain multiple foreign key’s?

743

---

What are the three forms of normalization?

758

---

Why trigger is used in sql?

691

---

What is the difference between execution of triggers and stored procedures?

750

---

Can I create table without primary key?

733

---

what are date and time data types in mysql? : Sql dba

686

---

What is the size of partition table?

742

---

Explain dml and ddl?

739

---

What programs use sql?

730

---

Why do we need a foreign key?

757

---