Scribd Logo
Upload

Welcome to Scribd!

  • 2015w Cs122a Project Quiz8

    Uploaded by

    Maotan
    5 views2 pages
    This document is a quiz for a course on data management. It contains 4 questions regarding B+-tree indexes. Question 1 asks the student to create an index on a phone number column to speed up a query, and whether the index should be clustered or unclustered. Question 2 describes a B+-tree and asks the student to determine the tree's height, number of pages needed to read a range, and depict the tree after insertions and deletions. Question 3 asks the student to draw the same B+-tree if it was bulk loaded, and determine the number of pages needed for the same range query.

    Original Description:

    CS 122A Quiz 8

    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 quiz for a course on data management. It contains 4 questions regarding B+-tree indexes. Question 1 asks the student to create an index on a phone number column to speed up a query, and whether the index should be clustered or unclustered. Question 2 describes a B+-tree and asks the student to determine the tree's height, number of pages needed to read a range, and depict the tree after insertions and deletions. Question 3 asks the student to draw the same B+-tree if it was bulk loaded, and determine the number of pages needed for the same range query.

    Copyright:

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

    2015w Cs122a Project Quiz8

    Uploaded by

    Maotan
    This document is a quiz for a course on data management. It contains 4 questions regarding B+-tree indexes. Question 1 asks the student to create an index on a phone number column to speed up a query, and whether the index should be clustered or unclustered. Question 2 describes a B+-tree and asks the student to determine the tree's height, number of pages needed to read a range, and depict the tree after insertions and deletions. Question 3 asks the student to draw the same B+-tree if it was bulk loaded, and determine the number of pages needed for the same range query.

    Copyright:

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

    CS122A:

    Introduction to Data Management


    Quiz 8



    Taken by:



    Graded by:





    Winter 2015
    _____________________
    Score (out of 10)

    _______________________________________________
    Name

    _______________________________
    Student ID

    _______________________________________________
    Name

    _______________________________
    Student ID

    You will have 20 minutes to finish this quiz.


    1. Finding all outgoing call records for a customer takes too long. The following query is used:
    SELECT * FROM CallInfo WHERE fromPhonenumber = 9491234567
    a. Write a statement that creates an index that can help speeding this query up. 2 points



    b. Should this index be clustered or unclustered? Explain your decision. 1 point



    6
    4

    10

    12

    10

    12

    2. Take the B+-Tree shown above. For every question, start with the original version of the
    tree.
    a. What is the height of the tree? 1 point

    CS122A: Introduction to Data Management

    Winter 2015

    b. How many pages do we need to read the values for the range query [3, 10] (inclusive) 1 point



    c. Show the tree after inserting the value 1. You can leave out unchanged subtrees and replace
    them with (same) 1 point













    d. Show the tree after deleting the value 4. 1 point














    3. Imagine the tree above would have been bulkloaded (with the same values).
    a. Draw the bulkloaded tree. 1 point














    b. How many pages do we need to read the values for the range query [3, 10]? 1 point

    You might also like