Clustering Related Tuples in Databases
David Bell · The Computer Journal · 1988
This paper presents empirical results obtained using a heuristic graph-collapsing technique for placing data on storage devices. Previous experiments using this technique worked on small datasets. We have set out to gain further experience with the graph-collapsing algorithm using more realistic data sizes. These experiments have given us promising results and stimulated ideas which should be beneficial to the database designer in the future.