Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Explain the difference between using functions along with and without grouping attributes in relational algebra. Give examples.
Ans: Group functions are used to group data of similar type. GAMMA = grouping and aggregation Applying GAMMAL(R)• Group R according to all the grouping attributes on list L.1. That is: form one group for each distinct list of values for those attributes in R.• Within each group, compute AGG(A ) for each aggregation on list L.• Result has one tuple for each group:1. The grouping attributes and2. Their group's aggregations. Example: Grouping /Aggregation R = ( A B C ) 1 2 3 4 5 6 1 2 5 GAMMAA,B,AVG(C) (R) = ? First, group R by A and B : A B C 1 2 3 1 2 5 4 5 6 Then, average C within groups: A B AVG(C) 1 2 4 4 5 6
external and internal mapping with examples
Represent the following scenarios with E-R diagrams drawn using the ER Assistant software. The diagrams should indicate cardinality and optionality of relationships. Transform each
What is meant by data-transfer rate? The data-transfer rate is the rate at which data can be retrieved from or kept to the disk.
Explain the disadvantages of file oriented approach? In the oriented approach Applications are designed in isolation. Design of application is optimized for one application. In
Set Difference If R1 and R2 are two union compatible relations or relations then result of R3 =R1- R2 is the relation that have only those tuples that are in R1 but not in R2.
What is horizontal fragmentation? Horizontal fragmentation divides the relation by assuming every tuple of r to one or more fragments
From SAD to OOAD (Structured Analysis and Design (SAD) to Object Oriented Analysis and Design (OOAD). We will find here how we can map various models in SAD to different model
What is a hash index? A hash index organizes the search keys, with their associated pointers, into a hash file structure.
how to design a bakery business in data base
Consider a relation s over the attributes A and B with the following characteristics: 5,000 tuples with 10 tuples per page A 2-level B+ tree index on attribute
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd