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 Hash files organization
a. Hashing includes computing the address of a data item by calculating a function on the search key value.
b. A hash function h is a function from the set of all search key values K to the set of all bucket addresses B.
We select a number of buckets to correspond to the number of search key values we will comprise stored in the database.
To carry out a lookup on a search key value Ki, we calculate hki, and search the bucket along with that address.
If two search keys i and j map to similar address, as h(Ki)=h(Kj), after that the bucket at the address acquired will consist of records with both search key values.
In this case we will have to verify the search key value of each record in the bucket to get the ones we want.
Use of partial data by applications : In common, applications work with views rather than whole relations. Thus, it may be more appropriate to work with subsets of relations rather
Design an algorithm to implement operations Each and every operation specified in the functional model could be formulated as an algorithm. The algorithm indicates how operat
..
Lack of standards and experience: The lack of standards has considerably limited the potential of distributed DBMSs. As well, there are no tools or methodologies to help users cha
If the insertion violates one or more constraints, then two alternatives are available: Default option: - Insertion can be discarded and the reason of refusal can also be ex
Having Clause with sub queries: First we have to recollect the GROUP BYclause. The following query searches the minimum salary in every department. SELECT DEPTNO, MIN (SAL)
Define in which normalisation form if an attribute of a composite key is dependent on an attribute of other composite key. Ans: 3NF A relation is in 3 NF if an attribute of
Explain what is Aggregation ? Aggregation: This is used whenever we intend to show a relationship between an entity and the relationship. There is no provision for this in th
Types of data independence Data independence can be classified into the following two types: Physical Data Independence: This means that for any change made in the physi
Three Level Architecture of DBMS or Logical DBMS Architecture The logical architecture defines how data in the database is perceived by users. It is not deals with how the da
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