Posted: February 16th, 2017

Design a distributed relational database for Australian Boomerang. Justify your placement, replication, and partitioning of the tables.

Australian Boomerang, Ltd., wants to design a distributed relational database. The company is headquartered in Perth and has major operations in Sydney, Melbourne, and Darwin. The database involved consists of five tables, labeled A, B, C, D, and E, with the following characteristics:

Table A consists of 500,000 records and is heavily used in Perth and Sydney. Table B consists of 100,000 records and is frequently required in all four cities. Table C consists of 800 records and is frequently required in all four cities. Table D consists of 75,000 records. Records 1-30,000 are most frequently used in Sydney. Records 30,001-75,000 are most frequently used in Melbourne. Table E consists of 20,000 records and is used almost exclusively in Perth.

Design a distributed relational database for Australian Boomerang. Justify your placement, replication, and partitioning of the tables. (Please answer in complete sentences; do not submit any diagrams. This is a question about the architecture of how the distributed database is set up, balancing costs versus reliability, not how to design the schema.