Hierarchical data placement for navigational multimedia applications

Department of Informatics, Aristotle University, Thessaloniki 54006, Greece
Data & Knowledge Engineering (Impact Factor: 1.12). 01/2003; 44(1):49-80. DOI: 10.1016/S0169-023X(02)00124-6


Navigation has added interactivity in nowadays multimedia applications which support effective accessing to objects of various formats and presentation requirements. Storage issues need to be reconsidered for the new type of navigational multimedia applications, in order to improve system’s performance. This paper addresses the problem of multimedia data storage towards improving data accessibility and request servicing under navigational applications. A navigational graph-based model (for the multimedia data representation) is proposed to guide the data placement under a hierarchical storage topology. The multimedia data dependencies, access frequencies and timing constraints are used to characterize the graph nodes which correspond to multimedia objects allocated at the tertiary storage level. Based on certain defined popularity criteria, data are elevated and placed on secondary level towards improving both the request servicing and data accessibility. The proposed multimedia data elevation is a prefetching approach since it is performed “apriori” (not on demand) based on previously extracted user access patterns. Appropriate data placement policies are also employed at the secondary level, and a simulation model has been developed based on current commercial tertiary and secondary storage devices. This model is used to evaluate the proposed popularity based data elevation approach as employed under a hierarchical storage subsystem. Experimentation is performed under artificial data workloads and it is shown that the proposed hierarchical data placement approach considerably improves data accessing and request servicing in navigational multimedia applications. The iterative improvement placement is proven to outperform earlier related multimedia data placement policies with respect to commonly used performance metrics.

Full-text preview

Available from:

  • Source

    AIM 2006 - Information Systems and Collaboration: State of the Art and Perspectives, Best Papers of the 11th International Conference of the Association Information and Management (AIM), Luxembourg, June 8-9, 2006; 01/2006
  • [Show abstract] [Hide abstract]
    ABSTRACT: Storage assignment is an important decision problem in warehouse operation management. In conventional problem settings of distribution warehouses, stock items are stored in bulk but retrieved in small quantities. Storage assignment methods typically make use of demand attribute information of order quantity, order frequency and correlation between demands. In this paper, we address a different problem in which the request for the same stock items is stochastically recurrent. The problem arises when the items are needed in production and, after production, are returned to warehouses for later reuse. Examples of such items include tooling in factory, books in library and digital objects in data warehouses. Utilizing the recurrent characteristics, a salient recency-based storage assignment policy and an associated cascaded warehouse configuration are proposed and analyzed in this paper. This paper has four parts. In the first part, a model of recurrent demand is described. In the second part, the efficiency of the recency-based policy and a traditional ID-based policy is analyzed. In the third part, a mathematical programming model for optimal configuration of cascaded warehouses is presented. Finally, a case study of hospital visits is presented. This paper concludes with recommendations on cascading and zoning the warehouse for applying the recency-based policy.
    Computers & Industrial Engineering 05/2012; 62(4):880–889. DOI:10.1016/j.cie.2011.12.009 · 1.78 Impact Factor