This Article 
 Bibliographic References 
 Add to: 
Performance Analysis of a Concurrent File Reorganization Algorithm for Record Clustering
April 1994 (vol. 6 no. 2)
pp. 248-257

Presents a simulation-based performance analysis of a concurrent file reorganization algorithm. We examine the effect on throughput of (a) buffer size, (b) degree of reorganization, (c) write probability of transactions, (d) multiprogramming level, and (e) degree of clustered transactions. The problem of file reorganization that we consider involves altering the placement of records on pages of a secondary storage device. In addition, we want this reorganization to be done in place, i.e. using the file's original storage space for the newly reorganized file. Our approach is appropriate for a non-in-place reorganization as well. The motivation for such a physical change, i.e. record clustering, is to improve the database system's performance, i.e. minimizing the number of page accesses made in answering a set of queries. There are numerous record clustering algorithms, but they usually do not solve the entire problem, i.e., they do not specify how to efficiently reorganize the file to reflect the clustering assignment that they determine. In previous work, we have presented an algorithm that is a companion to general record clustering algorithms, i.e. it actually transforms the file. In this work we show through simulation that our algorithm, when run concurrently with user transactions, provides an acceptable level of overall database system performance.

[1] R. Agrawal, M. J. Carey, and M. Livny, "Models for studying concurrency control performance: Alternatives and implications,"ACM SIGMOD Int. Conf. Management of Data, 1985, pp. 108-121.
[2] M. M. Astrahanet al., "System R: Relational approach to database management,"Trans. Database Syst., vol. 1, no. 1, pp. 97-137, 1976.
[3] P.A. Bernstein, V. Hadzilacos, and N. Goodman,Concurrency Control and Recovery in Database Systems, Addison-Wesley, Reading, Mass., 1987.
[4] M. Jakobsson, "Reducing block accesses in inverted files by partial clustering,"Inform. Syst., vol. 5, no. 1-5, 1980.
[5] D. Knuth,Sorting and Searching. Reading, MA: Addison Wesley, 1975.
[6] C. Mohan, "ARIES/KVL: A key-value locking method for concurrency control of multi-action transactions operating on B-tree indexes," inProc. 16th VLDB Conf., Brisbane, 1990.
[7] E. Omiecinski, "Incremental file reorganization schemes," inProc. 11th VLDB Conf., Stockholm, pp. 346-357, 1985.
[8] E. Omiecinski, "Concurrent file conversion between B+ tree and linear hash files,"Inform. Syst., vol. 14, no. 5, pp. 371-383, 1989.
[9] E. Omiecinski, W. Liu, and I. Akyildiz, "An analytical model of a deferred and incremental update strategy for secondary indexes," inProc. 3rd Int. Conf. Foundations of Data Organization and Algorithms, pp. 218-222, 1989.
[10] E. Omiecinski and P. Scheuermann, "A global approach to record clustering and file reorganization," inResearch and Development in Information Retrieval, C. J. van Rijsbergen, Ed. Cambridge, UK: Cambridge Press, 1984, pp. 201-219.
[11] D. R. Ries and M. R. Stonebraker, "Locking granularity revisited,"ACM Trans. Database Syst., June 1979.
[12] P. Scheuermann and M. Ouksel, "Multidimensional B-trees for associative searching in database systems,"Inform. Syst., vol. 7, no. 2, pp. 123-137, 1982.
[13] P. Scheuermann, Y. Park, and E. Omiecinski, "A heuristic file reorganization algorithm based on record clustering,"BIT, vol. 29, pp. 428-417, 1989.
[14] D. Severance, "Differential files: their application to the maintenance of large databases,"ACM Trans. Data Base Syst., vol. 1, pp. 256-267, 1976.
[15] G. Sockut and R. Goldberg, "Database reorganization-principles and practice,"ACM Comput. Surv., vol. 11, no. 4, pp. 371-395, Dec. 1979.
[16] L. Soderlund, "Concurrent database reorganization-assessment of a powerful technique through modeling," inProc. 1981 VLDB Conf., pp. 499-509, 1981.
[17] K. S. Trivedi,Probability and Statistics with Reliability, Queueing and Computer Science Applications. Englewood Cliffs, NJ: Prentice-Hall, 1982.
[18] S. B. Yao, "Approximating block accesses in database organizations,"Commun. ACM, vol. 20, pp. 260-261, Apr. 1977.
[19] C. T. Yu, C. Suen, K. Lam, and M. Siu, "Adaptive record clustering,"ACM Trans. Data Base Syst., pp. 180-204, 1985.

Index Terms:
file organisation; performance evaluation; parallel algorithms; multiprogramming; simulation-based performance analysis; concurrent file reorganization algorithm; record clustering; throughput; buffer size; transaction write probability; multiprogramming level; clustered transactions; record placement; secondary storage device; database system performance; page accesses; query answering; clustering assignment
E. Omiecinski, L. Lee, P. Scheuermann, "Performance Analysis of a Concurrent File Reorganization Algorithm for Record Clustering," IEEE Transactions on Knowledge and Data Engineering, vol. 6, no. 2, pp. 248-257, April 1994, doi:10.1109/69.277769
Usage of this product signifies your acceptance of the Terms of Use.