Concurrent file reorganization for record clustering: A performance study

Edward Omiecinski*, Liehuey Lee, Peter Scheuermann

*Corresponding author for this work

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

5 Scopus citations

Abstract

The authors presents performance analysis of a concurrent file reorganization algorithm. They examined the effect of buffer size, degree of reorganization, and write probability of transactions on system throughput. The problem of file reorganization considered involves altering the placement of records on pages on a secondary storage device. This reorganization must be done in-place. The approach is appropriate for a non-in-place reorganization. The motivation for such a physical change is to improve the database system's performance, by minimizing the number of page accesses made in answering a set of queries. It is shown through simulation that the algorithm, when run concurrently with user transactions, provides an acceptable level of overall database system performance.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Data Engineering
PublisherPubl by IEEE
Pages265-272
Number of pages8
ISBN (Print)0818625457
StatePublished - Jan 1 1992
Event8th International Conference on Data Engineering - Tempe, AZ, USA
Duration: Feb 3 1992Feb 7 1992

Other

Other8th International Conference on Data Engineering
CityTempe, AZ, USA
Period2/3/922/7/92

ASJC Scopus subject areas

  • Software
  • Engineering(all)
  • Engineering (miscellaneous)

Fingerprint Dive into the research topics of 'Concurrent file reorganization for record clustering: A performance study'. Together they form a unique fingerprint.

Cite this