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

Describe parameteric end users, Describe Parameteric end users? Paramet...

Describe Parameteric end users? Parametric end users might be given update access, but are commonly not permitted to change the structure of data.

Illustrate the term- abstracting out common behaviour, Illustrate the term-...

Illustrate the term- Abstracting Out Common Behaviour Inheritance is not every time recognised during analysis phase of development, thus it is necessary to re-evaluate object

Example of sequences, Example : Create a sequence named SEQSS that starts a...

Example : Create a sequence named SEQSS that starts at 105, has a step of 1 and can take maximum value as 2000.  CREATE SEQUENCE SEQSS START WITH 105 INCREMENT BY 1 MAX VA

Deadlock and its prevention, Deadlock And Its Prevention: As seen earlier,...

Deadlock And Its Prevention: As seen earlier, though two phase locking protocol handles the trouble of serialisability, but it causes some troubles also. For instance, consider th

The result of the union operation between r1 and r2, The result of the UNIO...

The result of the UNION operation between R1 and R2 is a relation that includes? The result of the operation between R1 and R2 includes all the tuples of R1 and R2 which have c

Type of views-data control, Type of views :  Simple views and Difficult ...

Type of views :  Simple views and Difficult Views Feature Simple Views Complex Views Number of tables One

Which database object does not physically exist, Which database object does...

Which database object does not physically exist? A view database object does not physically exist.

Define query optimization, Define query optimization. Query optimizatio...

Define query optimization. Query optimization refers to the process of search the lowest -cost method of evaluating a given query.

Create student db and execute insert query, Create Student DB and execute I...

Create Student DB and execute Insert query? STUDENT (name, student#, class, major) COURSE (course name, course#, credit hours, department) SECTION (section identifier, course

Explain displaying an er schema as an er diagram, Explain the conventions f...

Explain the conventions for displaying an ER schema as an ER diagram? An E-R Diagram scheme might describe certain constraints to that the contents of a database must conform.

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