A global approach to record clustering and file reorganization

Authors:
Edward Omiecinski;Peter Scheuermann
Affiliations:
Northwestern University, Evanston, Illinois;Northwestern University, Evanston, Illinois
Venue:
SIGIR '84 Proceedings of the 7th annual international ACM SIGIR conference on Research and development in information retrieval
Year:
1984

Citing 6
Cited 0

A clustering algorithm for hierarchical structures

ACM Transactions on Database Systems (TODS)
Database Reorganization—Principles and Practice

ACM Computing Surveys (CSUR)
Approximating block accesses in database organizations

Communications of the ACM
Some properties of Cartesian product files

SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
Algorithms for record clustering and file reorganization

Algorithms for record clustering and file reorganization
Graphs and Hypergraphs

Graphs and Hypergraphs

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an integrated method for record clustering and reorganization which can be applied to any set of queries whose frequencies of request are known. The clustering algorithm works by splitting and merging current clusters and, furthermore, produces a new assignment of these clusters to pages in secondary storage. The reorganization algorithm is an on-line, incremental procedure for allocating the records to their new physical locations such that the number of pages swapped in and out of the memory buffer is as small as possible.