Physical storage management for interactive multimedia information systems

The authors propose a two-level physical storage model to deal with the data placement problem for interactive multimedia information systems on disks with high seek time such as optical disks. The physical data placement is divided into two stages, global data placement and detailed data placement. A Markov chain is used to model the access patterns for global data placement. An efficient algorithm is proposed for solving the global placement problem to minimize the disk seek time. They report on a simulation study in which the effectiveness of the proposed global data placement algorithm was evaluated. The result shows that the depth-first traversal of the maximum-cost spanning tree algorithm can generate a layout close to the optimal placement, especially for browsing graphs with low connectivity