Incremental File Reorganization Schemes

For many files, reorganization is essential during their lifetime in order to maintain an adequate performance level for users. File reorganization can be defined as the process of changing the physical structure of the file. In this paper we are mainly concerned with changes in the placement of records of a file on pages in secondary storage. We model the problem of file reorganization in terms of a hypergraph and show that this problem is NP-hard. We present two heuristics which can be classified as incremental reorganization schemes. Both algorithms incorporate a heuristic for the traveling salesman problem. The objective of our approach is the minimization of the number of pages swapped in and out of the main memory buffer area during the reorganization process. Synthetic experiments have been performed to compare our heuristics with alternative strategies.

[1]  Alan Shaw,et al.  The logical design of operating systems , 1987 .

[2]  Clement T. Yu,et al.  Adaptive record clustering , 1985, TODS.

[3]  Toby J. Teorey,et al.  A dynamic database reorganization algorithm , 1976, TODS.

[4]  H SockutGary,et al.  Database ReorganizationPrinciples and Practice , 1979 .

[5]  Toby J. Teorey,et al.  Design of Database Structures , 1982 .

[6]  Gary H. Sockut,et al.  Database Reorganization—Principles and Practice , 1979, CSUR.

[7]  Stephen W. Sherman,et al.  An extension of the performance of a database manager in a virtual memory system using partially locked virtual buffers , 1977, TODS.

[8]  Michael Stonebraker,et al.  Operating system support for database management , 1981, CACM.

[9]  Gio Wiederhold,et al.  Database Design , 1977 .

[10]  Don S. Batory.  Optimal file designs and reorganization points , 1982, TODS.

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Lars Söderlund.  Concurrent Data Base Reorganization - Assessment of a Powerful Technique through Modeling , 1981, VLDB.

[13]  Aris M. Ouksel,et al.  Multidimensional B-trees for associative searching in database systems , 1982, Inf. Syst..

[14]  Daniel J. Rosenkrantz,et al.  An analysis of several heuristics for the traveling salesman problem , 2013, Fundamental Problems in Computing.

[15]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[16]  Edward Robert Omiecinski.  Algorithms for record clustering and file reorganization , 1984 .