CS 411a/433a/538a Databases II Midterm, Oct. 18, Minutes. Answer all questions on the exam page. No aids; no electronic devices.

Similar documents
Administration Naive DBMS CMPT 454 Topics. John Edgar 2

Name: 1. (a) SQL is an example of a non-procedural query language.

Chapter 8: Enhanced ER Model

Chapter 11 Object and Object- Relational Databases

Chapter 8 The Enhanced Entity- Relationship (EER) Model

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

CSE344 Midterm Exam Winter 2017

MIDTERM EXAMINATION Spring 2010 CS403- Database Management Systems (Session - 4) Ref No: Time: 60 min Marks: 38

Chapter 9: Relational DB Design byer/eer to Relational Mapping Relational Database Design Using ER-to- Relational Mapping Mapping EER Model

QUIZ 1 REVIEW SESSION DATABASE MANAGEMENT SYSTEMS

CMP-3440 Database Systems

CMSC 461 Final Exam Study Guide

Midterm Exam. October 30th, :15-4:30. CS425 - Database Organization Results

; Spring 2008 Prof. Sang-goo Lee (14:30pm: Mon & Wed: Room ) ADVANCED DATABASES

Review for Exam 1 CS474 (Norton)

CS317 File and Database Systems

CSE 344 Final Examination

Relational Model: History

Unit 2. Unit 3. Unit 4

CS54100: Database Systems

Distributed DBMS. Concepts. Concepts. Distributed DBMS. Concepts. Concepts 9/8/2014

CS 327E Lecture 8. Shirley Cohen. February 22, 2016

Review -Chapter 4. Review -Chapter 5

Querying Data with Transact-SQL

CSE 344 Midterm. Monday, Nov 4, 2013, 9:30-10:20. Question Points Score Total: 100

Querying Data with Transact SQL

CS 146 Database Systems

CSCB20 Week 4. Introduction to Database and Web Application Programming. Anna Bretscher Winter 2017

A Sample Solution to the Midterm Test

Data about data is database Select correct option: True False Partially True None of the Above

Fundamentals of. Database Systems. Shamkant B. Navathe. College of Computing Georgia Institute of Technology PEARSON.

DATABASE MANAGEMENT SYSTEMS

CSE 414 Database Systems section 10: Final Review. Joseph Xu 6/6/2013

DSE 203 DAY 1: REVIEW OF DBMS CONCEPTS

Foundations of SPARQL Query Optimization

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

CSE 344 Midterm. Wednesday, Oct. 31st, 2018, 1:30-2:20. Question Points Score Total: 100

Information Management (IM)

Goals for Today. CS 133: Databases. Final Exam: Logistics. Why Use a DBMS? Brief overview of course. Course evaluations

CSE 344 Midterm Exam

Chapter (4) Enhanced Entity-Relationship and Object Modeling

Relational Databases

High Level Database Models

Conceptual Design with ER Model

Informationslogistik Unit 4: The Relational Algebra

Week. Lecture Topic day (including assignment/test) 1 st 1 st Introduction to Module 1 st. Practical

DISCUSSION 5min 2/24/2009. DTD to relational schema. Inlining. Basic inlining

CIS 330: Applied Database Systems. ER to Relational Relational Algebra

M S Ramaiah Institute of Technology Department of Computer Science And Engineering

Database Systems Management

Relational Model, Relational Algebra, and SQL

The Entity-Relationship Model. Steps in Database Design

Chapter 3. The Relational Model. Database Systems p. 61/569

CSE 344 Midterm. Wednesday, Nov. 1st, 2017, 1:30-2:20. Question Points Score Total: 100

The Entity-Relationship Model

Copyright 2007 Ramez Elmasri and Shamkant B. Navathe Slide 25-1

Database Management Systems Paper Solution

Relational Algebra. Procedural language Six basic operators

Assignment Session : July-March

Chapter 6 - Part II The Relational Algebra and Calculus

Review The Big Picture

Database Management

Chapter 4. Enhanced Entity- Relationship Modeling. Enhanced-ER (EER) Model Concepts. Subclasses and Superclasses (1)

COSC 304 Introduction to Database Systems Enhanced Entity-Relationship (EER) Modeling

CSE 562 Midterm Solutions

Relational model continued. Understanding how to use the relational model. Summary of board example: with Copies as weak entity

SQL DDL. CS3 Database Systems Weeks 4-5 SQL DDL Database design. Key Constraints. Inclusion Constraints

ADVANCED DATABASES ; Spring 2015 Prof. Sang-goo Lee (11:00pm: Mon & Wed: Room ) Advanced DB Copyright by S.-g.

Query Decomposition and Data Localization

Conceptual Design. The Entity-Relationship (ER) Model

Systems:;-'./'--'.; r. Ramez Elmasri Department of Computer Science and Engineering The University of Texas at Arlington

EECS 647: Introduction to Database Systems

D.K.M COLLEGE FOR WOMEN(AUTONOMOUS),VELLORE DATABASE MANAGEMENT SYSTEM QUESTION BANK

Database Management Systems

CS 4604: Introduction to Database Management Systems. B. Aditya Prakash Lecture #5: Entity/Relational Models---Part 1

Copyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley. Chapter 6 Outline. Unary Relational Operations: SELECT and

Relational Model 2: Relational Algebra

CS 344/444 Computer Network Fundamentals Midterm Exam Spring /07/2007

Database Management

The Entity-Relationship Model (ER Model) - Part 2

ER to Relational Mapping

Mobile and Heterogeneous databases


CSE344 Midterm Exam Fall 2016

The Extended Algebra. Duplicate Elimination. Sorting. Example: Duplicate Elimination

What s a database system? Review of Basic Database Concepts. Entity-relationship (E/R) diagram. Two important questions. Physical data independence

CSE 344 MAY 7 TH EXAM REVIEW

CSE 344 Midterm. Wednesday, February 19, 2014, 14:30-15:20. Question Points Score Total: 100

8) A top-to-bottom relationship among the items in a database is established by a

CS 338 The Enhanced Entity-Relationship (EER) Model

RELATIONAL ALGEBRA. CS 564- Fall ACKs: Dan Suciu, Jignesh Patel, AnHai Doan

MaanavaN.Com DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING QUESTION BANK

Introduction to Databases CS348

Midterm Examination CS 265 Spring 2015 Name: KEY Total on any question cannot exceed 5 and cannot be less than 0 JPK, CK, JDK

Informatics 1: Data & Analysis

Introduction to Databases Fall-Winter 2009/10. Syllabus

CMPT 354 Database Systems I

Tutorial notes on. Object relational structural patterns

CS 245 Midterm Exam Winter 2014

Querying Microsoft SQL Server 2014

Transcription:

1 Name: Student ID: CS 411a/433a/538a Databases II Midterm, Oct. 18, 2006 50 Minutes Answer all questions on the exam page No aids; no electronic devices. he marks total 55 Question Maximum Your Mark 1 25 2 16 3 9 4 5 otal 55

Name: 2 1. (25 marks) For each of the following, state whether the statement is true or false. If it is false, correct the statement without changing the underlined text. If the statement is true, do not write anything more, just indicate true. (a) Object-oriented databases grew out of advanced ideas from the operating systems area. F, from ooprogramming or semantic data models1 (b) he word object-oriented in object-oriented databases refers to the query language. F, the data model (c) o be considered a distributed database, a system must include more than one data model. F, must have data on more than one site (d) he semi-join operator in relational algebra is a fancy notation for right outer join. F, is a notation to help define derived horizontal fragments in distributed databases, or is an operator used in distributed databases (e) he conceptual schema is part of the software architecture of a database management system. F, part of the data architecture (f) A distributed database system is said to be heterogeneous if its component computer systems have different operating systems. F, if the component database systems are different (g) For horizontal fragmentation, we guarantee reconstruction by having 2 fragments defined by predicates that are the negation of one another. (h) For vertical fragmentation, we use union to reconstruct the original relation. F, natural join (i) he entity and relationship in the ER model are examples of aggregation. (j) Persistence by reachability means that all objects you want to reach are made persistent. F, means that all objects connected to a persisten anchor point are guaranteed to be persistent (k) With inheritance in an OO system, a subclass inherits methods but not attributes. F, inherits both attributes and methods (l) Closure in a query language means that every query runs to completion. F, means that the result of every query can be used as input to another query (m) If two object references compare true for identity, then they will also compare true for equality. (n) Path expressions are used only to see the top-level attributes of an object, in an OO query language. F, attributes at any level of nesting, also methods

Name: 3 2. (16 marks) Consider the following O 2 schema: class User inherit Object public type tuple(name: string, domain: string, inbox: list(email)) end; class Email inherit Object public type tuple(from: User, to: User, subject: string, message: string, cc: unique set(user)) end; (a) Show the AGGREGAION HIERARCHY for an instance of a User, whose name is Bob, domain is gaul, who has a single email message in his inbox, (which is obviously to Bob @ gaul), which is from Alice in domain csd, the subject of which is Hi there, the message of which is c u later?, and which has been cc d to Sam at gaul and Pat at gaul. Any attribute values not mentioned can be assumed to be blank or null. User name domain inbox Bob gaul < > optional Email from to subject message cc Hi there c u later {, } User User User name domain inbox name domain inbox name domain inbox Alice csd < > Sam gaul < > Pat gaul < > (b) What class above contains a set-valued attribute? email

Name: 4 3. (9 marks) Consider the following relations for a relational database: Messages(FromName, FromDomain, oname, odomain, MessageID, Subject, Content) primary key: {MessageID} EmailsCCd(CCName, CCDomain, MessageID} primary key: all attributes (a) Give the relational algebra expression for the fragment of the Messages relation where the attribute odomain has the value of gaul. A σ odomain= gaul (Messages) (b) What kind of fragmentation is being done in part (a)? horizontal 1 mark (c) Give the relational algebra expression which goes along with your fragment in part (a) to guarantee completeness of the fragmentation. C σ odomain gaul (Messages) 1 mark, various forms of not taken (d) Give the relational algebra expression which reconstructs the Messages relation from your fragments in parts (a) and (c). A C 1 mark (e) Give the relational algebra expression to produce that part of the EmailsCCd relation which will participate in the join with the fragment in part (a). EmailsCCd < Messages (f) What is the fragmentation in part (e) called? derived horizontal fragmentation

Name: 5 4. (5 marks) Answer ONE of the following (only the first one will be marked): (a) Explain the reason for viewing Distribution, Heterogeneity and Autonomy as orthogonal concepts on separate axes in a diagram. (b) Why, in distributed databases, do designers bother with fragmentation? (c) Give 2 ways in which dealing with an object-oriented database differs from programming in an object-oriented programming language. (d) Explain why doing operations like relational algebra projection presents a problem for the implementors of object-oriented database systems to solve.