Differentiate between various levels of data abstraction, Database Management System

Assignment Help:

Differentiate between various levels of data abstraction?

Data Abstraction - Abstraction is the procedure to hide the irrelevant things from the users and represent the relevant things to the user. Database systems are frequent used through non-computer professionals so in which the complexity must be hidden from database system users. This is done through defining levels of abstract as that the database may be viewed; there is logical view or external view, conceptual view and internal view or physical view.

1. External View - This is the highest level of abstraction as seen through a user. It describes only the part of whole database, that is relevant to a particular user.

2. Conceptual View - This is the next higher stages of abstraction that is the sum total of Database Management System user's views. It elaborates what data are in fact stored in the database. It contains information about whole database in terms of a small number of associatively easy structure.

3. Internal View - This is the lowest level of abstraction. It elaborates how the data are physically stored


Related Discussions:- Differentiate between various levels of data abstraction

Concept of foreign key, Fundamentals of Database Management 1. Explai...

Fundamentals of Database Management 1. Explain the concept of Foreign Key. How a foreign key differs from a Primary Key? Can the Foreign Key accept nulls? 2. With a necess

aggregate functions-data manipulation language, Aggregate functions ...

Aggregate functions Some of these functions are min, count, max, and avg. These functions help in getting consolidated information from a set of tuples. Example:

What are the states of transaction, What are the states of transaction? ...

What are the states of transaction? The states of transaction are:- a) Active b) Partially committed c) Failed d) Aborted e )Committed   f) Terminated

In tuple relational calculus p1- p2 is equivalent to, In tuple relational ...

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

Please answer me., gyan gurukul is a software company that provides softwar...

gyan gurukul is a software company that provides software related solution.

Explain how the associations are implemented as classes, Explain how the as...

Explain how the associations are implemented as classes. A general approach in this case is to transform an association class into a simple class linked to two original classes

What is data defination language, What is DDL? Make a list of commands with...

What is DDL? Make a list of commands with short description used in DDL Ans: Data Definition Language that is abbreviated as DDL is a computer language for defining data struct

Explain the isa relationship, Explain the ISA relationship Answer: IS...

Explain the ISA relationship Answer: ISA relationship - ISA notation is employed in generalization/ specialization to depict relationship among lower and higer level entity s

What are the benefits of decomposing a system, What are the benefits of dec...

What are the benefits of decomposing a system? The benefits of decomposing a system into subsystems are that after decomposition, each individual component become smaller and e

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd