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.
A relationship set is a set of relationships of the similar type. For example, let consider the relationship among two entities sets course and student. Collection of all the in
How does the system cope up with a record crash when recovery is going on after the first crash? Ans: In a system the undo and redo operations are needed to be idempotent to c
The basic merits of decomposition. The Advantages of Decomposition 1. Separate person can work on each subsystem. 2. A particular software engineer can specialize in a
Some disadvantages of File Oriented System ?
I need help in doing my dbms project
Define about the Stored Procedure - It's a set of T-SQL statements combined together to perform a single task formed by combining numerous small tasks. - When you essentiall
What is equi join? Equi Join - It generates all the combinations of tuples from two relations which satisfy a join condition along with only equality comparison (=).
It is mandatory that for every table in the LDB hierarchy there should exist one GET statement in the report. False. It is not essential.
Backward Recovery (UNDO): In this system the uncommitted changes made by a transaction to a database are undone. Instead the system is reset to the last consistent state of databa
Problem: You are given the following schema 1. Flights(flno, from, to, distance) 2. Aircraft(aid, flno, aname, cruisingRange) 3. Certified(eid, aid) 4. Employees(eid, ena
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