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

Data warehouse, XYZ is a large chain of home entertainment rental over 100 ...

XYZ is a large chain of home entertainment rental over 100 stores distributed over all states in Australia. XYZ lends entertainment products such as movies, TV shows and games on v

ER DIAGRAM, draw ER diagram of student entity and course entity where attri...

draw ER diagram of student entity and course entity where attribute of student entity are student roll, student name, student phone and student address and attribute of course enti

Objectives of database manangement system, OBJECTIVES After going thro...

OBJECTIVES After going through this unit you should be capable to: Explain the File Based system and its limitations; Explain the structure of DBMS; Explain the

Decompose the table - 3nf or bcnf, Decompose the table with the following ...

Decompose the table with the following description and functional dependencies into a set of equivalent tables normalized to 3NF or BCNF. A long-standing international treaty am

Explain the recoverable schedule, Explain the Recoverable Schedule A r...

Explain the Recoverable Schedule A recoverable schedule is one in which for each pair of transactions Ti and Tj such that Tj reads a data item formerly written by Ti, the comm

Extended e-r features, Although, the essential features of E-R diagrams are...

Although, the essential features of E-R diagrams are enough to design many database situations. Though, with more difficult relations and advanced database applications, it is need

Define seek time, Define seek time. The time for repositioning the arm ...

Define seek time. The time for repositioning the arm is known as the seek time and it enhances with the distance that the arm is known as the seek time.

What is the difference between primary key and a unique key, What's the dif...

What's the difference between a primary key and a unique key? Both primary key and unique key enforces uniqueness of the column on which they are explained. But by default prim

What are the drawbacks of shadow-paging technique, What are the drawbacks o...

What are the drawbacks of shadow-paging technique? The drawbacks of shadow paging is:- a) Commit Overhead b) Data fragmentation c)  Garbage collection

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