Ideal data dictionary, Database Management System

An ideal data dictionary should have everything a DBA wants to know about the database.

1 Conceptual, External, and internal database descriptions.

2.    Descriptions of attributes (fields), entities (record types) as well as origin, cross- references and meaning of data elements.

3. Authorisation ,Synonyms and security codes.

4. Which external schemas are used by which programs, what their authorisations are, and who the users are.

5.  Statistics about database and its usage containing number of records, etc.

A data dictionary is executed as a database so that users can query its contents. The cost efficiency of a data dictionary increases as the difficulty of an information system increases. A data dictionary can be an enormous asset not only to the DBA for database design, execution and maintenance, but also to managers or end users in their project planning.

Posted Date: 3/6/2013 5:02:41 AM | Location : United States







Related Discussions:- Ideal data dictionary, Assignment Help, Ask Question on Ideal data dictionary, Get Answer, Expert's Help, Ideal data dictionary Discussions

Write discussion on Ideal data dictionary
Your posts are moderated
Related Questions
Define Boyce codd normal form A relation schema R is in BCNF with respect to a set F of functional dependencies if, for all functional dependencies in F + of the form.α ->β.

It can be easily defined as: The database must not have any unmatched foreign key values. The term "unmatched foreign key value" means a foreign key value for which there doe

Describe Specialsation and generalization? Specialisation /generalization: This is a top down and bottom up approach to the design of database. It displays the IS_A relation

BCNF Boyce-Codd Normal Form A relation schema R is in BCNF if it is in 3NF and accepts an additional constraint that for every FD X A, X has to be a candidate key. If a relati

Write short notes on tuple relational calculus. The tuple relational calculation is anon procedural query language. It defines the desired information without giving a particul

Assume you are given a uniprocessor system with one gigabyte of memory and a 300 gigabyte disk. The OS on the machine has a demand paged virtual memory system with a local page rep

Compute the closure (F+) for the following set of the functional dependencies defined on R(a,b,c,d), where F - {c→ a, ab → d, a → b, d → c}, i.e. what are all of the FDs implied b

Consider the following six relation schemes and their corresponding sets of functional dependencies. In each case identify a. All the candidate keys b. The highest normal for

An important first step to the statistical analysis of data is to "get to know your data".  The following tasks should contribute to this. (a)   To the right of the dataset cons

does tables are called relations