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.
What is deadlock? How can it be avoided? How can it be resolved once it occurs? Deadlock happens when two transactions are each waiting on a resource that the other transaction
Problem Explain at least five relational algebraic operators with a suitable example. Note: All the above descriptions should be done by taking at least two examples from ou
Question 1: Define the term business intelligence tools? Briefly explain how the data from one end gets transformed into information at the other end? Definition Exp
Define cardinality and participation constraints on a relationship type, completeness constraint on generalization. Ans: Cardinality defines the number of entities to wh
Given the following relations TRAIN (NAME, START, DEST) TICKET (PNRNO., START, DEST, FARE) PASSENGER (NAME, ADDRESS, PNRNO.) Write SQL expressions for the following queries: No
Enumerate or state the steps in creating a relevant database of a shop.
How does a query tree represent a relational algebra expression? Discuss any three rules for query optimisation, giving example as to when should each rule be applied. Ans
Consider the ER schema below for the MoneyMaking supermarket chain problem. Translate the given ER schema into SQL CREATE TABLE statement.
What is DML compiler? DML Compiler: Translates DML statements in a query language within low level instructions understandable through the query evaluation engine. Attempts to
Consider the following relational scheme: R (a,b,c,d,e,f) and its corresponding set of FDs {d→ a, be → c, ac → e, b → f, f → d, a → c}. a. Is the following decomposition i) non
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