Title :
TRAID: Exploiting Temporal Redundancy and Spatial Redundancy to Boost Transaction Processing Systems Performance
Author :
Shang, Pengju ; Serish, S. ; Wang, Jun
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Univ. of Central Florida, Orlando, FL, USA
fDate :
4/1/2012 12:00:00 AM
Abstract :
In the past few years, more storage system applications have employed transaction processing techniques to ensure data integrity and consistency. Logging is one of the key requirements to ensure transaction Atomicity, Consistency, Isolation, Durability (ACID) properties and data recoverability in transaction processing systems (TPS). Recently, emerging complex I/O bound transactions have resulted in substantially more log content and higher log flushing latency. The latency will delay transaction commit and decrease the overall throughput of the TPS. On the other hand, RAID is widely used as the underlying storage system for Databases to guarantee system reliability and availability with high I/O performance. In this paper, we observe the overlap between the redundancies in the underlying RAID storage system and database logging system, and propose a novel reliable storage architecture called Transactional RAID (TRAID). TRAID deduplicates this overlap by only logging one compact version (XOR results) of recovery references for the updating data. It minimizes the amount of log content and thereby boosts the overall transaction processing performance. At the same time, TRAID guarantees the same RAID reliability, as well as recovery correctness and ACID semantics as current TPS setups. We experiment on two open-source database systems: Berkeley DB and PostgreSQL, with three different workloads: standard OLTP benchmark TPC-C, customized TPC-C with strong access locality, and customized TPC-C with write-intensive property. Then we test TRAID performance with "Group Commit” enabled. Finally, we evaluate the recovery efficiency of TRAID. Our extensive results demonstrate that for throughput, TRAID outperforms RAID by 43.24-69.5 percent for various workloads; it also saves on log space by 28.57-35.48 percent, and outperforms RAID by about 20 percent in throughput with "Group Commit” enabled. At last, we show that TRAID outperforms RAID from 28.7 to 35.7 per- ent during the recovery.
Keywords :
RAID; data integrity; data mining; data recording; redundancy; storage management; transaction processing; ACID criteria; Berkeley DB; OLTP benchmark TPC-C; PostgreSQL; RAID storage system; access locality; complex I/O bound transactions; customized TPC-C; data consistency; data integrity; data recoverability; database logging system; group commit; log flushing latency; open source database system; spatial redundancy; system reliability; temporal redundancy; transaction atomicity property; transaction consistency property; transaction durability property; transaction isolation property; transaction processing system performance; transactional RAID; write intensive property; Arrays; Database systems; Redundancy; Throughput; ACID.; RAID; log; transaction processing system;
Journal_Title :
Computers, IEEE Transactions on