Abstract
AbstractMany applications like digital libraries use Near-line Tertiary Storage Systems (TSS) to store their massive data. TSS consists of main memory, disks and tertiary devices. Typically highly referenced or recent data are stored on disks and historical data are stored on tertiary storage devices. We call it Data Dispatching: the determination of what kind of data should be stored on disks and what kind of data should be stored on tertiary storage devices. Traditionally it was up to the Database Management System (DBMS) administrator to dispatch data by hand. But DBMS has to take the responsibility if we want to bring tertiary storage devices under the control of DBMS. We proved in this paper that the data dispatching is an optimal problem and can be reduced to the famous binary knapsack problem. Experimental results showed that the average response time of TSS could be decreased by using optimal data dispatch method.KeywordsDigital LibraryAccess TimeAverage Response TimeOptimal DataDisk AccessThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
