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 is a disjoint less constraint, What is a disjoint less constraint? ...

What is a disjoint less constraint? Ans: It needs that an entity belongs to no much more than one level entity set.  Disjoint less constraint needs that an entity belongs to

File organization, what is file organization? what are file organization te...

what is file organization? what are file organization techniques.explain in detail? explain random file organization technique, multikey file organization technique?what is indexin

Determine the two special events, What are two special events? The two ...

What are two special events? The two special events are as "entry" and "exit". Any action which is marked as linked to entry event is executed whenever given state is entered v

Define thomas write rule, Define Thomas write rule Thomas' write rule: ...

Define Thomas write rule Thomas' write rule: The Thomas' write rule is a modification of timestamp-ordering protocol for concurrency control. Assume that transaction T i issue

Two approaches to store relations in distributed database, What are the two...

What are the two approaches to store relations in distributed database? a) Replication b) Fragmentation

Sql queries, find a name whose address is erode from student table

find a name whose address is erode from student table

Intersection, If R1 and R2 are two union compatible relations or functions,...

If R1 and R2 are two union compatible relations or functions, then the result of R3 = R1 ∩R2 is the relation that contains all tuples that are in both the relations In other words,

State the design of associations, State the Design of Associations Bef...

State the Design of Associations Before designing associations, it is essential to know the way they are used. For this, analysis of association traversals is required. It is

What are called jukebox systems, What are called jukebox systems? Jukeb...

What are called jukebox systems? Jukebox systems have a few drives and numerous disks that can be loaded into single of the drives automatically.

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