Abstract
The storage management of an interactive multimedia information system (MMIS) is different from that of the conventional file system. In an MMIS, there could be relationships between the homepages stored on a disk. During browsing homepages, how to reduce the disk seek time and then to provide a fast browsing become a critic performance issue. In the paper, we propose two data placement algorithms for continuous and non-continuous spaces to place objects on a disk in order to reduce their access time. In the simulation, we conduct several experiments to validate the superiority of our algorithms over other algorithms. Besides we also show that the results derived by our algorithms are near optimal by comparing with the optimal solution.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
