Performances of clustering policies in object bases
Adel Shrufi · 1994
In this paper, we address the problem of clustering graphs in object-oriented databases. Unlike previous studies which focused only on a workload consisting of a single operation, this study tackles the problem when the workload is a set of operations (method and queries) that occur with a certain probability. Thus, the goal is to minimize the expected cost of an operation in the workload, while maintaining a similarly low cost for each individual operation class.