Abstract
The problem of file reorganization which 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. The motivation for such a physical change is to improve the database system's performance. For example, by placing frequently and jointly accessed records on the same page or pages, we can try to minimize the number of page accesses made in answering a set of queries. The optimal assignment (or reassignment) of records to clusters is exactly what record clustering algorithms [1,2,4,9] attempt to do. However, record clustering algorithms usually do not solve the entire problem, i.e., they do not specify how to efficiently reorganize the file to reflect the clustering assignment which they determine. Our algorithm is a companion to general record clustering algorithms since it actually transforms the file. The problem of optimal file reorganization is NP-hard [3]. Consequently, our reorganization algorithm is based on heuristics for which we prove three important observations.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Jakobsson, "Reducing Block Accesses in Inverted Files by Partial Clustering," Information Systems, Vol. 5, 1980, pp. 1–5.
J. Liou and S. B. Yao, "Multidimensional Clustering for Database Organizations," Information Systems, Vol. 2, No. 4, 1977, pp. 187–198.
E. Omiecinski, "Incremental File Reorganization Schemes," VLDB Conference Proceedings, Stockholm, Sweden, 1985, pp. 346–357.
E. Omiecinski and P. Scheuermann, "A Global Approach to Record Clustering and File Reorganization," in Research and Development in Information Retrieval,ed. C. J. van Rijsbergen, Cambridge Press, 1984, pp. 201–219.
P. Scheuermann and M. Ouksel, "Multidimensional B-trees for Associative searching in Database Systems," Information Systems, Vol. 7, No. 2, 1982, pp. 123–137.
G. Sockut and R. Goldberg, "Database Reorganization — Principles and Practice," ACM Computing Surveys, Vol. 11, No. 4, 1979, pp. 371–395.
T. J. Teory and J. P. Fry, Design of Database Structures, Prentice-Hall, Englewood Cliffs, NJ, 1982.
C. Yu and C. Chen, "Information System Design: One Query at a Time," ACM SIG MOD Conference Proceedings, Austin, Texas, 1985, pp. 280–290.
C. Yu, K. Lam, M. Siu and C. Suen, "Adaptive Record Clustering," ACM TODS, Vol. 10, No. 2, 1985, pp. 180–204.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Scheuermann, P., Park, Y.C., Omiecinski, E. (1989). Heuristic reorganization of clustered files. In: Litwin, W., Schek, HJ. (eds) Foundations of Data Organization and Algorithms. FODO 1989. Lecture Notes in Computer Science, vol 367. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51295-0_116
Download citation
DOI: https://doi.org/10.1007/3-540-51295-0_116
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51295-0
Online ISBN: 978-3-540-46186-9
eBook Packages: Springer Book Archive