Equi join-table handling, Database Management System

Assignment Help:

Equi Join: A join in which the joining condition is based on equality among values in the common columns. Common columns show (redundantly) in the result table. Let us Consider the following relations:

  • Customer (custid, custname, ...........) and
  • Order (custid, ordered,....................)

Example: What are the names of all customers who have placed orders?

The needed information is available in two tables, customer and order. The SQL solution needs joining the two tables by using equi join.

 SELECT CUSTOMER.CUTOID, ORDER.CUSTOID, CUSTONAME, ORDERID

FROM CUSTOMER, ORDER

WHERE CUSTOMER.CUSTOID=ORDER.CUSTOID;

The output might be:

Customer.custoid

order.custoid

custoname

orderid

--------------------------

------------------

-----------------------

----------

10

10

Pooja Enterprises

1001

12

12

Estern Enterprises

1002

3

3

Impressions

1003

 

 

 

 


Related Discussions:- Equi join-table handling

Ldb hierarchy there should exist one get statement, It is mandatory that fo...

It is mandatory that for every table in the LDB hierarchy there should exist one GET statement in the report. False.  It is not essential.

Hoework, Farmer Bob, Farmer Jane and Farmer Jose run a cow farming co-op. ...

Farmer Bob, Farmer Jane and Farmer Jose run a cow farming co-op. For every cow they keep the cow’s name, age (or date of birth), breed and numbered plastic ear tag. The each of t

ER Diagram, A database will be made to store information about patients in ...

A database will be made to store information about patients in a hospital. On arrival, each patient’s personal details (name, address, and telephone number) are recorded where poss

Describe the ways for selecting data structure, Ways for Selecting Data Str...

Ways for Selecting Data Structure Algorithms operate on data structure. Therefore, selection of the best algorithm means selecting the best data structure from whole bunch. Th

What is the object-oriented decompositions, Object-oriented decompositions ...

Object-oriented decompositions Object-oriented decompositions of systems better are able to cope with change. Each subsystem has a well-defined interface which communicates with

Explain b-tree, What is B-Tree? A B-tree eliminates the redundant stora...

What is B-Tree? A B-tree eliminates the redundant storage of search-key values .It permits search key values to appear only once.

Having clause with sub queries, Having Clause with sub queries: First we h...

Having Clause with sub queries: First we have to recollect the GROUP BYclause. The following query searches the minimum salary in every department. SELECT DEPTNO, MIN (SAL)

Design and building a distributed information system, prototype of a distri...

prototype of a distributed information system for a national car part retail outlet chain.

What is conceptual schema, What is Conceptual Schema? Conceptual Schema...

What is Conceptual Schema? Conceptual Schema - Conceptual schema elaborates the structure of the overall database for a community of users. It hides the details of physical sto

Explain retrieval in qbe, Explain retrieval in QBE? Retrieval in QBE : ...

Explain retrieval in QBE? Retrieval in QBE : A "GUI" for expressing queries. Based on the Domain Relational Calculus (DRC) Actually invented before GUIs. Very co

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