合肥生活安徽新聞合肥交通合肥房產生活服務合肥教育合肥招聘合肥旅游文化藝術合肥美食合肥地圖合肥社保合肥醫院企業服務合肥法律

        CS 2550代做、代寫SQL設計編程

        時間:2024-04-15  來源:合肥網hfw.cc  作者:hfw.cc 我要糾錯



        CS 2550 – Principles of Database Systems (Spring 2024)
        Dept. of Computer Science, University of Pittsburgh
        Assignment #4: Query Processing & Optimization
        Release: April 10, 2024 Due: 8:00PM, April 22, 2024
        Goal
        The goal of this assignment is to better understand the query evaluation process.
        Description
        The following is a fragment of the university database schema.
        Employee (EmployeeID, First, Last, Gender, DOB, Address, Phone, SNO, Salary)
        PK(EmployeeID)
        FK(SNO) --> Studio(StudioNum)
        Studio (StudioNum, StudioName, Manager, Budget)
        PK(StudioNum)
        FK(Manager) --> Employee(EmployeeID)
        Movie (movieID, producedBy, title, Budget, filmedAt)
        PK(movieID)
        FK(producedBy) --> Studio(StudioNum)
        Consider four possible organizations of the tables Employee(E)-Studio(S)-Movie(M):
        1. Tables E, S and M are heap files & no access methods exist on any of them
        2. Tables E and S are sorted files and M is a heap file & no access methods exist on any of them
        3. Tables E, S and M are heap files & access methods (hashing) exist only on M
        4. Table E is a sorted file and tables S and M are heap files & access methods exist on E and
        M, one of which is hash and the other is index
        Further assume the following statistics:
        ˆ Available Cache Memory (CM) to be 22 pages.
        ˆ Attributes belonging to the same table all have the same average size.
        ˆ When using hash join, the smaller record will be the partitioning part.
        ˆ The distribution of values for the attribute filmedAt in the table Movie is: 50% ’PGH’, 30%
        ’PHI’, and 20% ’NYC’.
        ˆ Movie: r = 500, bfr = 5, BP rj = 100.
        ˆ Studio: r = 250, bfr = 5, BDep = 50.
        ˆ Employee: r = 1250, bfr = 5, BEmp = 250.
        ˆ Note that r is the total number of tuples in a table, bfr is the blocking-factor, and B is the
        total number of blocks of a table.
        Questions [100 points]
        Q1 [20 points] Produce the heuristic query evaluation tree of the following SQL statement assuming no access structures available, and describe in details how the evaluation of the query would
        be:
        SELECT S.StudioName, COUNT(M.movieID), SUM(M.Budget)
        FROM EMPLOYEE AS E, Studio AS S, Movie AS M
        WHERE M.producedBy = S.StudioNum AND E.SNO = S.StudioNum
        GROUP BY S.StudioName
        HAVING COUNT(E.EmployeeID) < 15;
        State any additional assumptions. (Hint: some operators can be combined into a single algorithm).
        Q2 [80 points] Consider the query evaluation tree as discussed in class of the following SQL
        statement.
        SELECT M.movieID, M.producedBy, E.First, E.Last, E.Gender
        FROM Employee AS E, Studio AS S, Movie AS M
        WHERE M.producedBy = S.StudioNum AND S.Manager = E.EmployeeID
        AND M.filmedAt=‘PGH’;
        Based on your pittID, you have two database organizations assigned to you from the above organizations in order to answer this question. For those two organizations, identify sub trees that
        represent groups of operations which can be executed by a single algorithm. For each such sub tree,
        there are potentially multiple methods that can be combined to implement it as a single algorithm.
        Please provide the following:
        ˆ The description of one such implementation (steps & data structures) out of all possible ones
        for each of the above cases.
        ˆ The I/O cost of your implementation at each level.
        ˆ Compute the total I/O cost.
        You are asked to answer the question for two database organizations, those are based on your
        pittID, as follows:
        ddh**, tiw81, yiy161, dhb51, yul251, sml153, nia135, dtk28:
        You are required to do the first and second organizations only.
        mas937, yux85, anp407, shk148, nat134, aba166, mod53, jeb386:
        You are required to do the first and third organizations only.
        aym50, bsp22, yuw**8, shy158, btl26, shp184, jah292, tbt8:
        You are required to do the first and fourth organizations only.
        What & How to submit
        ˆ You are required to submit exactly one PDF file under your pitt user name (e.g.,
        pitt01.pdf). In addition to providing the answer, you are expected to: include your
        name and pitt ID at the top of the PDF file.
        ˆ After preparing your solution, submit your file (i.e., the prepared PDF) that contains
        your solution by going to the class’ Gradescope by either navigating to the Gradescope
        Homepage and selecting the course CS 2550 from the Course Dashboard or by clicking
        the Gradescope Navigation option under our course Canvas page.
        ˆ You must submit your assignment before the due date (8:00 PM, Apr. 22, 2024).
        There are no late submissions.
        ˆ Note that you are required to use a graph tool (such as MS-Word, MS Powerpoint, MS
        Visio, idraw, draw.io, etc.) to generate your diagrams and the text that explain them.
        Handwritten/Hand-drawn diagrams and/or text will not be accepted/graded
        and will receive a zero. Hand-written and digitized/scanned images will
        receive a zero (including scanned, photos, or electronically drawn using a
        smart pen submissions).
        Academic Honesty
        The work in this assignment is to be done independently. Discussions with other students on
        the assignment should be limited to understanding the statement of the problem. Cheating
        in any way, including giving your work to someone else will result in an F for the course and
        a report to the appropriate University authority.

        WX:codinghelp

        掃一掃在手機打開當前頁
      1. 上一篇:代寫 2XC3、代做 Python 設計編程
      2. 下一篇:代做CS 211: Computer Architecture
      3. 無相關信息
        合肥生活資訊

        合肥圖文信息
        急尋熱仿真分析?代做熱仿真服務+熱設計優化
        急尋熱仿真分析?代做熱仿真服務+熱設計優化
        出評 開團工具
        出評 開團工具
        挖掘機濾芯提升發動機性能
        挖掘機濾芯提升發動機性能
        海信羅馬假日洗衣機亮相AWE  復古美學與現代科技完美結合
        海信羅馬假日洗衣機亮相AWE 復古美學與現代
        合肥機場巴士4號線
        合肥機場巴士4號線
        合肥機場巴士3號線
        合肥機場巴士3號線
        合肥機場巴士2號線
        合肥機場巴士2號線
        合肥機場巴士1號線
        合肥機場巴士1號線
      4. 短信驗證碼 酒店vi設計 NBA直播 幣安下載

        關于我們 | 打賞支持 | 廣告服務 | 聯系我們 | 網站地圖 | 免責聲明 | 幫助中心 | 友情鏈接 |

        Copyright © 2025 hfw.cc Inc. All Rights Reserved. 合肥網 版權所有
        ICP備06013414號-3 公安備 42010502001045

        主站蜘蛛池模板: 日韩动漫av在线播放一区| 玩弄放荡人妻一区二区三区| 国产自产对白一区| 久久亚洲色一区二区三区| 一区二区三区精品| 国产一区二区三区不卡AV| 无遮挡免费一区二区三区| 日本一区二三区好的精华液| 香蕉久久一区二区不卡无毒影院| 久久精品一区二区三区中文字幕 | 3d动漫精品啪啪一区二区中 | 久久4k岛国高清一区二区| 一区二区三区视频免费观看| 国产精品无码一区二区三区在| 亚洲AV无码一区二区三区电影 | 在线观看亚洲一区二区| 中文无码精品一区二区三区| 亚洲一区无码精品色| www一区二区三区| 亚洲片一区二区三区| 国产成人精品a视频一区| 国产免费一区二区三区免费视频| 一区二区三区午夜| 国产福利电影一区二区三区,亚洲国模精品一区 | 一区二区视频免费观看| 亚洲国产一区二区三区| 成人午夜视频精品一区| 国产亚洲3p无码一区二区| 久久99精品国产一区二区三区| 蜜桃传媒视频麻豆第一区| 久久91精品国产一区二区| 久久精品无码一区二区WWW| 日韩免费一区二区三区在线| 亚洲一区二区三区国产精华液| 国产成人一区二区三中文| 日本福利一区二区| 国产一区麻豆剧传媒果冻精品| 亚洲av日韩综合一区在线观看| 91久久精品国产免费一区| 日韩一区二区三区射精| 一区五十路在线中出|