Having clause-data manipulation language, Database Management System

Assignment Help:

Having clause

  • This clause is used for producing conditions on grouped information.

Example: Find maximum salary and department number of those departments where maximum salary is more than Rs 20000/-.

SELECT DEPTNO, MAX(SAL) FROM EMP

GROUP BY DEPTNO HAVING MAX(SAL) > 20000;

 

 


Related Discussions:- Having clause-data manipulation language

What is gathering information and producing erd, What is Gathering informat...

What is Gathering information and Producing ERD Gathering information: This could be a written document that explains the system in question with reasonable quantity of detai

Describe participation constraints, Describe Participation Constraints? ...

Describe Participation Constraints? Participation Constraints - The participation constraint exacts whether the existence of an entity depends on its being related to another

System Analysis and design, Using the questions found at the end of Chapter...

Using the questions found at the end of Chapter 9 in your textbook, complete this homework activity. Students will submit a Word document answering questions 2, 3, and 4.

Update operations, The Update Operations : Update operations are used fo...

The Update Operations : Update operations are used for altering database values. The constraint violations faced by this operation are logically the similar as the problem faced

Consistency error-database errors, Consistency error : These errors happen ...

Consistency error : These errors happen due to the inconsistent state of database caused may be due to wrong implementation of commands or in case of a transaction abort.  To overc

Define the wait for graph, Define the Wait for graph Ans: The wait-for-...

Define the Wait for graph Ans: The wait-for-graph is a directed graph and consist of nodes and directed arcs; the nodes of the graph are active transactions. An arc of the grap

Compare three clustering algorithms in weka, Compare three clustering algor...

Compare three clustering algorithms in Weka. For this comparison, you will need to use at least two different datasets. Run the algorithms on the datasets, and use the visual

Lossless-join decomposition, Lossless-Join Decomposition   Let us sh...

Lossless-Join Decomposition   Let us show an intuitive decomposition of a relation. We require a better basis for deciding decompositions since intuition may not always be r

Functional dependencies, CAR SALE (Car_id, Option_type, Option_listprice, S...

CAR SALE (Car_id, Option_type, Option_listprice, Sale_date, Option_discountedprice) This relation refers to options installed in cars (e.g., cruise control) that were sold at a de

Define upgrade and downgrade, Define upgrade and downgrade? It gives a ...

Define upgrade and downgrade? It gives a mechanism for conversion from shared lock to exclusive lock is called as upgrade. It gives a mechanism for conversion from exclusive

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