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.
Define weak and strong entity sets? Weak entity set: entity set that do not have key attribute of their own are known as weak entity sets. Strong entity set: Entity set that
What is deadlock? Neither of the transaction can ever proceed with its normal implementation. This situation is known as deadlock.
Write short notes on domain relational calculus The domain relational calculus uses domain variables that take on values from an attribute domain rather than values for whole
What is bucket overflow and how bucket overflow is handled through Over Flow Chaining or Closed Hashing? Ans: Bucket: unit of storage holding records. Bucket is a disk block
a publishing company produce scientific books on various subjects. the books are written by authors who specialize in one particular subject. the company employs editors who, not n
WHY SHOULD NULL IN A RELATION BE AVOID AS possible?
What is the use of RAID? A variety of disk-organization methods, collectively called redundant arrays of independent disks are used to better the performance and reliability.
Define page. The database is partitioned into some number of fixed-length blocks, which are referred to as pages.
What is Secondary Index While making the index, generally the index table is kept in the primary memory (RAM) and the main table, because of its size is keeps in the secondary
A step-wise distributed database design methodology Following is a step-wise methodology for distributed database design. (1) Examine the nature of distribution. Find out wh
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