In an interactive multimedia information system, how to place multimedia objects on a disk to shorten the overall seek time for continuous retrieval is a critical issue. In the paper, based on the temporal relationships among media objects, we propose a placement strategy of multimedia objects to shorten the overall seek time for a multimedia presentation. First we derive the equations used to generate a storage pattern of media objects, and then propose an algorithm to place the objects according to the generated pattern. Next we use a de-clustering technique to support multimedia objects with high bandwidth requirements on multi-disks. Finally, a simulation model based on a practical disk is given, and several experiments are conducted to show the superiority of our algorithm.
A Placement Strategy Of Multimedia Objects Based On Temporal Relationships
Reprints and Corporate Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Academic Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
Related research
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.