Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
PHYSICAL DBMS ARCHITECTURE
The physical architecture defines the software components used to process and enter data, and how these software components are related and interconnected. Though it is not possible to simplify the component structure of a DBMS, it is possible to recognize a number of key functions which are similar to most database management systems. The components that normally execute these functions are shown in Figure , which depicts the physical architecture of a typical DBMS.
Figure: DBMS Structure
Based on many functions, the database system may be partitioned into the following modules. Some functions (for example, file systems) may be given by the operating system.
A database will be made to store information about patients in a hospital. On arrival, each patient’s personal details (name, address, and telephone number) are recorded where poss
What is schema
What are ways of finding out either an update is required or not for derived attributes? The ways to find out an update is required or, not are as: Explicit update
Entity types that do not have any key attribute, and therefore cannot be identified independently, are known as weak entity types. A weak entity can be recognized uniquely only by
What are the costs to be considered when a transaction has to be rolled back when recovering from deadlock? Ans: A few transaction will must rolled back (made a victim)
Table Handling In RDBMS more than one table can be tackled at a time by using join operation. Join operation is a relational operation that causes 2 tables with a common domai
Selective replication: This is a combination of generating small fragments of relation and replicating them rather than a entire relation. The data should be fragmented on require
Define the five basic operators of relational algebra? Five basic operators of relational algebra are: 1. Union (∪∪∪∪) - Selects tuples which are in either P or Q or in both
If the deletion violates referential integrity constraint, then three alternatives are available: Default option: - refuse the deletion. It is the job of the DBMS to describ
WHERE and HAVING clause in SQL ? The WHERE clause is commonly used for implementing conditions on each tuple of the relation. The HAVING clause is used in combination along wi
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd