DOC PREVIEW
SJSU CS 157A - Object oriented Database

This preview shows page 1-2-3-4-29-30-31-32-33-60-61-62-63 out of 63 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 63 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Object oriented DatabaseDatabase Management SystemsPowerPoint PresentationData Models: 1st GenerationSlide 5Slide 6Slide 7Slide 8Slide 9Slide 10Data Models: 2nd GenerationSlide 12Slide 13Slide 14Slide 15Data Models: 3rd GenerationSlide 17Slide 18Slide 19Slide 20Slide 21Slide 22Slide 23Using DatabasesSlide 25Object Relational MappingSlide 27OR Mapping: InheritanceSlide 29Slide 30OR Mapping: GuidelinesOR Mapping: Many-to-ManyRelational, Object-Oriented, and Multidimensional DatabasesSlide 34Slide 35Object Data ModelSlide 37Object IdentifiersSlide 39Objects and LiteralsRepresentation of RelationshipsSlide 42Slide 43Relationships: One-ManyRelationships: Many-ManyRelationships: “Is A” & “Extends”Relationships: “Whole-Part”Orthogonal PersistenceObject Database StandardsSlide 50Advantages of OODBMSDisadvantages of OODBMSOODBMS UsersOODBMS ProductsThe Object Relational ModelSlide 56ORDB Example - OracleOR Mapping FrameworksSlide 59Slide 60Slide 61Slide 62Further ReadingObject oriented Object oriented DatabaseDatabaseProf. Sin-Min LeeProf. Sin-Min LeeDatabase Management SystemsDatabase ModelsDatabase ModelsRelational DatabaseRelational DatabaseObject Oriented Database ModelObject Oriented Database ModelDeductive Database ModelDeductive Database ModelHierarchial Database ModelHierarchial Database ModelNetwork Datbase ModelNetwork Datbase ModelData Models: 1st GenerationHierarchical Data ModelHierarchical Data Modelimplemented primarily by IBM’s Information Management implemented primarily by IBM’s Information Management System (IMS)System (IMS)allows one-to-one or one-to-many relationships between allows one-to-one or one-to-many relationships between entitiesentitiesan entity at a “many” end of a relationship can be related to an entity at a “many” end of a relationship can be related to only one entity at the “one” endonly one entity at the “one” endthis model is this model is navigationalnavigational – data access is through defined – data access is through defined relationships, efficient if searches follow predefined relationships, efficient if searches follow predefined relationships but performs poorly otherwise, e.g for ad-hoc relationships but performs poorly otherwise, e.g for ad-hoc queries.queries.Data Models: 1st GenerationNetwork Data ModelNetwork Data Modelstandard developed by the Committee on Data Systems standard developed by the Committee on Data Systems Languages (CODASYL)Languages (CODASYL)allows one-to-one or one-to-many relationships between entitiesallows one-to-one or one-to-many relationships between entitiesallows multiple parentage – a single entity can be at the “many” allows multiple parentage – a single entity can be at the “many” ends of multiple relationships ends of multiple relationships navigationalnavigationalDatabase Management SystemsHierarchial Database ModelHierarchial Database ModelRelatively old, dating from 1950’sRelatively old, dating from 1950’sUses a tree structure such as a company Uses a tree structure such as a company org chartorg chartPresident –> VPresident ->Dept1-Dept2-President –> VPresident ->Dept1-Dept2-Dept3->EmployeesDept3->EmployeesCan be translated into a linear listCan be translated into a linear listDatabase Management SystemsHierarchial ContinuedHierarchial ContinuedData elements organized as tabular rowsData elements organized as tabular rowsEach row for each instance of an entityEach row for each instance of an entityRow position implies a relationship to Row position implies a relationship to other rowsother rowsRelationships represented by logical Relationships represented by logical proximity in the linearized treeproximity in the linearized treeDatabase Management SystemsHierarchial ContinuedHierarchial ContinuedExampleExamplePresident ( name = jones, phone =223-3332)President ( name = jones, phone =223-3332)Vice President ( name = boyd,…)Vice President ( name = boyd,…)Department ( name =marketing)Department ( name =marketing)•Employee ( name = Smith)Employee ( name = Smith)•Employee(name=Jones)Employee(name=Jones)Department ( name = manufacturing)Department ( name = manufacturing)•Employee ( name = Williams)Employee ( name = Williams)Vice President ( name = Graham, phone =345-6789)Vice President ( name = Graham, phone =345-6789)Department ( name =human resources)Department ( name =human resources)Database Management SystemsNetwork Database ModelNetwork Database ModelReplaces the hierarchial tree with a graph Replaces the hierarchial tree with a graph network networkIf employee works for two depts in If employee works for two depts in previous example the hierarchial model previous example the hierarchial model breaks down.breaks down.Network model maintains relationships Network model maintains relationships with a system of intersecting chainswith a system of intersecting chainsDatabase Management SystemsEmployee CharlieDepartment ElectricalCharlie works for Electrical DepartmentOther workersOther departments Charlie works forData Models: 2nd GenerationRelational Data ModelRelational Data Modeldeveloped by Edgar Codd (1970)developed by Edgar Codd (1970)data represented by simple tabular structures (relations)data represented by simple tabular structures (relations)relationships defined by primary keys and foreign keysrelationships defined by primary keys and foreign keysdata accessed using high-level non-procedural language (SQL)data accessed using high-level non-procedural language (SQL)separates logical and physical representation of dataseparates logical and physical representation of datahighly commercially successful (Oracle, DB2, SQL Server, etc)highly commercially successful (Oracle, DB2, SQL Server, etc)SQL is not computationally completeSQL is not computationally completedoes not have the full power of a programming languagedoes not have the full power of a programming languageApplications generally require the use of SQL statements Applications generally require the use of SQL statements embedded in another programming language.embedded in another programming language.Database Management SystemsRelational Database ModelRelational Database ModelUses tables to organize dataUses tables to organize dataEach table corresponds to an entityEach table corresponds to an entityEach row represents


View Full Document

SJSU CS 157A - Object oriented Database

Documents in this Course
SQL

SQL

18 pages

Lecture

Lecture

44 pages

Chapter 1

Chapter 1

56 pages

E-R Model

E-R Model

16 pages

Lecture

Lecture

48 pages

SQL

SQL

15 pages

SQL

SQL

26 pages

Lossless

Lossless

26 pages

SQL

SQL

16 pages

Final 3

Final 3

90 pages

Lecture 3

Lecture 3

22 pages

SQL

SQL

25 pages

Load more
Download Object oriented Database
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Object oriented Database and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Object oriented Database 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?