Scribd Logo
Upload

Welcome to Scribd!

  • Assignment Unit 1

    Uploaded by

    chewgumnobrains
    8 views2 pages
    This document is a theory assignment from the Department of Computer Science and Engineering at MIT ADT University in Pune for the subject Advanced Databases. The assignment contains 4 questions related to replicating data across distributed data centers, benefits and drawbacks of RAID storage, advantages of range partitioning over hash partitioning, and why replication is easier for distributed file systems than key-value stores. The questions are marked with their corresponding Bloom's Taxonomy level and which course outcome they satisfy.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document is a theory assignment from the Department of Computer Science and Engineering at MIT ADT University in Pune for the subject Advanced Databases. The assignment contains 4 questions related to replicating data across distributed data centers, benefits and drawbacks of RAID storage, advantages of range partitioning over hash partitioning, and why replication is easier for distributed file systems than key-value stores. The questions are marked with their corresponding Bloom's Taxonomy level and which course outcome they satisfy.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    8 views2 pages

    Assignment Unit 1

    Uploaded by

    chewgumnobrains
    This document is a theory assignment from the Department of Computer Science and Engineering at MIT ADT University in Pune for the subject Advanced Databases. The assignment contains 4 questions related to replicating data across distributed data centers, benefits and drawbacks of RAID storage, advantages of range partitioning over hash partitioning, and why replication is easier for distributed file systems than key-value stores. The questions are marked with their corresponding Bloom's Taxonomy level and which course outcome they satisfy.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    MIT ADT University, Pune

    MIT Art Design and Technology University


    MIT School of Computing, Pune
    Department of Computer Science and Engineering
    Third Year B. Tech
    Academic Year 2023-24. (SEM-II)
    Subject: Advanced Databases (21BTCS604)

    Theory Assignment-1

    Submission Date: 26/02/ 2023 Unit 1 Marks – 10

    Q1. Give two reasons for replicating data across geographically L3/CO1
    distributed data centers.

    Q2. Illustrate the benefits and drawbacks of using RAID storage instead L3/CO1
    of storing an extra copy of each data item?

    Q3. Explain why range-partitioning gives better control on tablet sizes


    than hash partitioning.

    Q4 Why is it easier for a distributed file system such as GFS or HDFS to L1/CO1
    support replication than it is for key-value store?

    Prepared By Dr. Chandrashekhar Goswami


    Note:

    In the last column L1 is Bloom's Taxonomy Level and CO2 Course Outcome.

    You might also like