Heuristic algorithms for I/O scheduling for efficient retrieval of large objects from tertiary storage
- Authors
- Moon, C; Kang, H
- Issue Date
- 2001
- Publisher
- IEEE COMPUTER SOC
- Citation
- PROCEEDINGS OF THE 12TH AUSTRALASIAN DATABASE CONFERENCE, ADC 2001, v.23, no.2, pp 145 - 152
- Pages
- 8
- Journal Title
- PROCEEDINGS OF THE 12TH AUSTRALASIAN DATABASE CONFERENCE, ADC 2001
- Volume
- 23
- Number
- 2
- Start Page
- 145
- End Page
- 152
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/59756
- DOI
- 10.1109/ADC.2001.904477
- ISSN
- 0000-0000
- Abstract
- Multimedia data service applications of today are to efficiently deal with possibly massive amount of large objects (LOBs). The storage capacity of the traditional disk-based DBMS is certainly limited to support such applications. As such, it is necessary for the DBMS to employ the tertiary storage devices, which perform often with long latency and yet can provide huge amount of storage capacity at the,relatively low cost. In this paper; we investigate rite tertiary I/O scheduling algorithms for efficient retrieval of the LOBs that are stored in the tertiary storage device with multiple platters. Taking into consideration the performance characteristics of the tertiary storage devices and LOB retrieval, we propose a set of tertiary I/O scheduling algorithms each of which employs different heuristic for scheduling, reducing the latency involved in tertiary I/O for retrieving LOBs. The performance of the proposed algorithms is evaluated through the detailed simulation experiments.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Software > School of Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.