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!
Describe the algorithm for updating indices for a single level index when a record is
(i) Inserted (ii) deleted
What will be the modification if there are multilevel indices?
Ans: Inserted: The time it acquires to insert a new data item. This value involves the time it takes to find out the correct place to insert the new data item, also the time it takes to update the index structure.
Deleted: The time it receives to delete a data item. This value involves the time it takes to find the item to be deleted, also the time it takes to update the index structure.
Event Occurrence of a process is called event. In other words, the object can receive many input instructions. The changes which occur due to these instructions are known as e
What is B-Tree? A B-tree eliminates the redundant storage of search-key values .It permits search key values to appear only once.
Define single valued and multivalued attributes. Single valued attributes: attributes with a single value for a particular entity are known as single valued attributes. M
What is a recursive relationship? Give an example not used in the text. A recursive relationship is a relationship among an entity and itself. For example, given the entity PER
Which language used in application programs to request data from the DBMS is referred? Language which is used in application program is DML to request data from the DBMS is ref
Define Signal. It allows methods to respond to events triggered by themselves or by other processes. Each signal corresponds to an exacting event. A signal is represented in Sy
Define Physical and Logical independence Ans: Physical data independence: The ability to modify physical level without causing application program to be rewritten. Logic
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
In E-R diagram how generalization is represented? in E-R diagram generalization is represented by Triangle shape.
What is a shadow copy scheme? It is simple, but efficient, scheme known as the shadow copy schemes. It is based on making copies of the database called shadow copies that singl
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