Database System Concepts
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
Expert Solution & Answer
Book Icon
Chapter 15, Problem 8PE

Explanation of Solution

Sort-based algorithm for computing the relational division operation:

Suppose be two relations and has to be computed.

  • Sort relation “s” on “S” for sort-based algorithm. Sort relation “r” on (T, S).
  • Now, start scanning “r” and look at the “T” attribute values of the first tuple.
  • Scan “r” till tuples have same value of “T”. Also scan “s” simultaneously and check whether every tuple of “s” also occurs as the “S” attribute of “r”, in a fashion similar to merge join.
  • If this is the case, output that value of “T” and proceed with the next value of “T”.
  • Relation “s” may have to be scanned multiple times but “r” will only be scanned once.
  • Total disk accesses, after sorting both the relations, will be “|r| 9 N * |s|”, where “N” is the number of distinct values of “T” in “r”.

Hash-based algorithm for computing the relational division operation:

  • Let assume that for any value of “T”, all tuples in “r” with that “T” value fit in memory, and consider the general case at the end...

Blurred answer
Students have asked these similar questions
How can I type the Java OOP code by using JOptionPane with this following code below: public static void sellCruiseTicket(Cruise[] allCruises) { //Type the code here }
Draw a system/level-0 diagram for this scenario: You are developing a new customer relationship management system for the BEC store, which rents out movies to customers. Customers will provide comments on new products, and request rental extensions and new products, each of which will be stored into the system and used by the manager for purchasing movies, extra copies, etc. Each month, one employee of BEC will select their favorite movie pick of that week, which will be stored in the system. The actual inventory information will be stored in the Entertainment Tracker system, and would be retrieved by this new system as and when necessary. Example of what a level-0 diagram looks like is attached.
What is the value of performing exploratory data analysis in designing data visualizations? What are some examples?
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education