Differentiate between horizontal and mixed partitioning, Database Management System

Assignment Help:

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.


Related Discussions:- Differentiate between horizontal and mixed partitioning

What are the time stamps associated with each data item, What are the time ...

What are the time stamps associated with each data item? W-timestamp (Q) denotes the largest time stamp if any transaction that implemented WRITE (Q) successfully. R-timesta

Improve efficiency of database, Smart Alex Catering Sevice (SACS) is a comp...

Smart Alex Catering Sevice (SACS) is a company offering top class catering staff  for prestigious events.  The company employs approximately 200 hourly paid contact staff - chefs,

Define the categories of sql statements, Define the categories of SQL State...

Define the categories of SQL Statements? 1) Statements that don't return a result set. This statement class includes INSERT, DELETE, and UPDATE. 2)Statements that return

What is a block and a block number, What is a block and a block number? ...

What is a block and a block number? A block is a contiguous sequence of sectors from a single track of one platter. Every request specifies the address on the disk to be refere

Define an operator that a relational algebra does not have, Define an opera...

Define an operator that a Relational Algebra does not have Ans: Relational Algebra does not have Aggregation operators.

Weak entity, Entity types that do not have any key attribute, and therefore...

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

Frequecy count, how to calculate frequency count of algorithm

how to calculate frequency count of algorithm

Describe queries with complex types, Describe queries with complex types? ...

Describe queries with complex types? The present extension of the SQL query language deal with the complex type Let us start with the simple example: Find the title and t

Define first normal form and second normal form, First Normal Form and seco...

First Normal Form and second normal form First Normal Form (1NF) A relation is said to be in 1NF if it having no non-atomic values and each row can give a unique combinat

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd