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!
Clustering Indexes
It may be an excellent idea to keep data of the students in the order of the programme they have registered as most of the data file accesses may need student data of a particular programme only. An index that is formed on an ordered file whose records of a file are physically ordered on a non-key field (that is the field does not have a distinct value for every record) is known as a clustering index.
Figure : A clustering Index on Programme of an employee file
Figure: Clustering index with separate blocks for each group of records with the same value for the clustering field
Please note the following points in the tables:
• Clustering index is one more example of a non-dense index as it has one entry for each distinct value of the clustering index field and not for all records in the file.
What is a view? How it is related to data independence? A view might be thought of as a virtual table, that is, a table that does not really exist in its own right but is inste
Describe Participation Constraints? Participation Constraints - The participation constraint exacts whether the existence of an entity depends on its being related to another
explain thee diffrent types of data models
What are the disadvantages of relational approach? Disadvantages of relational approach: • Substantial hardware and system software overhead • May not fit all business models •
Describe the primary key functions? Primary Key : The primary key is an attribute or a set of attributes in which uniquely identify a specific example of an entity. Every entit
Consider the following relational schema: Doctor(DName,Reg_no) Patient(Pname, Disease) Assigned_To (Pname,Dname) Give expression in both Tuple calculus and Domain calculus for
What is foreign key? Foreign Key - Let there are two relations in tables R and S. Any candidate key of the relation R that is referred in the relation S is known as the forei
Consider a typical sales invoice that would include the following information. Design a single table to hold all of the information required to store an invoice including this info
What is known as fudge factor? The number of partitions is enhanced by a small value called the fudge factor, which is usually 20 percent of the number of hash partitions compu
The users who use easy-to-use menu are called ? The users who use easy to use menu are called as Naïve users.
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