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!
Define the concept of aggregation. Give two examples where this concept is useful.
Ans: Aggregation transforms a relationship among the objects into a higher-level object. A new data type known as aggregate is developed which, under specific criteria of "well-definedness," defines aggregation abstractions. Relational databases illustrated as collections of aggregates are structured like a hierarchy of n-ary relations. To keep well-definedness, update operations on such type of databases must keep two invariants. Well-defined relations are different from relations in third normal form. It is displayed that these notions are complementary and both are significant in database design. A top-down method for database design is described that separates decisions concerning aggregate structure from decisions concerning key identification. It is suggested that aggregate types, and other sorts which support real-world abstractions with no introducing Key identification.
Which operator is Cartesian product in relational algebra? Cartesian product in relational algebra is a binary operator. (It requires two operands. e.g., P X Q)
i have a homework assignment identical to one you have listed
Draw an Entity-Relationship model for the relational schema given in the Appendix. Show all the entities, relationships, relationship names, and attributes and also underline the
Question: (a) Can a set of data requirements be correctly modelled by two or more different ER diagrams? Explain your answer. You may use a small example, if you think it will
CAR SALE (Car_id, Option_type, Option_listprice, Sale_date, Option_discountedprice) This relation refers to options installed in cars (e.g., cruise control) that were sold at a de
What is Relational Algebra? Relational algebra is a Procedural query Language?
Domain Constraint It shows that each attribute in a relation has to contain an atomic value only from the corresponding domains. The data types associated with commercial RDBMS
Column Constraints: NOT NULL, UNIQUE, CHECK, PRIMARY KEY, DEFAULT, REFERENCES, On delete Cascade : Using this key whenever a parent row is removed in a referenced
Explain concurrency control? Concurrency control Oracles multiversion concurrency control varies from the concurrency mechanism used by some other data base vendors. Read
What is Index? An index is a physical structure having pointers to the data. Indices are created in an existing table to locate rows more quickly and efficiently. It is possibl
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