Question 1: Basic Concepts (40 %)

Slides:

Advertisements

Similar presentations

DB glossary (focus on typical SQL RDBMS, not XQuery or SPARQL)

Advertisements

Database Languages Chapter 7. The Relational Algebra.

Introduction to Database System Wei-Pang Yang, IM.NDHU, Final Test-1 Example: Banking Database 1. branch 2. customer 客戶 ( 存款戶, 貸款戶 ) 5. account.

1 Welcome: To the fifth learning sequence “ Possible representation (2) “ Recap : In the previous learning sequence, we discussed four possible representations.

Unit 5 The Network Model  5.1 The Network Model  5.2 IDMS.

The Relational Model and Relational Algebra Nothing is so practical as a good theory Kurt Lewin, 1945.

Chapter 3 An Introduction to Relational Databases.

中央大學。范錚強 1 從 ER 到 Logical Schema 國立中央大學資訊管理系范錚強 2002.

國立聯合大學電機工程學系專題製作競賽 ( 應用物理組 ) 主講人：林家賢組員：林俊宏黃建彰中華民國九十六年五月十二日.

1 專題研究暨南大學資訊工程學系黃光璿 2009/05/19. 2 主題製作下一版的暨大教師著作檢索系統暨大教師著作檢索系統  目前圖書館的系統已蒐錄暨大教師 SCI/SSCI/AHCI/TSSCI 著作目錄  全文連結將於近日可透過認證下載  未來可囊跨 EI/CPCI 著作.

IST Databases and DBMSs Todd S. Bacastow January 2005.

Introduction to Database System Wei-Pang Yang, IM.NDHU, Midterm Test-1 Example: Banking Database 1. branch 2. customer 客戶 ( 存款戶, 貸款戶 ) 5. account.

Data Manipulation 11 After this lecture, you should be able to:  Understand the differences between SQL (Structured Query Language) and other programming.

TM 7-1 Copyright © 1999 Addison Wesley Longman, Inc. Physical Database Design.

Chapter 10 Views. Topics in this Chapter What are Views For? View Retrievals View Updates Snapshots SQL Facilities.

File Organization and Storage Structures Chapter 5.

3 1 Chapter 3 The Relational Database Model Database Systems: Design, Implementation, and Management, Sixth Edition, Rob and Coronel.

Introduction to Database System Wei-Pang Yang, IM.NDHU, Final Test-1 Example: Banking Database 1. branch 2. customer 客戶 ( 存款戶, 貸款戶 ) 5. account.

 2001 Prentice Hall Business Publishing, Accounting Information Systems, 8/E, Bodnar/Hopwood A field may be a single character or number, or it.

Unit 5 The Network Model  5.1 Data Modeling Issues  5.2 The Network Model  5.3 IDMS.

Introduction to Database System Wei-Pang Yang, IM.NDHU, Midterm Test-1 Example: Banking Database 1. branch 2. customer 客戶 ( 存款戶, 貸款戶 ) 5. account.

國立東華大學資訊管理學系資料庫管理試題 Wei-Pang Yang, IM.NDHU, /6/20 Final Test-1 Suppose we have a relationship set borrower between customer and loan as shown.

Foundations of Business Intelligence: Databases and Information Management.

Index in Database Unit 12 Index in Database 大量資料存取方法之研究 Approaches to Access/Store Large Data 楊維邦博士國立東華大學資訊管理系教授.

Introduction to Database System Wei-Pang Yang, IM.NDHU, Midterm Test-1 Example: Banking Database 1. branch 2. customer 客戶 ( 存款戶, 貸款戶 ) 5. account.

3 1 Database Systems The Relational Database Model.

Introduction to Database System Wei-Pang Yang, IM.NDHU, Midterm Test-1 Example: Banking Database 1. branch 2. customer 客戶 ( 存款戶, 貸款戶 ) 5. account.

Introduction to Database System Wei-Pang Yang, IM.NDHU, Midterm Test-1 Example: Banking Database 1. branch 2. customer 客戶 ( 存款戶, 貸款戶 ) 5. account.

Data Integrity & Indexes / Session 1/ 1 of 37 Session 1 Module 1: Introduction to Data Integrity Module 2: Introduction to Indexes.

Introduction to Databases

Databases and DBMSs Todd S. Bacastow January

國立臺北科技大學課程：資料庫系統 Chapter 2 Database Environment.

CS4222 Principles of Database System

“ Possible representation (3) “

Lecture 3 : Structured Query Language (SQL)

Chapter # 14 Indexing Structures for Files

Indexes By Adrienne Watt.

Indexing Goals: Store large files Support multiple search keys

Indexing and hashing.

UNIT 11 Query Optimization

Storage and Indexes Chapter 8 & 9

Database Concepts Relational Databases Start ….

CIS 207 The Relational Database Model

CHAPTER 5: PHYSICAL DATABASE DESIGN AND PERFORMANCE

Introduction to Database

國立臺北科技大學課程：資料庫系統 fall Chapter 18

File organization and Indexing

Chapter 11: Indexing and Hashing

Introduction to Database

Physical Database Design

國立東華大學試題系所：資訊管理學系科目：資料庫管理第1頁/共6頁

پايگاه داده ها.

The Physical Design Stage of SDLC (figures 2.4, 2.5 revisited)

Unit 7 Normalization (表格正規化).

The Relational Database Model

Database Design Hacettepe University

“ Possible representation (2) “

Query Optimization.

“ Possible representation (1) “

Database Dr. Roueida Mohammed.

Example: Banking Database

Question 1: Basic Concepts (45 %)

Unit 12 Index in Database 大量資料存取方法之研究 Approaches to Access/Store Large Data 楊維邦博士國立東華大學資訊管理系教授.

Chapter 11: Indexing and Hashing

Course Instructor: Supriya Gupta Asstt. Prof

Review #1 Intro stuff What is a database, 4 parts, 3 users, etc.

Unit 12 Index in Database 大量資料存取方法之研究 Approaches to Access/Store Large Data 楊維邦博士國立東華大學資訊管理系教授.

Presentation transcript:

Question 1: Basic Concepts (40 %) 國立東華大學試題: 高等資料庫系統系所：資管所日期：2009年12月1日第1頁/共4頁 Question 1: Basic Concepts (40 %) What is the Entity Integrity Rule? Explain what is the Referential Integrity Rule? Discuss the update operations on views of the relational model. What are the advantages of the View? What information are stored in the System Catalog for a database? What is “SSA: Segment Search Arguments” in the Hierarchical Database Model? IDMS, Communication Block is similar to SQLCA in DB2, please explain it? Logic Data Independence Clustering Index Cursor in Embedded SQL

Question 2: Relational Algebra (20 %) Draw the simple diagrams to show the 8 operations of the Relational Algebra. Relational Algebra is a procedure language or an non-procedure? Why? How to define the non-primitive operator JOIN by the following primitive operators? 1. UNION 2. DIFFERENCE 3. CARTESIAN PRODUCT 4. RESTRICT 5. PROJECT 討論 Relational Algebra and Relational Calculus 之異同，並說明它們與 SQL 之關係

Question 3: Indexing with Multiple Fields (20 %) Consider the following relation with two indexes: Fig. 6.3: Indexing the supplier file on both CITY and STATUS. London Paris Athens S1 S2 S3 S4 S5 Smith Jones Blake Clark Adams 20 10 30 CITY-index S Status-index Explain the procedure to do the query: “Find the supplier number of suppliers in Paris?” step by step and show the output results. How many disk I/O are needed to get S3 if we query: “Find the supplier number of suppliers in Paris”? Explain the procedure to do the query: “Find the suppliers in Paris with status 30?” step by step and show the output results.

Question 4: About B+-tree (Knuth's variation) (20 %) 50 82 96 97 99 91 93 94 89 94 83 85 89 71 78 82 60 62 70 51 52 58 58 70 35 40 50 15 18 32 6 8 12 12 32 index set (nondense) Sequence set (with pointers to data records) (dense or nondense) - Explain the “nondense” in the index set? Explain the meaning of “with pointers to data records” In the B+-tree, how to print out all records by the order of the primary keys? 討論 B+-tree and B-tree 之異同?