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!
WRITE SHORT NOTES ON INDEX STRUCTURE OF FILES?
There are two basic parts of indices
1. Ordered indices
2. Hash indices
Every technique must be evaluated on the basis of these factors:
Ø Ordered indices
Ø Primary index
Ø Dense and sparse indices
Ø Multilevel index
Ø Index update
Ø Secondary indices
B+-Tree index files
B+-Tree index structure is the most widely used of various index structures that maintain their efficiency despite insertion and deletion of data.
Ø Structure of B+-Tree
Ø Queries on B+-Tree
Ø Update on B+-Tree
Ø B+-Tree file organization
Ø B-Tree index files
Horizontal Fragmentation- Horizontal fragmentation groups together the tuples in a relation that are collectively used by the main transactions. A horizontal fragment is produced b
Attributes attached to an entity can be of various types. Simple The attribute that cannot be further separated into smaller parts and shows the basic meaning is known as a
What is the difference among a primary index and a secondary index? Primary Index: A primary index is an ordered file whose records are of fixed length along with two fields.
Which operator is Cartesian product in relational algebra? Cartesian product in relational algebra is a binary operator. (It requires two operands. e.g., P X Q)
In how many parts events are classified Events are classified as four types in UML 1. Signals 2. Calls 3. Passing of Time 4. Change in State
define attribute inheritance with example?
These are the binary operations; i.e., each is applied to two relations or sets. These two relations can be union compatible excluding in case of Cartesian product. Two relations R
Explain Candidate Key and Super Key A super key is a set of one or more than attributes that, taken collectively, permits us to identify uniquely a tuple in the relation. Wher
" Wound-wait" scheme : It is based on a preemptive method. It is based on a simple rule: If Ti requests a database resource that is held by Tj
Column Constraints: NOT NULL, UNIQUE, CHECK, PRIMARY KEY, DEFAULT, REFERENCES, On delete Cascade : Using this key whenever a parent row is removed in a referenced
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