1.a. Explain Factless Fact table

1.b. What is role of metadata in data warehouse?

1.c. Compare OLTP vs OLAP.

1.d. Explain different types of transparencies in distributed database.

2.a. Explain concurrency control in distributed database.

2.b. Create an ER model for a Railway system with following constraints :

i) Stations

ii) Tracks,connecting stations,you can assume for simplicity that only one track exists between any two stations.All the tracks put together form a graph.

iii)Trains,with an ID and a name.

iv)Trains schedules recording what time a train passes through each station on its route.You can assume for simplicity that each train reaches its destination on the same day ,and that every train runs everyday.Also for simplicity ,assume that for each train ,for each station on its route ,you store (a)time in,(b)timeout (same time in if it doesnot stop ) and (c) a sequence number so that the stations in a route of a train can be ordered by sequence number.

v) Passenger booking consisting of train,date,from station,to station,coach,seat and passenger name ,for simplicity ,dont bother to model passengers as entities.

3.a. Explain Discretionary access control based on granting and revoking Priviligies.

3.b. Explain Star schema.Draw Star Schema for hospital Management.

4.a. Explain data warehouse architecture in detail.

4.b. Consider the following database that has to be distributed :

PROJ(PNO,PNAME,BUDGET)

PAY(TITLE,SALARY)

EMP(ENO,ENAME,SALARY)

ASG(ENO,PNO,RESPONSIBILITY,DURATION)

1.show 2 examples of horizontal fragmentation

2.show 2 examples of vertical fragmentation

3.show 1 example of derived fragmentation

4.show 1 examples of mixed fragmentation.

5.a. Explain ETL phases in creating data warehouse.

5.b. Explain indexing techniques in a database.

6.a. Describe the following OQL concepts :

i)database entry points.

ii)Path expressions

iii)Iterator variables

iv)named queries(views)

v)Aggregate functions,grouping and quantifiers.

6.b. We have an ordered file with 30000 records stored on a disk with block size 1024 bytes.File records are of fixed size and are unspanned,with record length R = 100 bytes.Ordering key field of the file is 9 bytes long , a block pointer is 6bytes long and primary index has been constructed for the file .Find -

1.The blocking factor bfr for the file.

2.The number of blocks b needed for the file.

3.The size of each index entry $R._i$.

4.The blocking factor for index $bfr_i$.

5.The number of index blocks $b_i$.