CE223 Database Systems Introduction

Slides:



Advertisements
Similar presentations
1 More SQL Defining a Database Schema Views. 2 Defining a Database Schema uA database schema comprises declarations for the relations (“tables”) of the.
Advertisements

1 CS145 Introduction About CS145 Relational Model, Schemas, SQL Semistructured Model, XML.
Winter 2002Arthur Keller – CS 1809–1 Schedule Today: Jan. 31 (TH) u Constraints. u Read Sections , Project Part 3 due. Feb. 5 (T) u Triggers,
Winter 2002Arthur Keller – CS 18018–1 Schedule Today: Mar. 12 (T) u Semistructured Data, XML, XQuery. u Read Sections Assignment 8 due. Mar. 14.
Semi-structured Data. Facts about the Web Growing fast Popular Semi-structured data –Data is presented for ‘human’-processing –Data is often ‘self-describing’
Fall 2001Arthur Keller – CS 18017–1 Schedule Nov. 27 (T) Semistructured Data, XML. u Read Sections Assignment 8 due. Nov. 29 (TH) The Real World,
1 XML Semistructured Data Extensible Markup Language Document Type Definitions.
CPSC-608 Database Systems Fall 2008 Instructor: Jianer Chen Office: HRBB 309B Phone: Notes #3.
CPSC-608 Database Systems Fall 2011 Instructor: Jianer Chen Office: HRBB 315C Phone: Notes #2.
1 Advanced Topics XML and Databases. 2 XML u Overview u Structure of XML Data –XML Document Type Definition DTD –Namespaces –XML Schema u Query and Transformation.
1 XML Semistructured Data Extensible Markup Language Document Type Definitions.
SCUHolliday - coen 1789–1 Schedule Today: u Constraints, assertions, triggers u Read Sections , 7.4. Next u Triggers, PL/SQL, embedded SQL, JDBC.
CSCE 520- Relational Data Model Lecture 2. Relational Data Model The following slides are reused by the permission of the author, J. Ullman, from the.
Winter 2006Keller, Ullman, Cushing18–1 Plan 1.Information integration: important new application that motivates what follows. 2.Semistructured data: a.
1 CE223 Database Systems Introduction DBMS Overview, Relational Model, Schemas, SQL Semistructured Model, XML.
Constraints on Relations Foreign Keys Local and Global Constraints Triggers Following lecture slides are modified from Jeff Ullman’s slides
Winter 2006Keller, Ullman, Cushing9–1 Constraints Commercial relational systems allow much more “fine-tuning” of constraints than do the modeling languages.
1 CS1368 Introduction* Relational Model, Schemas, SQL Semistructured Model, XML * The slides in this lecture are adapted from slides used in Standford's.
RELATIONAL DATA MODEL 1. 2 What is a Data Model? 1.Mathematical representation of data. wExamples: relational model = tables; semistructured model = trees/graphs.
1 Introduction Relational Model, Schemas, SQL Semistructured Model, XML The slides were made by Jeffrey D. Ullman for the Introduction to Databases course.
SCUHolliday - coen 1788–1 Schedule Today u Modifications, Schemas, Views. u Read Sections (except and 6.6.6) Next u Constraints. u Read.
Jeff Ullman: Introduction to XML 1 XML Semistructured Data Extensible Markup Language Document Type Definitions.
Semistructured Data Extensible Markup Language Document Type Definitions Zaki Malik November 04, 2008.
Chapter 23 XML. 2 Introduction  XML: eXtensible Markup Language (What is a Markup language?)  Defined by the WWW Consortium (W3C)  Originally intended.
1 Database Systems Defining Database Schema Views.
Lu Chaojun, SJTU Relational Data Model 1. Lu Chaojun, SJTU What’s a Data Model? A notation (collection of conceptual tools) for describing data as seen.
CSCE 520- Relational Data Model Lecture 2. Oracle login Login from the linux lab or ssh to one of the linux servers using your cse username and password.
1 Introduction to SQL Database Systems. 2 Why SQL? SQL is a very-high-level language, in which the programmer is able to avoid specifying a lot of data-manipulation.
Databases : SQL-Schema Definition and View 2007, Fall Pusan National University Ki-Joune Li These slides are made from the materials that Prof. Jeffrey.
SCUHolliday - coen 1789–1 Schedule Today: u Constraints, assertions, triggers u Read Sections , 7.4. Next u Embedded SQL, JDBC. u Read Sections.
Database Design and Programming Jan Baumbach Adopted from previous slides of Peter Schneider-Kamp.
1. 2 Design of databases. E/R model (entity-relationship model) Relational model (tables) UML (unified modeling language) Database programming. SQL, Relational.
CMPT 354 Database Systems I
CPSC-310 Database Systems
Database Design and Programming
Relational Data Model Lu Chaojun, SJTU.
Schedule Today: Jan. 28 (Mon) Jan. 30 (Wed) Next Week Assignments !!
Slides are reused by the approval of Jeffrey Ullman’s
CPSC-310 Database Systems
Computational Biology
What is sql?.
COP4710 Database Systems Relational Model.
Foreign Keys Local and Global Constraints Triggers
CPSC-310 Database Systems
Introduction to Database Systems, CS420
Database Design: DBS CB, 2nd Edition
Introduction to Database Systems, CS420
Database Design and Programming
CPSC-310 Database Systems
CPSC-608 Database Systems
CS 440 Database Management Systems
CPSC-608 Database Systems
Database Models Relational Model
CPSC-310 Database Systems
CPSC-310 Database Systems
SQL OVERVIEW DEFINING A SCHEMA
IT 244 Database Management System
2018, Fall Pusan National University Ki-Joune Li
Defining a Database Schema
CMSC-461 Database Management Systems
The Relational Data Model
CS4433 Database Systems Relational Model.
CS 405G Introduction to Database Systems
CPSC-608 Database Systems
CPSC-608 Database Systems
CMSC-461 Database Management Systems
Instructor: Zhe He Department of Computer Science
Select-From-Where Statements Multirelation Queries Subqueries
2019, Fall Pusan National University Ki-Joune Li
Presentation transcript:

CE223 Database Systems Introduction DBMS Overview, Relational Model, Schemas, SQL Semistructured Model, XML

Content of CE223 Design of databases. Database programming. E/R model, relational model, semistructured model, XML, UML, ODL. Database programming. SQL, Relational algebra, Datalog. Not DBMS implementation (you can ask though).

Textbook “Situation” The closest text for the course is First Course in Database Systems/3rd Edition. Buy it from the Bookstore. First 2 chapters available on-line Syllabus on the web

Lab: MySql (Open Source & Free) PHP Lab Instuctors: To be announced

Do You Know SQL? Explain the difference between: SELECT b FROM R WHERE a<10 OR a>=10; and FROM R; a b 20 30 40 … … R

And How About These? SELECT a FROM R, S WHERE R.b = S.b; FROM R WHERE b IN (SELECT b FROM S);

What is a Database?

Overview of a DBMS

Overview DBMS

Transactions

Interesting Stuff About Databases It used to be about boring stuff: employee records, bank records, etc. Today, the field covers all the largest sources of data, with many new ideas. Web search. Data mining. Scientific and medical databases. Integrating information.

More Interesting Stuff Database programming centers around limited programming languages. Only area where non-Turing-complete languages make sense. Leads to very succinct programming, but also to unique query-optimization problems.

Still More … You may not notice it, but databases are behind almost everything you do on the Web. Google searches. Queries at Amazon, eBay, etc.

And More… Databases often have unique concurrency-control problems . Many activities (transactions) at the database at all times. Must not confuse actions, e.g., two withdrawals from the same account must each debit the account.

What is a Data Model? Mathematical representation of data. Examples: relational model = tables; semistructured model = trees/graphs. Operations on data. Constraints.

A Relation is a Table name manf Winterbrew Pete’s Attributes (column headers) name manf Winterbrew Pete’s Bud Lite Anheuser-Busch Beers Tuples (rows) Relation name

Schemas Relation schema = relation name and attribute list. Optionally: types of attributes. Example: Beers(name, manf) or Beers(name: string, manf: string) Database = collection of relations. Database schema = set of all relation schemas in the database.

Why Relations? Very simple model. Often matches how we think about data. Abstract model that underlies SQL, the most important database language today.

Our Running Example Beers(name, manf) Bars(name, addr, license) Drinkers(name, addr, phone) Likes(drinker, beer) Sells(bar, beer, price) Frequents(drinker, bar) Underline = key (tuples cannot have the same value in all key attributes). Excellent example of a constraint.

Database Schemas in SQL SQL is primarily a query language, for getting information from a database. But SQL also includes a data-definition component for describing database schemas.

Creating (Declaring) a Relation Simplest form is: CREATE TABLE <name> ( <list of elements> ); To delete a relation: DROP TABLE <name>;

Elements of Table Declarations Most basic element: an attribute and its type. The most common types are: INT or INTEGER (synonyms). REAL or FLOAT (synonyms). CHAR(n ) = fixed-length string of n characters. VARCHAR(n ) = variable-length string of up to n characters.

Example: Create Table CREATE TABLE Sells ( bar CHAR(20), beer VARCHAR(20), price REAL );

SQL Values Integers and reals are represented as you would expect. Strings are too, except they require single quotes. Two single quotes = real quote, e.g., ’Joe’’s Bar’. Any value can be NULL.

Dates and Times DATE and TIME are types in SQL. The form of a date value is: DATE ’yyyy-mm-dd’ Example: DATE ’2007-09-30’ for Sept. 30, 2007.

Times as Values The form of a time value is: TIME ’hh:mm:ss’ with an optional decimal point and fractions of a second following. Example: TIME ’15:30:02.5’ = two and a half seconds after 3:30PM.

Declaring Keys An attribute or list of attributes may be declared PRIMARY KEY or UNIQUE. Either says that no two tuples of the relation may agree in all the attribute(s) on the list. There are a few distinctions to be mentioned later.

Declaring Single-Attribute Keys Place PRIMARY KEY or UNIQUE after the type in the declaration of the attribute. Example: CREATE TABLE Beers ( name CHAR(20) UNIQUE, manf CHAR(20) );

Declaring Multiattribute Keys A key declaration can also be another element in the list of elements of a CREATE TABLE statement. This form is essential if the key consists of more than one attribute. May be used even for one-attribute keys.

Example: Multiattribute Key The bar and beer together are the key for Sells: CREATE TABLE Sells ( bar CHAR(20), beer VARCHAR(20), price REAL, PRIMARY KEY (bar, beer) );

PRIMARY KEY vs. UNIQUE There can be only one PRIMARY KEY for a relation, but several UNIQUE attributes. No attribute of a PRIMARY KEY can ever be NULL in any tuple. But attributes declared UNIQUE may have NULL’s, and there may be several tuples with NULL.

Semistructured Data Another data model, based on trees. Motivation: flexible representation of data. Motivation: sharing of documents among systems and databases.

Graphs of Semistructured Data Nodes = objects. Labels on arcs (like attribute names). Atomic values at leaf nodes (nodes with no arcs out). Flexibility: no restriction on: Labels out of a node. Number of successors with a given label.

Example: Data Graph Notice a new kind of data. root beer beer bar The beer object for Bud manf manf prize name A.B. name year award servedAt Bud M’lob 1995 Gold The bar object for Joe’s Bar name addr Joe’s Maple

XML XML = Extensible Markup Language. While HTML uses tags for formatting (e.g., “italic”), XML uses tags for semantics (e.g., “this is an address”). Key idea: create tag sets for a domain (e.g., genomics), and translate all data into properly tagged XML documents.

XML Documents Start the document with a declaration, surrounded by <?xml … ?> . Typical: <?xml version = “1.0” encoding = “utf-8” ?> Balance of document is a root tag surrounding nested tags.

Tags Tags, as in HTML, are normally matched pairs, as <FOO> … </FOO>. Optional single tag <FOO/>. Tags may be nested arbitrarily. XML tags are case sensitive.

Example: an XML Document A NAME subobject <?xml version = “1.0” encoding = “utf-8” ?> <BARS> <BAR><NAME>Joe’s Bar</NAME> <BEER><NAME>Bud</NAME> <PRICE>2.50</PRICE></BEER> <BEER><NAME>Miller</NAME> <PRICE>3.00</PRICE></BEER> </BAR> <BAR> … </BARS> A BEER subobject

Attributes Like HTML, the opening tag in XML can have atttribute = value pairs. Attributes also allow linking among elements (discussed later).

Bars, Using Attributes <?xml version = “1.0” encoding = “utf-8” ?> <BARS> <BAR name = “Joe’s Bar”> <BEER name = “Bud” price = 2.50 /> <BEER name = “Miller” price = 3.00 /> </BAR> <BAR> … </BARS> name and price are attributes Notice Beer elements have only opening tags with attributes.

DTD’s (Document Type Definitions) A grammatical notation for describing allowed use of tags. Definition form: <!DOCTYPE <root tag> [ <!ELEMENT <name>(<components>)> . . . more elements . . . ]>

Example: DTD <!DOCTYPE BARS [ <!ELEMENT BARS (BAR*)> A BARS object has zero or more BAR’s nested within. <!DOCTYPE BARS [ <!ELEMENT BARS (BAR*)> <!ELEMENT BAR (NAME, BEER+)> <!ELEMENT NAME (#PCDATA)> <!ELEMENT BEER (NAME, PRICE)> <!ELEMENT PRICE (#PCDATA)> ]> A BAR has one NAME and one or more BEER subobjects. NAME and PRICE are HTML text. A BEER has a NAME and a PRICE.

Attributes Opening tags in XML can have attributes. In a DTD, <!ATTLIST E . . . > declares an attribute for element E, along with its datatype.

Example: Attributes <!ELEMENT BEER EMPTY> <!ATTLIST BEER No closing tag or subelements <!ELEMENT BEER EMPTY> <!ATTLIST BEER name CDATA #REQUIRED, manf CDATA #IMPLIED> Character string Required = “must occur”; Implied = “optional Example use: <BEER name=“Bud” />

Example for ID and IDREFs <!DOCTYPE lab_group [ <!ELEMENT lab_group (student_name)*> <!ELEMENT student_name (#PCDATA)> <!ATTLIST student_name student_no ID #REQUIRED> <!ATTLIST student_name tutor_1 IDREF #IMPLIED> <!ATTLIST student_name tutor_2 IDREF #IMPLIED> ]> <lab_group> <student_name student_no="a8904885">Alex Foo </student_name> <student_name student_no="a9011133">Sarah Bar</student_name> <student_name student_no="a9216735” tutor_1="a9011133" tutor_2="a8904885">Jo Smith</student_name> </lab_group>

References in your textbook Chapter 1 Chapter 2 2.1 2.2 2.3 Chapter 11 11.1 11.2 11.3

Homework from your textbook 2.2.1 2.3.1 2.3.2 11.1.1 11.2.1 11.3.1