Reflects organisational structure, Database Management System

Reflects organisational structure:Many organizations are distributed over various locations. If an organisation has many offices in dissimilar cities, databases used in such an application are circulated over these locations. Such an organisation may stay a database at every branch office having details of the staff that work at that location, the local properties that are for rent, etc. The staff at a branch office will create local inquiries to such data of the database. The company headquarters may wish to create global inquiries involving the access of data at each or a number of branches.

 

Posted Date: 3/12/2013 5:54:25 AM | Location : United States







Related Discussions:- Reflects organisational structure, Assignment Help, Ask Question on Reflects organisational structure, Get Answer, Expert's Help, Reflects organisational structure Discussions

Write discussion on Reflects organisational structure
Your posts are moderated
Related Questions
Explain weak and strong entity sets? Weak and Strong entity sets: A physically powerful entity set has a primary key. All tuples in the group are distinguishable through that k

Explain the Fundamental concepts of object-orientation Software developers, data base administrators (DBAs) need to be familiar with fundamental concepts of object-orientation.

Determine the Advanced modeling concepts You have to follow some steps for object-oriented design. These steps for OO Design methodology are as follow:  1)  Produce objec

Differentiate between Key and superkey? Key and superkey - A key a single attribute or a combination of two or more attributes of an entity set in which is used to identify o

Give the general form of SQL query? Select  A1, A2............., An From  R1, R2..............., Rm Where  P

What is relationship? Give examples A relationship is an association between several entities. Example: A depositor relationship associates a customer with every account tha

Explain Dynamic Two-Phase Locking Here a transaction locks a data item instantly earlier than any operation is applied on the data item.  After finishing all the operations on

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

Boyce-Codd Normal Form (BCNF) The relation NEWSTUDENT (Enrolmentno, Sno, Sname, Cname, Cno,) has every attributes participating in candidate keys as all the attributes are assu

What are the problems if one were not to normalize?  When do these problems surface?           Ans:  Database normalization, sometimes considered to as  canonical synthesis, is