TY  - JOUR
AB  - The NP‐complete problem of optimally placing tuples on a hierarchy of secondary storage devices is considered using a heuristic approach. From load specification details captured at database design time, those tuples associated with queries which merit tailored, “set‐in‐concrete”, physical access paths are placed using a two‐level graph partitioning algorithm. Experiments are reported with the pages and cylinders as the two hierarchical levels of storage for a centralised database, but the technique is applicable to an n‐Ievel storage hierarchy—as up to the “different sites” level for distributed databases. The results show up to 39% improvement over single‐level partitioning algorithms for the database considered.
VL  - 13
IS  - 1
SN  - 0368-492X
DO  - 10.1108/eb005671
UR  - https://doi.org/10.1108/eb005671
AU  - BELL DAVID A
PY  - 1984
Y1  - 1984/01/01
TI  - PHYSICAL RECORD CLUSTERING IN DATABASES
T2  - Kybernetes
PB  - MCB UP Ltd
SP  - 31
EP  - 37
Y2  - 2024/04/26
ER  -