Textbook ordering system, Database Management System

Assignment Help:

Question:

Consider the following database relations for a textbook ordering system used by a college bookshop:

Book (b-copy#, bname, ISBN#, author, price, subject)
Order (s#, b-copy#, order-date, payment)
Student (s#, sname, address, phone, course)

Assuming that:

?The attribute subject contained in the Book relation indicates the subject area a particular book belongs to. Examples of these subjects include 'programming', 'databases', 'operating systems', etc.

? The Student relation contains 1500 records;

? The Order relation contains 3500 records.

? The Book relation contains 4500 records. Each book copy has a unique number b-copy#. There are only 150 copies of "databases" books.

Provide the following:

(i) Express the following query in SQL:

"find all student names who have ordered any database book".

(ii) Choose two possible methods to evaluate the query, and use the relational algebra to formulate clearly all the steps required in the evaluation.

(iii) For each method, produce a query tree depicting all the steps.

(iv) For each method, calculate the number of tuples for all the intermediate relations (namely, size of the intermediate relations) required for each step.


Related Discussions:- Textbook ordering system

Explain the term- periodic recomputation, Explain the term- Periodic recomp...

Explain the term- Periodic recomputation Periodic recomputation:  Base values are often updated in bunches. Sometimes, it is possible to just recompute all derived attributes p

Nested query, what is correlation in nested query

what is correlation in nested query

File organisation and its types, File Organisation And Its Types  Just ...

File Organisation And Its Types  Just as arrays, trees, lists and other data structures are used to execute data Organisation in main memory, a number of planning's are used to

Method of analyzing association traversal, Analyzing Association Traversal ...

Analyzing Association Traversal Till now, we have supposed that associations are bi-directional. But in the case of traversal, it is in only one direction in any application,

Describe deductive databases and relational databases, Problem : (b) A ...

Problem : (b) A deductive database system is essentially the outcome of applying mathematics logic to database management, where logic is used for both data representation and

Partial relation emp-get the details people with min salary, Let consider t...

Let consider the given partial relation EMP. Let us make some sub-queries for them EMPNO ENAME JOB SAL DEPTNO 7566

Define decision tree classifiers, Define decision tree classifiers? As ...

Define decision tree classifiers? As the name suggests decision tree classifiers use a tree: Every leaf node has an associated class, and every internal node has a predicate as

Data control, Identify the need and use of data control through problem sol...

Identify the need and use of data control through problem solving, illustration

What is substitutability, What is substitutability? Any method of a cla...

What is substitutability? Any method of a class-say A can equally well be adjured with any object belonging to any subclasses B of A. This characteristic leads to code reuse, a

What is nested relational model, What is nested relational model? The n...

What is nested relational model? The nested relational model is an extension of relational model in which domains might be either atomic or relation valued.

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