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!
Question:
In relation to distributed database answer the following questions:
(i) Give a brief definition of distributed database. Support your answer with an appropriate diagram that shows the major component of the distributed database.
(ii) Differentiate between homogeneous distributed database and heterogeneous database system and explain which one will be appropriate for a company which has been using a database for the past 30 years and who now, wants to implement a distributed database.
(iii) Describe briefly two transparency features that exist in a distributed database environment.
(iv) Differentiate between horizontal partitioning and mixed partitioning with appropriate example.
(v) Briefly describe any three advantages of replication.
Explain the main advantages of DBMS over File Oriented System ?
Sequential File Organisation The most necessary way to organise the collection of records in a file is to use sequential Organisation. Records of the file are stored in series
Give the levels of data abstraction? There are three levels of Data Abstraction a) Physical level b) logical level c) view level
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
Explain the term High level DML? High level DML A high-level or non-procedural DML permit the user to specify what data is needed without specifying how it is to be acquired.
A set of possible data values is called? A set of possible data values is called as domain.
Example: //REVOKE ALL ON EMP FROM MCA12; (All permissions will be cancelled) You can also cancel only some of the permissions. Drop: A user-
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
how to implement mid square hashing?
Describe the storage structure of indexed sequential files and their access method. Ans: Index offers a lookup capability to rapidly reach the vicinity of the desired record.
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