
Define each of the following terms:
- dynamic view
- correlated subquery
- materialized view
- base table
- Join
- equi-join
- self join
- outer join
- virtualized table

(a)
Define Dynamic View.
Explanation of Solution
Dynamic view is not a temporary table and its definition is stored in the system catalog. The content of this view is materialized as a result of an SQL query that uses the view.

(b)
Define Correlated Subquery.
Explanation of Solution
In SQL, Correlated subquery is a subquery that processes the inner query depending on the data from the outer query.

(c)
Define Materialized View.
Explanation of Solution
Materialized view is different from the dynamic view. It is stored on a disk and is refreshed when used or at some intervals. Copies of data is created in the same way as dynamic view.

(d)
Define Base Table.
Explanation of Solution
Base Table is a table from relational data model that contains the inserted raw data. These tables are correspond to those relations which are identified in the conceptual schema of database.

(e)
Define Join.
Explanation of Solution
Join is a relational operation that is used to combine two tables with a common domain into a single view or table.

(f)
Define Equi Join.
Explanation of Solution
Equi-join is a form of join in which the joining is performed on the basis of the equality between values in the columns that are common. Those common columns appear in the result table redundantly.

(g)
Define Self Join.
Explanation of Solution
Sometimes a join requires match of rows in a table with other rows in that same table which means joining of table with itself. This is known as self join.

(h)
Define Outer Join.
Explanation of Solution
Outer join is a form of join in which those rows are not included in the resulting table that do not have similar values in the common columns.

(i)
Define Virtualized Table.
Explanation of Solution
Virtualized tables are not maintained as the tables with real data. These are constructed automatically as the requirement of a DBMS.
Want to see more full solutions like this?
Chapter 6 Solutions
Modern Database Management
Additional Engineering Textbook Solutions
Computer Science: An Overview (13th Edition) (What's New in Computer Science)
Database Concepts (8th Edition)
Introduction To Programming Using Visual Basic (11th Edition)
Starting Out with C++ from Control Structures to Objects (9th Edition)
SURVEY OF OPERATING SYSTEMS
Concepts Of Programming Languages
- 4. Suppose we have a perfect binary tree with height h 0 representing a heap, meaning it = has n 2+1 1 keys indexed from 1 to 2+1 1. When we run convertomaxheap we run maxheapify in reverse order on every key with children. Let's examine the worst-case - In the worst-case every single key gets swapped all the way to the leaf level. (a) For each level in the tree there are a certain number of nodes and each of those nodes [10 pts] requires a certain number of swaps. Fill in the appropriate values/expressions in the table: Level Number of Keys Number of Swaps per Key 0 2 .. (b) Write down a sum for the total number of swaps required. This should involve h, not n. [10 pts] Totalarrow_forwardThe next problem concerns the following C code: /copy input string x to buf */ void foo (char *x) { char buf [8]; strcpy((char *) buf, x); } void callfoo() { } foo("ZYXWVUTSRQPONMLKJIHGFEDCBA"); Here is the corresponding machine code on a Linux/x86 machine: 0000000000400530 : 400530: 48 83 ec 18 sub $0x18,%rsp 400534: 48 89 fe mov %rdi, %rsi 400537: 48 89 e7 mov %rsp,%rdi 40053a: e8 di fe ff ff callq 400410 40053f: 48 83 c4 18 add $0x18,%rsp 400543: c3 retq 400544: 0000000000400544 : 48 83 ec 08 sub $0x8,%rsp 400548: bf 00 06 40 00 mov $0x400600,%edi 40054d: e8 de ff ff ff callq 400530 400552: 48 83 c4 08 add $0x8,%rsp 400556: c3 This problem tests your understanding of the program stack. Here are some notes to help you work the problem: ⚫ strcpy(char *dst, char *src) copies the string at address src (including the terminating '\0' character) to address dst. It does not check the size of the destination buffer. • You will need to know the hex values of the following characters:arrow_forward1234 3. Which line prevents compiler optimization? Circle one: 1234 Suggested solution: Store strlen(str) in a variable before the if statement. ⚫ Remove the if statement. Replace index 0 && index < strlen(str)) { 5 } } = str [index] = val;arrow_forward
- Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781305627482Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781285196145Author:Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos CoronelPublisher:Cengage Learning
- A Guide to SQLComputer ScienceISBN:9781111527273Author:Philip J. PrattPublisher:Course Technology PtrProgramming with Microsoft Visual Basic 2017Computer ScienceISBN:9781337102124Author:Diane ZakPublisher:Cengage Learning




