Presentation is loading. Please wait.

Presentation is loading. Please wait.

Fundamental Concepts Svetlin Nakov Telerik Corporation www.telerik.com.

Similar presentations


Presentation on theme: "Fundamental Concepts Svetlin Nakov Telerik Corporation www.telerik.com."— Presentation transcript:

1 Fundamental Concepts Svetlin Nakov Telerik Corporation

2 1. Database Models 2. Relational Database Models 3. RDBMS Systems 4. Tables, Relationships, Multiplicity, E/R Diagrams 5. Normalization 6. Constraints 7. Indices 2

3 8. The SQL language 9. Stored Procedures 10. Views 11. Triggers 12. Transactions and Isolation Levels 3

4 Relational Databases, Database Servers and RDBMS

5  Database models  Hierarchical (tree)  Network / graph  Relational (table)  Object-oriented  Relational databases  Represent a bunch of tables together with the relationships between them  Rely on a strong mathematical foundation: the relational algebra 5

6  Relational Database Management Systems (RDBMS) manage data stored in tables  RDBMS systems typically implement  Creating / altering / deleting tables and relationships between them (database schema)  Adding, changing, deleting, searching and retrieving of data stored in the tables  Support for SQL language  Transaction management (optional) 6

7  RDBMS systems are also known as:  Database management servers  Or just database servers  Popular RDBMS servers:  Microsoft SQL Server  Oracle Database  IBM DB 2  PostgreSQL  MySQL  Borland Interbase, SQLite, … 7

8 Database Tables, Relationships, Multiplicity

9  Database tables consist of data, arranged in rows and columns  For example (table Persons ):  All rows have the same structure  Columns have name and type (number, string, date, image, or other) Id First Name Last Name Employer1SvetlinNakovTelerik 2StephenForteTelerik 3SteveJobsApple 9

10  The schema of a table is an ordered sequence of column specifications (name and type)  For example the Persons table has the following schema: 10 Persons ( Id: number, Id: number, FirstName: string, FirstName: string, LastName: string, LastName: string, Employer: string Employer: string)

11  Primary key is a column of the table that uniquely identifies its rows (usually its is a number)  Two records (rows) are different if and only if their primary keys are different  The primary key can be composed by several columns (composite primary key) Id First Name Last Name Employer1SvetlinNakovTelerik 2StephenForteTelerik 3SteveJobsApple 11 Primary key

12  Relationships between tables are based on interconnections: primary key / foreign key 12IdName CountryId 1Sofia1 2Plovdiv1 3Munich2 4Berlin2 5Moscow3 IdName1Bulgaria 2Germany 3Russia Towns Countries Primary key Foreign key

13  The foreign key is an identifier of a record located in another table (usually its primary key)  By using relationships we avoid repeating data in the database  In the last example the name of the country is not repeated for each town (its number is used instead)  Relationships have multiplicity:  One-to-many – e.g. country / towns  Many-to-many – e.g. student / course  One-to-one – e.g. example human / student 13

14  Relationship one-to-many (or many-to-one)  A single record in the first table has many corresponding records in the second table  Used very often 14IdName CountryId 1Sofia1 2Plovdiv1 3Munich2 4Berlin2 5Moscow3 IdName1Bulgaria 2Germany 3Russia Towns Countries

15  Relationship many-to-many  Records in the first table have many correspon- ding records in the second one and vice versa  Implemented through additional table 15IdName1Pesho 2Minka 3Gosho 4Penka IdName1.NET 2Java 3PHP Students Courses StudentId CourseId StudentsCourses

16 IdTitle1Ph.D.  Relationship one-to-one  A single record in a table corresponds to a single record in the other table  Used to model inheritance between tables 16 IdIdIdIdNameAge1 Ivan Daddy 72 2 Goiko Dude 26 3 Grand Mara 24 PersonsIdSpecialty2 Computer Science 3Chemistry Students Primary & Foreign key in the same time Primary key Primary & foreign key in the same time Professors

17  How do we represent trees and graphs? 17 Root DocumentsPictures Birthday Party

18  The primary / foreign key relationships can point to one and the same table  Example: employees in a company have a manager, who is also an employee 18IdFolderParentId1Root (null) 2Documents1 3Pictures1 4 Birthday Party 3 Employees Primary key Foreign key Self- relationship

19 Entity / Relationship Diagrams and DB Modeling Tools

20  Relational schema of a DB is the collection of:  The schemas of all tables  Relationships between the tables  Any other database objects (e.g. constraints)  The relational schema describes the structure of the database  Doesn't contain data, but metadata  Relational schemas are graphically displayed in Entity / Relationship diagrams (E/R Diagrams) 20

21 21 The diagram is created with Microsoft SQL Server Management Studio

22 22 The diagram is created with ERwin

23 23 The diagram is created with fabFORCE DB Designer for MySQL

24 24 The diagram is created with MS Visio

25  Data modeling tools allow building E/R diagrams, generate / import DB schemas:  SQL Server Management Studio  Oracle JDeveloper  Microsoft Visio  CASE Studio  Computer Associates ERwin  IBM Rational Rose  theKompany Data Architect 25

26 Avoiding Duplicated Data through Database Schema Normalization

27  Normalization of the relational schema removes repeating data  Non-normalized schemas can contain many data repetitions, e.g. 27ProductProducerPriceCategoryShopTownyoghurt Mlexis LTD 0.67food store "Mente" Sofia bread "Dobrudja" Bakery "Smoky" 0.85 food store "Mente" Sofia beer "Zagorka" Zagorka CO 0.68 soft drinks stall "non- stop" Varna beer "Tuborg" Shumen Drinks CO 0.87 soft drinks stall "non- stop" Varna

28  1 -st Normal Form  Data is stored in tables  Fields in the rows are atomic (inseparable) values  There are no repetitions within a single row  A primary key is defined for each table 28BookTitle ISBN (PK) AuthorAuthor .NET Framework Mr. Kiro Beginning SQL

29  2 -nd Normal Form  Retains all requirements of 1 -st Normal Form  There are no columns that depend on part of the primary key (if it consists of several columns) 29 BookTitle (PK) Author (PK) Price Author .NET Framework Mr. Kiro Beginning SQL Santa Claus The price depends on the book depends on the author

30  3 -rd Normal Form  Retains all requirements of 2 -nd Normal Form  The only dependencies between columns are of type "a column depends on the PK" 30IdProduct Producer Id Price Category Id Shop Id Town Id 1Yoghourt bread "Tipov" rakiya "Biserna" beer "Tuborg"

31  4-th Normal Form  Retains all requirements of 3-rd Normal Form  There is one column at most in each table that can have many possible values for a single key (multi-valued attribute) 31AuthorIdBookArticle2.NET Programming Regular Expressions in.NET 4 Mastering JavaScript AJAX Performance Patterns One author can have many books One author can have many articles

32  Example of fully normalized schema (in 4 th Normal Form): 32 IdIdIdIdName2 "Milk" Ltd. 4 "Zagorka" AD IdName4beer 2food IdProductProducerIdPrice Catego ryId Shop Id Town Id 1Youghurt bread "Dobrudja" rakia "Peshtera" beer "Tuborg" IdIdIdIdName1Billa 4METROIdName1Sofia 3Varna Products Producers Categories Shops Towns

33 Constraints, Indices, SQL, Stored Procedures, Views, Triggers

34  Integrity constraints ensure data integrity in the database tables  Enforce data rules which cannot be violated  Primary key constraint  Ensures that the primary key of a table has unique value for each table row  Unique key constraint  Ensures that all values in a certain column (or a group of columns) are unique 34

35  Foreign key constraint  Ensures that the value in given column is a key from another table  Check constraint  Ensures that values in a certain column meet some predefined condition  Examples: 35 (hour >= 0) AND (hour = 0) AND (hour < 24) name = UPPER(name)

36  Indices speed up searching of values in a certain column or group of columns  Usually implemented as B-trees  Indices can be built-in the table (clustered) or stored externally  Adding and deleting records in indexed tables is slower!  Indices should be used for big tables only (e.g rows) 36

37  SQL (Structured Query Language)  Standardized declarative language for manipulation of relational databases  SQL-99 is currently in use in most databases  SQL language supports:  Creating, altering, deleting tables and other objects in the database  Searching, retrieving, inserting, modifying and deleting table data (rows) 37

38  SQL consists of:  DDL – Data Definition Language  CREATE, ALTER, DROP commands  DML – Data Manipulation Language  SELECT, INSERT, UPDATE, DELETE commands  Example of SQL SELECT query: 38 SELECT Towns.Name, Countries.Name FROM Towns, Countries WHERE Towns.CountryId = Countries.Id

39  Stored procedures (database-level procedures)  Consist of SQL-like code stored in the database  Code executed inside the database server  Much faster than an external code  Data is locally accessible  Can accept parameters  Can return results  Single value  Record sets 39

40  Stored procedures are written in a language extension of SQL  T-SQL – in Microsoft SQL Server  PL/SQL – in Oracle  Example of stored procedure in Oracle PL/SQL: 40 CREATE OR REPLACE PROCEDURE spInsertCountry(countryName varchar2) IS BEGIN INSERT INTO Countries(Name) INSERT INTO Countries(Name) VALUES(countryName); VALUES(countryName);END;

41  Views are named SQL SELECT queries which are used as tables  Simplify data access  Facilitate writing of complex SQL queries  Used also to apply security restrictions:  E.g. a certain user isn't given permissions on any of the tables in the database  The user is given permissions on few views (subset of DB) and few stored procedures only 41

42 42IdCompany TownId 1 Mente LTD 1 2 BulkSoft Inc. 2 3 HardSoft Corp. 4 4 Sputnik Corp. 3 IdTownCountryId1Sofia1 2 New York 3 3Moscow2 4Plovdiv1 CompaniesTownsIdCountry1Bulgaria 2Russia 3USA Countries

43 43 CREATE VIEW V_BGCompanies AS SELECT SELECT Companies.Id AS Id, Companies.Id AS Id, Companies.Company AS Company Companies.Company AS Company FROM Companies INNER JOIN FROM Companies INNER JOIN (Towns INNER JOIN Countries ON (Towns INNER JOIN Countries ON Towns.CountryId = Countries.Id) Towns.CountryId = Countries.Id) ON Companies.TownId = Towns.Id ON Companies.TownId = Towns.Id WHERE WHERE Countries.Country = "Bulgaria"; Countries.Country = "Bulgaria";IdCompany1 Mente Ltd. 3 HardSoft Corp. V_BGCompanies

44  Triggers are special stored procedures that are activate when some event occurs, for instance:  When inserting a record  When changing a record  When deleting a record  Triggers can perform additional data processing of the affected rows, e.g.  To change the newly added data  To maintain logs and history 44

45  We have a table holding company names:  A trigger that appends "Ltd." at the end of the name of a new company: 45 CREATE TABLE Companies( Id number NOT NULL, Id number NOT NULL, Name varchar(50) NOT NULL) Name varchar(50) NOT NULL) CREATE OR REPLACE TRIGGER trg_Companies_INSERT BEFORE INSERT ON Company BEFORE INSERT ON Company FOR EACH ROW FOR EACH ROWBEGIN :NEW.Name := :NEW.Name || ' Ltd.'; :NEW.Name := :NEW.Name || ' Ltd.';END;

46 ACID Transactions and Isolation

47  Transactions are a sequence of database operations which are executed as a single unit:  Either all of them execute successfully  Or none of them is executed at all  Example:  A bank transfer from one account into another (withdrawal + deposit)  If either the withdrawal or the deposit fails the entire operation should be cancelled 47

48 Rollback Commit 48 Read Write Write Durable starting state Durable,consistent, ending state Sequence of reads and writes

49  Transactions guarantee the consistency and the integrity of the database  All changes in a transaction are temporary  Changes become final when COMMIT is successfully executed  At any time all changes done in the transaction can be canceled by executing ROLLBACK  All operations are executed as a single unit  Either all of them pass or none of them 49

50 Withdraw $ Read savings acc. 2. New savings = current Read checking acc. 4. New checking = current Write the savings 6. Write the checking 1. Read the current balance 2. New balance = current Write the new balance 4. Dispense cash Transfer $100 50

51  Atomicity  Either execute everything or nothing  Consistency  The database remains consistent with logically correct data (e.g. no constraint is violated)  Isolation  Different transactions are isolated from each other depending on the selected isolation level  Durability  If a transaction is confirmed, it cannot be lost 51

52  We have a table with bank accounts:  We use a transaction to transfer money from one account into another 52 CREATE TABLE Accounts( Id int NOT NULL, Id int NOT NULL, Balance decimal NOT NULL) Balance decimal NOT NULL) CREATE OR REPLACE PROCEDURE sp_Transfer_Funds( fromAccount IN INT, fromAccount IN INT, toAccount IN INT, toAccount IN INT, ammount IN NUMBER) IS ammount IN NUMBER) ISBEGIN

53 53 UPDATE Accounts set Balance = Balance - ammount UPDATE Accounts set Balance = Balance - ammount WHERE id = fromAccount; WHERE id = fromAccount; IF SQL % ROWCOUNT = 0 THEN IF SQL % ROWCOUNT = 0 THEN ROLLBACK; ROLLBACK; RAISE_APPLICATION_ERROR(-20001, 'Invalid src account!'); RAISE_APPLICATION_ERROR(-20001, 'Invalid src account!'); END IF; END IF; UPDATE Accounts set Balance = Balance + ammount UPDATE Accounts set Balance = Balance + ammount WHERE id = to_account; WHERE id = to_account; IF SQL % ROWCOUNT = 0 THEN IF SQL % ROWCOUNT = 0 THEN ROLLBACK; ROLLBACK; RAISE_APPLICATION_ERROR(-20002, 'Invalid dst account!'); RAISE_APPLICATION_ERROR(-20002, 'Invalid dst account!'); END IF; END IF; COMMIT; COMMIT;END;

54  Transactions can define different isolation levels that affect other parallel transactions  Stronger isolation ensures better consistency but works slower and the data is locked longer Level of Isolation Dirty Reads Repeatable Reads Phantom Reads Read Uncommitted YesYesYes Read Committed NoYesYes Repeatable Read NoNoYes SerializableNoNoNo 54

55  When transactions should be used?  Always use transactions when a business operation modifies more than one table  Example:  At the cash-desk in a supermarket: we buy a cart of products  We either buy all of them and pay for them or we buy nothing and pay no money  If any of the operations fail we cancel the entire transaction (the purchase) 55

56 Questions?


Download ppt "Fundamental Concepts Svetlin Nakov Telerik Corporation www.telerik.com."

Similar presentations


Ads by Google