COLLEGE OF ENGINEERING PUNE (An Autonomous Institute of Government of Maharashtra.) END Semester Examination (CT(DE)-14004) Advanced Database Management Systems Course: B.Tech Branch: Information Technology ‘Computer Engineering ‘Semester: Sem VII Max.Marks'60 Year. 2014-2015 Date:28/11/2014 Duration: 3 Hours Time: 2-6 Instructions: MIS No. Q1 a) b) °) POsen= Figures to the right indicate the full marks. Mobile phones and programmable calculators are strictly prohibited. Writing anything on question paper is not allowed Exchange/Sharing of anything like stationery, calculator is not allowed. ‘Assume suitable data if necessary Write your MIS Number on Question Paper Specify a good way to parallelize 1. Difference operation 2. Aggregation by count operation 3. Aggregation by avg operation Describe the benefits and drawbacks of Pipelined parallelism. Consider a parallel DBMS in which each relation is stored by horizontally partitioning its tuples across all disks. Employees (eid:integer, did:integer, sal:real) Departments (did:integer, mgrid:integer, budget:real) The mgrid field of Departments is the eid of the manager. Each relation contains 20-byte tuples, and the sal and budget fields both contain uniformly distributed values in the range 0 to 1,000,000. The Employees relation contains 100,000 pages, the Departments relation contains 5,000 pages, and each processor has 100 buffer pages of 4,000 bytes each.Q2 a) b) Q3 a b) The cost of one page I/O is 44, and the cost of shipping one page is ¢; tuples are shipped in units of one page by waiting for a page to be filled before sending a message from processor / to processor j. There are no indexes, and all joins that are local to the processor are carried out using a sort-merge join. Assume that the relations are initially partitioned using a round-robin algorithm and that there are 100 processors. For each of the following queries, describe the evaluation plan briefly and give its cost in terms of fy and f,. You should compute the total cost across all sites as well as the ‘elapsed time’ cost (ie., if several operations are carried out concurrently, the time taken is the maximum over these operations). 1. Find the highest paid employee over all departments with budget < 300,000 2. Find the salaries of all managers. 3. Find the highest paid employee over all departments with budget <100,000. Consider the Employees and Departments relations described in Question Le 6 They are now stored in a distributed DBMS with all of Employees stored at Naples and all of Departments stored at Berlin. There are no indexes on these relations. The cost of various operations is as described in Question 1.e. Consider the query: SELECT * FROM Employees E, Departments D WHERE E-eid ~ D.mgrid; ‘The query is posed at Dethi and you are told that only one percent of the employees are managers. Find the cost of answering this query using each of the following plans: 1. Compute the query at Naples by shipping Departments to Naples; the ship the result to Delhi. 2. Compute the query at Delhi by shipping both relations to Delhi. 3. Compute the query at Naples using Semijoin; then ship the result to Delhi. OR Histograms are used for constructing load —balanced range partitions. Suppose the histogram has the values between 1 and 100 and are partitioned into 10 ranges, 1- 10, 11-20....++++-91-100, with frequencies 5,5,20,10,5,5,20,5 and 5 respectively. Give a load balanced range partitioning function to divide the values into 5 partitions In context to distributed databases 4 1. Describe data transparency and its various forms. 2. Role of Multi database system and gateway in heterogeneous distributed databases, Given that LDAP functionality can be implemented on the top of a database 3 system, what is the need for the LDAP standard? Describe OLAP in detail. 213Q4 Qs Q6 °) b) a) b) ©) b) Consider the sales relation. Write an SQL query to compute the cube operation on 4 the relation, giving the relation in figure. Do not use the eube construct. Make use of the following table, a hypothetical employment statistics record for Recent graduates. ID major avg. project score avg. exam score co-op? employed? Salary 1 Computer 87 78 y Y 60,000 2. History 2 92 N N 2 3 Computer 77 95 N Y 50,000 4 Engineering 97 65 N N 0 5 Engineering 84 5 Y Y 40,000 Diagram a star schema containing employment statistics data for recent graduates. 5 Based your ideas on the table given, but think of other information that might be relevant. In particular, assume that the warehouse contains data for multiple universities as well as multiple majors. Describe how a data cube can be used to determine 5 1. Which university graduates earn highest salaries? 2. Which university is the best place to study computers? Give the DTD for an XML representation of the following nested-relational 4 schema Emp~(ename,ChildrenSet setof(Children),Skil Children=(name, Birthday) Birtday=(day,month,year) ‘Skills=(type,ExamsSet setof(Exams)) Exams=(yearity) Write a query in XPath on the DTD above to list all skill types in Emp. 2 Write a note on XSLT 4 What is Hadoop framework? 5 Explain the word count implementation via the Hadoop framework. 33