EFFICIENT ALGORITHMS FOR MAINTENANCE OF LARGE DATABASE INDEXES.

Jaideep Srivastava, C. V. Ramamoorthy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

Installing an update in an indexed database of size N takes O(log N) disk accesses, because of a root-leaf path traversal. If the installing of updates is deferred for a while, unitl a certain number n of them have been collected, substantial savings can be obtained. Two algorithms for performing such grouped updates are presented and analyzed. The conditions on n are derived for which these algorithms perform better than straightforward update installation. A technique called model scaling, which is borrowed from the domain of fluid mechanics, is used to show how small simulations can be used for the accurate modeling of real-life environments. Some experimental results are presented to validate the analysis as well as justify the assumptions made.

Original languageEnglish
Title of host publicationUnknown Host Publication Title
PublisherIEEE
Pages402-408
Number of pages7
ISBN (Print)0818608277
Publication statusPublished - 1 Jan 1988

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Srivastava, J., & Ramamoorthy, C. V. (1988). EFFICIENT ALGORITHMS FOR MAINTENANCE OF LARGE DATABASE INDEXES. In Unknown Host Publication Title (pp. 402-408). IEEE.