2011重庆大学 数据库考试题,挥泪版.docVIP

Consider the following three database schemas: Employee (person_name, street, city) Work (person_name, company_name, salary) Company (company_name, city) please write the queries in relational algebra(关系代数) according to the description: find out the name of all employees in city cq; Find out the name and salary of all employees in corporation A; Find out the name and city of all employees in corporation B; Optimize the relational algebra expression C in 1), draw the optimized relational algebra expression tree. Consider the following three database schemas: Customers (cust_id, cust_name, cust_address,cust_phone ) Products (prod_id, prod_name, prod_type, prod_price, prod_number) Orders (order_id, cust_id, prod_id, number) Please write the following queries in SQL: Find out the name of products whose price is higher than ￥100. Find out the order number of customer Tom. Create a view to complete the following function: statistics the quantity of each type (prod type) inventory(库存) Products. Create a product table which defines the primary key, and make sure that Prod_type must be one of “television”, ”refrigerator” and ”washing machine”. Design an E/R diagram for Bar. Both red wine and beer are supplied in Bar. Customers drink in the Bar. And the translate the E/R mode into relational model. Bar has name and address ,customers has name and birthday and all wines have manufacturer and brand. The functional dependency set F from relation R(A,B,C,D,E,F) is shown as follows: F = {A-E, B-D, CE-F, F-BC} Calculate the closure(闭包) for attribute set AF. A B+ tree structure is shown in Fogure 1. G G J E J E J K G E A B J K G E A B Figure 1 Write the modes from querying path between the root and the key value ”K”; Draw B+ tree after insert key value “H” based on Figure 1; Draw B+ tree after insert key value “D” based on Fig