Heuristic reorganization of clustered files

  • Peter Scheuermann
  • Young Chul Park
  • Edward Omiecinski
Operating Systems And Data Organization
Part of the Lecture Notes in Computer Science book series (LNCS, volume 367)


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.


Buffer Space Disk Access Secondary Storage Reorganization Process Page Access 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    M. Jakobsson, "Reducing Block Accesses in Inverted Files by Partial Clustering," Information Systems, Vol. 5, 1980, pp. 1–5.Google Scholar
  2. [2]
    J. Liou and S. B. Yao, "Multidimensional Clustering for Database Organizations," Information Systems, Vol. 2, No. 4, 1977, pp. 187–198.Google Scholar
  3. [3]
    E. Omiecinski, "Incremental File Reorganization Schemes," VLDB Conference Proceedings, Stockholm, Sweden, 1985, pp. 346–357.Google Scholar
  4. [4]
    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.Google Scholar
  5. [5]
    P. Scheuermann and M. Ouksel, "Multidimensional B-trees for Associative searching in Database Systems," Information Systems, Vol. 7, No. 2, 1982, pp. 123–137.Google Scholar
  6. [6]
    G. Sockut and R. Goldberg, "Database Reorganization — Principles and Practice," ACM Computing Surveys, Vol. 11, No. 4, 1979, pp. 371–395.Google Scholar
  7. [7]
    T. J. Teory and J. P. Fry, Design of Database Structures, Prentice-Hall, Englewood Cliffs, NJ, 1982.Google Scholar
  8. [8]
    C. Yu and C. Chen, "Information System Design: One Query at a Time," ACM SIG MOD Conference Proceedings, Austin, Texas, 1985, pp. 280–290.Google Scholar
  9. [9]
    C. Yu, K. Lam, M. Siu and C. Suen, "Adaptive Record Clustering," ACM TODS, Vol. 10, No. 2, 1985, pp. 180–204.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Peter Scheuermann
    • 1
  • Young Chul Park
    • 1
  • Edward Omiecinski
    • 2
  1. 1.Department of Electrical Engineering and Computer ScienceNorthwestern UniversityEvanstonUSA
  2. 2.School of Information and Computer ScienceGeorgia Institute of TechnologyAtlantaUSA

Personalised recommendations