Describe the algorithm for updating indices, Database Management System

Assignment Help:

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.


Related Discussions:- Describe the algorithm for updating indices

What are the advantages of object oriented databases, What are the advantag...

What are the advantages of object oriented databases in comparison with others? Why it is still not widely used? Object oriented designs are coherent, efficient and less prone

Draw an er diagram for organization of a student database, Draw an ER diagr...

Draw an ER diagram that shows the organization of a simple student database. The database captures the information about letter grades obtained by university students who enrolled

Describe difference between a one-to-many and a many-to-many, Describe the ...

Describe the difference between a one-to-many and a many-to-many relationship. Which logical data structures comprise one-to-many and which comprise many-to-many relationship?

Backup - restore utilities, These are designed to reduce the effects of a d...

These are designed to reduce the effects of a database failure and make sure a database is restored to a consistent state if a failure does arise. Manual backup/restore utilities n

Backward recovery (undo), Backward Recovery (UNDO): In this system the unco...

Backward Recovery (UNDO): In this system the uncommitted changes made by a transaction to a database are undone.  Instead the system is reset to the last consistent state of databa

Explain how the binary tree, QUESTION (a) Give two advantages of using ...

QUESTION (a) Give two advantages of using Linked List as compared to arrays. (b) (i) You are working as programmer at the Orange Mauritius branch. You have been asked to cre

Consistency-transaction , Consistency: This property makes sure that a com...

Consistency: This property makes sure that a complete transaction implementation takes a database from one consistent state to another consistent state. If the transaction fails e

Explain concurrency control, Explain concurrency control? Concurrency ...

Explain concurrency control? Concurrency control Oracles multiversion concurrency control varies from the concurrency mechanism used by some other data base vendors. Read

What is online transaction processing, What is OLTP (Online Transaction Pro...

What is OLTP (Online Transaction Processing)? In OLTP - online transaction processing systems relational database design use the discipline of data modeling and generally follo

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd