Archives
Chapter 1-2 Homework Introduction And Relational Model Currently Introduction and Relational Model We have not provided any questions for Chapter 1
C H A P T E R 1 I n t r o du c t i o n and R e l a t i o n a l M o d e l ( C h a p […]
Chapter 10 Homework In disks in the past, the number of sectors per track was the same across all tracks. These days, disks have more sectors per track on outer tracks
25 C H A P T E R 1 0 S t o r ag e and F il e S t r u c t u r e E x e r c i s e s 10.1 If […]
Chapter 11 Homework Suppose I store two dimensional points as the location attribute of a relation, and queries ask for tuples whose location is at exactly a given point
27 C H A P T E R 1 1 I nd e x i n g and H a s h i n g E x e r c i s e s 11.1 Why are B-trees, which have […]
Chapter 12-13 Homework Consider external sorting using replacement selection. What is the minimum, average, and maximum length of the runs generated
C H A P T E R 1 2 Q u e r y P r o c e ss i n g and Q u e r y O p t i m i z a t i o […]
Chapter 14 Homework Give an example of a schedule that is view serializable but not conflict serializable. What is the essential feature of such schedules
37 C H A P T E R 1 4 T r a n s a c t i o n s E x e r c i s e s 14.1 Show a sequence of updates (withdrawal of money […]
Chapter 15 Homework Briefly explain what is recoverability and what is cascade freedom. Mention a protocol that ensures both properties, and explain why it ensures
39 b. What are the minimal changes to two-phase locking to guarantee i. recoverability (and explain why it works) . . .2 ii. cascade freedom (and explain why it works) . . .2 C H A P T E R […]
Chapter 16 Homework Copying the page table in shadow paging can be quite expensive for very large databases. Suggest an implementation of page tables that can reduce
C H A P T E R 1 6 R e c o v e r y E x e r c i s e s 16.1 What information do undo log records contain, and what are they used for? […]
Chapter 17-18-19 Homework Suppose all data is stored partitioned in round robin fashion. The partition operator can be specified in the form part where r is a relation
47 C H A P T E R 1 7 D a t a b a s e S y s t e m A r c h i t e c t u r e s , P a […]
Chapter 20 Homework Consider the schema r(A, B, C), where C is the class to which the tuple belongs, and A and B are attributes that can be used for classification
49 values are single letters, and there are only 2 classes T and F . Give an example with 4 “training instances” (tuples) and a partitioning con– dition that improves the “purity” (the exact definition of purity doesn’t mat- ter). […]
Chapter 21 Homework Web keyword search systems depend critically on relative ranking of pages. Earlier IR approaches were based on number of occurrences of each query
C H A P T E R 2 1 I n f o r m a t i o n R e t r i e v a l E x e r c i s e s 21.1 Web […]
Chapter 22 Homework Hardware swizzling is generally associated with page level locking. Suppose you want to implement fine granularity locking in spite of having hardware swizzling
53 C H A P T E R 2 2 O b j e c t – B a s e d D a t a b a s e s E x e r c i s e s […]
Chapter 23 Homework Student name and information on courses taken by the student including course number, year, semester, and grade)
55 C H A P T E R 2 3 X M L E x e r c i s e s 23.1 What is meant by recursion in a DTD. Explain with an example. . . .3 23.2 Given […]
Chapter 24 Homework Show pictorially how a database can be modeled as a queueing system and explain under what circumstances it is appropriate to use the queueing model
C H A P T E R 2 4 A d v a n c e d A pp li c a t i o n D e v e l o p m e n t E x e […]
Chapter 3-4 Homework Give an example of a pair of relations with integrity constraints, and inserts into both of them such that, regardless of whichever insert is first, the integrity
5 C H A P T E R 3 SQL ( C h a p t e r s 3 and 4) Questions on SQL covering Chapters 3 and 4 are provided here. E x e r c i s […]
Chapter 5 Homework What are authentication, authorization, non-repudiation, and non-duplicatability and why are they important in secure electronic transactions
C H A P T E R 5 A d v a n c e d S Q L E x e r c i s e s 5.1 The following example shows how difficult it is to do some […]
Chapter 6 Homework Suppose the course DBIS has two quizzes, and you want to find the maximum of the two quiz marks for each student of the course
C H A P T E R 6 Formal R e l a t i o n a l Q u e r y L a n g u ag e s Note: Exercises mentioning QBE and Datalog may be […]
Chapter 7 Homework Considering the increasing number of accidents on campus, the security section wishes to automate its accident recording section
C H A P T E R 7 E n t i t y – R e l a t i o n s h i p M o d e l E x e r c i s e […]
Chapter 8 Homework of the decomposed relations gives the original relations back, and such that super key, foreign key and domain constraints on the decom- posed relations
C H A P T E R 8 R e l a t i o n a l – D a t a b a s e D e s i g n E x e r c i s […]
Chapter 9 Homework Is there a security risk with the above snippet? If no, explain why, and if yes, explain why and how to fix it. Consider the following snippet of a program using
23 C H A P T E R 9 A pp li c a t i o n D e s i g n and D e v e l o p m e n t Currently we have just […]