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.
Define Query Processing Query processing is the process of selecting the best plan or strategy to be employed in responding to a database request. The plan is then executed to
The Incident table, with an auto-incrementing incident number, etc, looks like: incident_num reporter date time incide
Differentiate between B-tree and B + tree Ans: A B-tree (or Balanced Tree) is a search tree along with additional constraints that makes sure that the tree is all the time
#explain five disadvantages of a dbms..
What is a value? A data value is used for identity. This form of identity is used in relational systems.eg: The primary key value of a tuple recognize the tuple.
Insulation between conceptual and physical structures It can be defined as: 1. The Database Administrator should be capable to vary the storage structures without affectin
Views in relational algebra: 1. Basic expression contains either a) A relation in the database. b) A constant relation. 2. General expressions are madde out of sma
DROP TABLE Command: When an existing object is not needed for further use, it is always better to eliminate it from the database. To remove the existing object from the databas
need requirement analysis for database management of stock market
An instance of relational schema R (A, B, C) has distinct values of A including NULL values. then A is a candidate key or not? If relational schema R (A, B, C) has distinct val
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