High-Performance Concurrency Control Mechanisms for Main-Memory Databases

Computer Science – Databases

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

VLDB2012

Scientific paper

A database system optimized for in-memory storage can support much higher transaction rates than current systems. However, standard concurrency control methods used today do not scale to the high transaction rates achievable by such systems. In this paper we introduce two efficient concurrency control methods specifically designed for main-memory databases. Both use multiversioning to isolate read-only transactions from updates but differ in how atomicity is ensured: one is optimistic and one is pessimistic. To avoid expensive context switching, transactions never block during normal processing but they may have to wait before commit to ensure correct serialization ordering. We also implemented a main-memory optimized version of single-version locking. Experimental results show that while single-version locking works well when transactions are short and contention is low performance degrades under more demanding conditions. The multiversion schemes have higher overhead but are much less sensitive to hotspots and the presence of long-running transactions.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

High-Performance Concurrency Control Mechanisms for Main-Memory Databases does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with High-Performance Concurrency Control Mechanisms for Main-Memory Databases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and High-Performance Concurrency Control Mechanisms for Main-Memory Databases will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-672809

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.