Give an example of a relational-algebra expression and a query-processing strategy in each of the following situations: MRU is preferable to LRU

List all 3-tuples in the relation {(a,b,c)| abc = 6} where a, b and c are all positive integers.

Select the following relations on Z that are reflexive. {(a, b) | ab >0} {(a, b) | a>b-1} {(a,b) a² > b} 2 {(a,b) | a² = b² (mod 7)}

Read Scnerio carefully :  Make a Propose and optimal database design in RDBMS for a super store. In which clients came and can purchase products according to their likes and dislikes. Super store have same products of different companies. In the end client received a receipt of their purchase from counter he/she go for bill. Database also save records of stock according to FIFO system. Required to define Entities and their attributes Attributes Types  Each Attribute Required  Define keys of each entity Define relationship between the entities.

The comparison of deterministic versus non-deterministic computers, which are focused on function rather than relation, piques my interest.

Calculate the following transitive closures

Give a BCNF decomposition to relation "r" according to the given functional dependencies. Show the steps of normalization clearly to get full credit. r(U, V, W, X, Y, Z) Z-> XY X -> VW V-> U XY -> Y

Describe the CAP theorem in the context of distributed databases.

1. A known relationship mode of R (U, F), U= (A, B, C, E, F, G, H, I, J, G); F={AB->E,ABE->FG, B->FI, C->J, CJ->I, G->H}; find the minimum cover of F, then use theNormal Form decomposition algorithm to decompose this mode to 3NF, and check if thedecomposition has the nonadditive join property.

Question 1