Define object-oriented database, Database Management System

Question :

Object-Oriented Database (OODM) is defined as a logical data model that captures the semantics of objects supported in object-oriented programming. An Object-Oriented Database or OODB is defined as a persistent and sharable collection of objects defined by an OODM.

(i) OODBMSs were developed due to some of the inadequacies of the existing database technology. One of the inadequacies refers as Impedance mismatch problem. Explain what is meant by impedance mismatch, in the context of relational database system.

(ii) Give example of Four Advanced Database Applications and discuss their general characteristics. Explain why these applications are not suitable for a relational database.

(iii) Define each of the following concepts in the context of an object-oriented data model:

a. Abstraction.
b. Objects and attributes.
c. Methods and messages.
d. Classes, subclasses and superclasses.

Posted Date: 11/1/2013 3:55:50 AM | Location : United States







Related Discussions:- Define object-oriented database, Assignment Help, Ask Question on Define object-oriented database, Get Answer, Expert's Help, Define object-oriented database Discussions

Write discussion on Define object-oriented database
Your posts are moderated
Related Questions
Problem: a) Briefly describe what you understand by Client-Server environment b) The File Server is a simple form of Client-Server. Describe the principles of the File Serve

2NF Normal Form : A relation schema process R is in 2NF if it is in 1NF and each non-prime attribute A in R is fully functionally related on primary key. Second normal form (2N

What are called journaling file systems? File systems that support log disks are known as journaling file systems.

Data independence seems that "the application is independent of the access strategy and storage structure of data". In other words, the ability to change the schema definition in o

In tuple relational calculus P1 → P2 is equivalent to ? A In tuple relational calculus P1→  P2 is equivalent to ¬P1 V P2. (The logical implication expression A  B, meaning

What is the difference between WHERE and HAVING clauses?. Predicates in the WHERE clause applies to every tuple while the predicate in the HAVING clause applies to groups.

Explain forms based and graphical interface? Forms based and graphical interface: graphical user interface (GUI) is a kind of user interface which permits people to interact

The users who use easy-to-use menu are called ? The users who use easy to use menu are called as Naïve users.

The C_Artist  application will be developed using the C language (C99 standards) and will be able to compile without warnings and link and run in the Swinburne computer laboratorie

After the completion of the logical model the physical model is to be made. The oracle 10 G will be used as a database server and all the tables with their column are created and i