Three level architecture of dbms-logical architecture, Database Management System

Three Level Architecture of DBMS or Logical DBMS Architecture

The logical architecture defines how data in the database is perceived by users. It is not deals with how the data is handled and processed by the DBMS, but only with how it looks. The process of data storage on the underlying file system is not revealed, and the users can influence the data without worrying about where it is located or how it is really stored. This results in the database having dissimilar levels of abstraction.

The majority of commercial Database Management Systems available today are based on the SPARC / ANSI generalised DBMS architecture, as proposed by the SPARC / ANSI Study Group on Data Base Management Systems. Therefore, this is also called as the SPARC / ANSI model. It separates the system into three levels of abstraction: the physical or internal level, the conceptual level, and the view or external level.

 

Posted Date: 3/5/2013 4:54:20 AM | Location : United States







Related Discussions:- Three level architecture of dbms-logical architecture, Assignment Help, Ask Question on Three level architecture of dbms-logical architecture, Get Answer, Expert's Help, Three level architecture of dbms-logical architecture Discussions

Write discussion on Three level architecture of dbms-logical architecture
Your posts are moderated
Related Questions
What is difference between primary index and secondary index? Primary Index a) It is an ordered file whose records are of fixed length along with two fields. b) Only base

Relations create the database. They must satisfy various properties, like no duplicate tuples, no ordering of tuples, and atomic attributes, etc. Relations that satisfy these basic

Consistency: This property makes sure that a complete transaction implementation takes a database from one consistent state to another consistent state. If the transaction fails e

Define Atom of domain relational calculus An atom has the outline 1 , x 2 , ... , x n > -> r , in which r stands for a relation on n attributes and x 1 , x 2 , ... , x n ar

What is Relational Algebra? Relational algebra is a Procedural query Language?

What is banker's algorithm?  Banker's algorithm is a deadlock avoidance algorithm that is applicable to a resource-allocation system with multiple instances of each resource ty

Difference between SQL and SQL*Plus SQL SQL*Plus SQL is a language SQL *Plus is an environment It   is   bas

Index And Tree Structure Let us talk about the data structure that is used for creating indexes. Can we use Binary Search Tree (BST) as Indexes? Let us initial reconsider

Define functional and multivalued dependencies.       Ans:  A functional dependency is a assets of the semantics of the attributes in a relation. The semantics point out how at

Describe substring comparison in SQL. For the relation Person (name, address), write a SQL query that retrieves the names of people whose name starts along with ‘A' and address co