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!
Differentiate between static hashing and dynamic hashing.
Ans: Static Hashing comprises the number of primary pages in the directory fixed. So, while a bucket is full, we require an overflow bucket to store any extra records that hash to the full bucket. This can be completed with a link to an overflow page, or a linked list of overflow pages. The linked list can be separate for every bucket, or similar for all buckets that overflow. While searching for a record, the original bucket is accessed first, after that the overflow buckets. Specified there are several keys that hash to the same bucket, locating a record may need accessing multiple pages on disk that greatly degrades performance.
The dilemma of lengthy searching of overflow buckets is solved by Dynamic Hashing. In Dynamic Hashing the size of the directory grows along with the number of collisions to accommodate new records and prevent long overflow page chains. Extendible and Linear Hashing are two dynamic hashing methods.
How can you Start MySQL Server? To start the mysql program type it is name in the command- line prompt. After starting mysql program just display A welcome letter using the
In Database software have only pure security or some dis secured by administrator?
What do you mean by DBMS? What is its need and what are its goals. Explain? OR Explain Data Base Management System? Sol. Database management system is a
Explain the Natural join Natural join is a binary operator which is written as (R* S) in which R and S are relations. The effect of the natural join is the set of all combinati
Explain several types of constraints that can be specified using CREATE TABLE command. Explain CASCADE and RESTRICT clauses of DROP SCHEMA command? Constraint Description PRIM
How to design a formal and exact model How to design a formal and exact model of real-world problems by applying findings of analysis phase of OMT. The object design phase find
Candidate Key: In a relation R, a candidate key for R is a subset of the set of attributes of R, which have the differnt two properties: (1) Uniqueness: N
QUESTION (a) Using an appropriate example, explain what is a recursive function? (b) Explain in detail the C++ function given below. void search2(int list[],int n,int ele
Question: (a) Define the term e-Government and briefly explain, using appropriate examples, the aspects it covers. (b) Give four reasons as to why a country should adopt e
Describe integrity constraints? Integrity Constraints - A database is just as excellent as the information stored in it, and a DBMS must therefore help avoid the entry of inc
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