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
Place of PublicationNew York, NY, USA
PublisherIEEE
Pages402-408
Number of pages7
ISBN (Print)0818608277
Publication statusPublished - 1988
Externally publishedYes

Fingerprint

Fluid mechanics

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). New York, NY, USA: IEEE.

EFFICIENT ALGORITHMS FOR MAINTENANCE OF LARGE DATABASE INDEXES. / Srivastava, Jaideep; Ramamoorthy, C. V.

Unknown Host Publication Title. New York, NY, USA : IEEE, 1988. p. 402-408.

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

Srivastava, J & Ramamoorthy, CV 1988, EFFICIENT ALGORITHMS FOR MAINTENANCE OF LARGE DATABASE INDEXES. in Unknown Host Publication Title. IEEE, New York, NY, USA, pp. 402-408.
Srivastava J, Ramamoorthy CV. EFFICIENT ALGORITHMS FOR MAINTENANCE OF LARGE DATABASE INDEXES. In Unknown Host Publication Title. New York, NY, USA: IEEE. 1988. p. 402-408
Srivastava, Jaideep ; Ramamoorthy, C. V. / EFFICIENT ALGORITHMS FOR MAINTENANCE OF LARGE DATABASE INDEXES. Unknown Host Publication Title. New York, NY, USA : IEEE, 1988. pp. 402-408
@inproceedings{c738d118333c4dfd9ece7ab62884176f,
title = "EFFICIENT ALGORITHMS FOR MAINTENANCE OF LARGE DATABASE INDEXES.",
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.",
author = "Jaideep Srivastava and Ramamoorthy, {C. V.}",
year = "1988",
language = "English",
isbn = "0818608277",
pages = "402--408",
booktitle = "Unknown Host Publication Title",
publisher = "IEEE",

}

TY - GEN

T1 - EFFICIENT ALGORITHMS FOR MAINTENANCE OF LARGE DATABASE INDEXES.

AU - Srivastava, Jaideep

AU - Ramamoorthy, C. V.

PY - 1988

Y1 - 1988

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0023847276&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023847276&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0818608277

SP - 402

EP - 408

BT - Unknown Host Publication Title

PB - IEEE

CY - New York, NY, USA

ER -