Sql select employee from table with at least one department, Database Management System

Assignment Help:

Consider employee (e_no, e_name, e_salary, d_code), dept
(d_code, d_name) and dependent (depndt_name, e_no, relation).
Show the names of employees in purchase and accounts departments with at least one dependent.

SELECT e_name FROM employee, dependent, dept
WHERE employee.d_code=dept.d_code
AND employee.e_no=dependant.e_no
AND d_name IN (‘ACCOUNTS', ‘PURCHASE')
GROUP BY e_name
HAVING COUNT (e_no)>=1


Related Discussions:- Sql select employee from table with at least one department

What is the aim of object design, What is the aim of object design The ...

What is the aim of object design The aim of object design is to identify object which the system   contains and the interactions among them. The system implements specification

What is deadlock, What is deadlock? How can it be avoided? How can it be re...

What is deadlock? How can it be avoided? How can it be resolved once it occurs? Deadlock happens when two transactions are each waiting on a resource that the other transaction

Identify the candidate keys, Consider the following six relation schemes an...

Consider the following six relation schemes and their corresponding sets of functional dependencies. In each case identify a. All the candidate keys b. The highest normal for

Need some database of usa and uk, I want Database Of United Kingdom with Cr...

I want Database Of United Kingdom with Criteria of:\r\n\r\n1). Name, Number, City, State, Postal Code, Address, Email id, DOB.\r\n\r\n2). Unsecure Debts only adds Credit Card Payme

Please answer me., gyan gurukul is a software company that provides softwar...

gyan gurukul is a software company that provides software related solution.

The locking protocol, The Locking Protocol: To manage concurrency related ...

The Locking Protocol: To manage concurrency related problems we use locking. A lock is mainly a variable that is associated with a data item in the database. A lock can be located

Execute sql queries, Consider the relations described below: PHYSICIAN (re...

Consider the relations described below: PHYSICIAN (regno, name, telno, city) PATIENT (pname, street, city) VISIT (pname, regno, date_of_visit, fee) Where the regno and pname ide

Mixed fragmentation, Mixed fragmentation: Sometimes, horizontal fragmentati...

Mixed fragmentation: Sometimes, horizontal fragmentation or vertical fragmentation of a database schema by itself is insufficient to sufficiently distribute the data for some appli

B-tree, construct a b-tree for the following set of key values 2,3,5,7,11,1...

construct a b-tree for the following set of key values 2,3,5,7,11,17,19,23,29,31.assume that the tree is initial empty and the values are added in ascending order

Eliminate redundant data, Eliminate Redundant Data In the "Database Rel...

Eliminate Redundant Data In the "Database Relation" above, the primary key is made up of the D-ID and the Emp-ID. The database-name relies only on the D-ID. The similar databas

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd