Join processing in database systems with large main memories
ACM Transactions on Database Systems (TODS)
Tapes hold data, too: challenges of tuples on tertiary store
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A new way to compute the product and join of relations
SIGMOD '80 Proceedings of the 1980 ACM SIGMOD international conference on Management of data
Implementation techniques for main memory database systems
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Hashing Methods and Relational Algebra Operations
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
An Observation on Database Buffering Performance Metrics
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Single Query Optimization for Tertiary Memory
Single Query Optimization for Tertiary Memory
AN OVERVIEW OF THE SEQUOIA 2000 PROJECT
AN OVERVIEW OF THE SEQUOIA 2000 PROJECT
On the modeling and performance characteristics of a serpentine tape drive
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Random I/O scheduling in online tertiary storage systems
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Tertiary storage in multimedia systems: staging or direct access?
Multimedia Systems
A brief survey of tertiary storage systems and research
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
ADC '01 Proceedings of the 12th Australasian database conference
Performance Measurements of Tertiary Storage Devices
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Query Processing in Tertiary Memory Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
SSDBM '97 Proceedings of the Ninth International Conference on Scientific and Statistical Database Management
Scheduling Queries for Tape-Resident Data
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Performance Analysis of Storage Systems
Performance Evaluation: Origins and Directions
Optimal Scheduling Algorithms for Tertiary Storage
Distributed and Parallel Databases
FDTM: block level data migration policy in tiered storage system
NPC'10 Proceedings of the 2010 IFIP international conference on Network and parallel computing
High performance virtual backup and archive system
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
Hi-index | 0.00 |
Today large amounts of data are stored on tertiary storage media such as magnetic tapes and optical disks. DBMSs typically operate only on magnetic disks since they know how to maneuver disks and how to optimize accesses on them. Tertiary devices present a problem for DBMSs since these devices have dismountable media and have very different operational characteristics compared to magnetic disks. For instance, most tape drives offer very high capacity at low cost but are accessed sequentially, involve lengthy latencies, and deliver lower bandwidth. Typically, the scope of a DBMS's query optimizer does not include tertiary devices, and the DBMS might not even know how to control and operate upon tertiary-resident data. In a three-level hierarchy of storage devices (main memory, disk, tape), the typical solution is to elevate tape-resident data to disk devices, thus bringing such data into the DBMS' control, and then to perform the required operations on disk. This requires additional space on disk and may not give the lowest response time possible. With this challenge in mind, we studied the trade-offs between memory and disk requirements and the execution time of a join with the help of two well-known join methods. The conventional, disk-based Nested Block Join and Hybrid Hash Join were modified to operate directly on tapes. An experimental implementation of the modified algorithms gave us more insight into how the algorithms perform in practice. Our performance analysis shows that a DBMS desiring to operate on tertiary storage will benefit from special algorithms that operate directly on tape-resident data and take into account and exploit the mismatch in disk and tape characteristics.