Clustering Related Tuples in Databases
Open Access
- 1 January 1988
- journal article
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 31 (3) , 253-257
- https://doi.org/10.1093/comjnl/31.3.253
Abstract
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.Keywords
This publication has 0 references indexed in Scilit: