7 Million Study Materials
From students who've taken these classes before
From students who've taken these classes before
24/7 Access to Tutors
Personal attention for all your questions
Personal attention for all your questions
Learn
93% of our members earn better grades
93% of our members earn better grades
Colorado State | CS 430
Database Systems Lab
Professors
- Schauble
19 sample documents related to CS 430
-
Colorado State CS 430
How to Use MySQL CS430 March 18, 2003 SQL: \"Structured Query Language\"-the most common standardized language used to access databases. SQL has several parts: DDL Data Definition Language cfw_Defining, Deleting, Modifying relation schemas DML Data Manipula -
Colorado State CS 430
Example Query (Slide 4.33, SKS, p. 153) Schema: Query: Find all customers who have an account at all branches located in Brooklyn. Authors\' Answer: select distinct S.customer-name from depositor as S where not exists ( (select branch-name from branch wher -
Colorado State CS 430
CS 430 DL: Normal Forms Functional Dependencies: Index (Adapted from CoBeSt1999, Date2001, Date2004, ElmNav2004, KiBeLe2005, ONeils2001, RaGeLe2003, SiKoSu2002) Functional Dependencies: Index Basic Definitions Armstrong\'s Axioms Implications of Armstrong\' -
Colorado State CS 430
CS 430 DL: Course Notes Entity-Relationship Diagrams Entities: Attributes: Composite Attributes: Relationships: The IsA Relationship: Structural Constraints on Relationships: Colorado State University, Fort Collins, CO 80523 USA 2008 Colorado State Univer -
Colorado State CS 430
CS 430: DATABASE MANAGEMENT SYSTEMS Assignment 6: Buer Manager Due: April 14, 2009 1 Introduction This original assignment is designed by University of Wisconsin-Madison. In our revised assignment, you will implement a simplied version of the Bue -
Colorado State CS 430
CS 430 Database Systems Homework Assignment 2 - Due February 12, Thursday 1. Given two relations R1 and R2, where R1 contains N1 tuples and R2 contains N2 tuples, and N2 > N1 > 0, give the maximum and minimum possible sizes (in tuples) for the resul -
Colorado State CS 430
CS 430 Database Systems Homework Assignment 1 - Due February 3, 2009 Tuesday You have to design a database for the Company Prescriptions R-X. The details are given below. Patients are identified by an SSN, and their names, addresses, and ages must b -
Colorado State CS 430
CS 430 Database Systems Homework Assignment 4 - Due 02/26/2009 1. (a) Does the FD X Z follow from {X Y, X W, WY Z}? (b) Does the FD XW Z follow from {XY Z, Y W, WY Z}? 2. Consider the relation r below: A B C D E a1 b1 c 1 d1 e 1 a1 b2 c 2 -
Colorado State CS 430
HOMEWORK 3 SOLUTION CS430 Each one cost 9 points exepct question i) for 10 points. All queries are tested by Jason; you can play with your query using xing.sql. a) SELECT E.classnum FROM Enrollment E, Student S WHERE S.ssn = E.student_ssn AND S.snam -
Colorado State CS 430
Homework 4 Solution March 4, 2009 Question 1-7 and 9: 10 points/each. Question 8 a) and b): 5 points/each. Question 8 c) and d): 10 points/each. 1. (a) YES. X+ = XYWZ (b) No. (XW)+ = XW, Z is not in there. 2. r satises AD B, C DE, CD A, AE B. But -
Colorado State CS 430
How to Use MySQL CS430 March 18, 2003 SQL: Structured Query Languagethe most common standardized language used to access databases. SQL has several parts: DDL Data Definition Language {Defining, Deleting, Modifying relation schemas} DML Data Manip -
Colorado State CS 430
!\"#$%*+, !\"#$%(%$/ !\"#$%(%$/)\'(23)4#25%!.+/0+3456378<: ><9A;>><*+,<?@ JK.+DFE=H78<?? B -
Colorado State CS 430
CS 430 Database Systems Sample Assignment on B+ Trees 5 1. Consider the B+ tree index of order d 2 shown in Figure 1. The leaf nodes are doubly linked. Each leaf node also points to the data blocks (not shown). Root 50 8 18 32 40 73 85 1 2 -
Colorado State CS 430
CS 430 Database Systems Solution for Assignment 2 1. Given two relations R1 and R2, where R1 contains N1 tuples and R2 contains N2 tuples, and N2 N1 0, give the maximum and minimum possible sizes (in tuples) for the result relation produced by each -
Colorado State CS 430
CS 430 Database Systems Homework Assignment 3 - Due 02/19/2009 1. Consider the following University Database schema: Department(dcode: string, dname: string, chair ssn: integer) Course(dcode: string, cnum: integer, title: string, credits: integer) P -
Colorado State CS 430
Homework 2 Solution February 25, 2009 Q1: Min and Max sizes. 10 points 1. Max: N1+N2, N1 has no shared tuples as N2. Min: N2, R1 is a subset of R2. 2. Max: N1, R1 is a subset of R2. Min: 0, no common tuples. 3. Max: N1, no common tuples. Min: 0, R1 i -
Colorado State CS 430
CS 430 Database Systems Homework Assignment 5 - Due 04/07/2009 1. Suppose we have an index consisting of 50,000 entries. Only 30 such index entries t in a block. Create a multilevel index such that the highest level index ts in one block. 2. (a) Ass -
Colorado State CS 430
CS 430: DATABASE MANAGEMENT SYSTEMS Assignment 7: Heap Files Due: April 28, 2009 1 Introduction This original assignment is designed by University of Wisconsin-Madison. We use Minibase in this revised assignment. Minibase is a small relational DB -
Colorado State CS 430
Homework 5 Solution April 7, 2009 Q1: Multilevel Index 20 points 1. 1st level index requires 50, 000/30 = 1667 blocks. 2. 2nd level index requires 1667/30 = 56 blocks. 3. 3rd level index requires 56/30 = 2 blocks. 4. 4th level index requires 1 block
7,000,000 study materials • 24/7 tutors • earn better grades