Problem 1.3: Modify the column width and data type of the JOB field of EMP1 table.Problem 1.4: Create DEPT table with the following structure.NAMETYPEDEPTNONUMBER(2)DNAMEVARCHAR2(10)LOCVARCHAR2(10)DEPTNO as the PRIMARY KEYProblem 1.5: Add constraints to the EMP1 table that EMPNO as the PRIMARY KEY andDEPTNO as the FOREIGN KEY.Problem 1.6: Add constraints to the EMP1 table to check the EMPNO value whileentering (i.e) EMPNO > 100.Problem 1.7: Salary value by default is 5000, otherwise as entered values.Problem 1.8: Add a column DOB to the EMP1 table.Problem 1.9: DROP the column DOB from EMP1 table.Problem 1.10: Create the table EMP2 with all its columns from EMP1 using AS SELECTkeyword. Delete all its records and finally DROP the EMP2 (pseudo table).

Fist three problems will be solved. Please upload another question with the remaining parts. 1.3 The…

Problem 1.3: Modify the column width and data type of the JOB field of EMP1 tab Problem 1.4: Create DEPT table with the following structure. NAME TYPE DEPTNO NUMBER DNAME VARCHAR LOC VARCHAF DEPTNO as the PRIMARY KEY Problem 1.5: Add constraints to the EMP1 table that EMPNO as the PRIMARY KEY DEPTNO as the FOREIGN KEY.

Problem 1.3: Modify the column width and data type of the JOB field of EMP1 tab Problem 1.4: Create DEPT table with the following structure. NAME TYPE DEPTNO NUMBER DNAME VARCHAR LOC VARCHAF DEPTNO as the PRIMARY KEY Problem 1.5: Add constraints to the EMP1 table that EMPNO as the PRIMARY KEY DEPTNO as the FOREIGN KEY.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

1. Consider the following relational schema. Item(Item-id, Item-name, price, Inventory level) Order-items (order-id, item-id, quantity, unit-price) •Suppose a warehouse wishes to maintain a minimum inventory of each item; write a stored procedure that will take an item-id and order-id as input parameter and checks the inventory level of that particular item. If the inventory level of that item is minimum(less than 10) in the item table then an order should be placed with quantity 100 for that item in order-item relation.
Safe Datalog Rule: A Datalog rule is of the form:p :- q1, ..., qn. where n>0 and p is a positive atomic formula and q1, ..., and qn are positive or negative atomic formulas. A positive atomic formula is of the form:r(x1, ..., xm) and a negative atomic formulas of the form:not r(x1, ..., xm) where m>0 and r is a relation name and x1 , ..., xm are either numbers or variables. Relation names and variables are made up of alphabetic letters or digits and start with a lower-case alphabetic letter. Even though the variables are made up of lower and upper-case letters, these should be considered case-insensitive. For example, cno, CNO, cNO, etc all should be treated as the same variable. Some examples of Datalog rules are given below: ancestor(x1, y1) :- parent(x1, y1). teaches(tno,cno) :- faculty(tno), course(cno), assigned(tno,cno). p(x,y) :- q(2,x), r(u,45,z), s(a,b,22). p(x,y,z) :- q(x), not r(y,20), s(x,z). A Datalog rule is considered “Safe” if all variables that appear to the left…
Let relations r1(A, B, C) and r2(C, D, E) have the following properties: r1 has20,000 tuples, r2 has 45,000 tuples, 25 tuples of r1 fit on one block, and 30tuples of r2 fit on one block. Estimate the number of block transfers and seeksrequired using each of the following join strategies for r1 ⋈ r2: Merge join.
Problem 1 (Analyzing Student Database) The student_info.txt file (available on cuLearn) contains information for many randomly-generated students. The student information follows the structure given below: Student1_first_name Student1_last_name Student1_serial_number Student1_assignment_grade Student1_midterm_grade Student1_exam_grade Student2_first_name Student2_last_name Student2_serial_number Student2_assignment_grade Student2_midterm_grade Student2_exam_grade Download the student_info.txt and t6_p1.py files and put it in the same directory. If you accidentally introduce an error into the data file (i.e., break the structure some how), you can redownload it to get a fresh copy. Add the following functions to t6_p1.py file. Write and test a function called store_results(in_filename, out_filename) that takes two string input parameters for input filename and output filename. You function should read each student’s information from the in_filename (text…
Assume the relation CITIZEN(ID, Tax-Code, Salary, Age) storing information about UK citizens’ tax codes and annual salaries. There are r = 60,000,000 records. Each attribute has the same size: 128 bytes. The relation is stored in a file sorted by the salary attribute. The block size B = 1024 bytes and any pointer in the system has size = 128 bytes. The salary attribute is assumed to be uniformly distributed across tuples. There are 6,000 distinct salary values and there are 10,000 different tax-code values. The tax-code and age are assumed to be statistically independent of salary. A data scientist, who has built a Secondary Index over the Tax Code (non- ordering, non-key attribute), is interested in the specific Tax Code: ‘1234L’. The data scientist did analyse the distribution of the Tax Code attribute and noted the following: • Let X be the number of citizens with Tax Code 1234L per data block. That is, given a random block, there are X citizens with Tax Code 1234L. Objective:…
An INSTITUTE file of 5251 records is stored on the disk with block size of 1024 bytes. INSTITUTE records have 2 candidate keys which are INST_CODE (4 bytes long) and INST_NAME (30 bytes long), and the other 6 fields one of which is INST_PHONE (10 bytes long). Records in the INSTITUTE file are ordered by INST_CODE. Each INSTITUTE record is 128 bytes long. Assumme that an un-spanned organization is used, an indexed pointer is 6 bytes long. When searching for INSTITUTE records with respect to INST_CODE, how many block accesses are required on the average?
Let relations r1(A, B, C) and r2(C, D, E) have the following properties: r1 has20,000 tuples, r2 has 45,000 tuples, 25 tuples of r1 fit on one block, and 30tuples of r2 fit on one block. Estimate the number of block transfers and seeksrequired using each of the following join strategies for r1 ⋈ r2: Nested-loop join.
Solve 7,8 . Please fast Consider the following scheme Supplier (sid, Sname, rating) Parts (Pid, pname, color) Catalog (sid. Pid, cost) The catalog relation lists the prices charged for parts by suppliers. Write the following queues in relational algebra. (i) Find name of suppliers who supply some red part. (ii) Find the sids of suppliers who supply some red part or green part (iii) find the sids of supplier who supply some red part and some green part (iv) Find the sids of supplier who supply every part (v) Find the sids of suppliers who supply every red part (vi) Find the pids of parts supplied by two different supplier. (vii) Find pair of sids such that the supplier with the first sid charges more for some part than the supplier with the second sid. (viii) Find the sid of supplier who supply most expensive part.
What are the potential pitfalls of having excessively normalized data structures?
Explain discrete and overlapping constraints?
Describe the differences between overlapping and disjoint constraints.
Explain why page view is useful. Explain. 2-3 sentences.