@Unpublished{830ports07:_optim_distr_read_only_trans,
  author =       {Dan R. K. Ports and Austin T. Clements and Irene
                  Y. Zhang},
  title =        {Optimizing Distributed Read-Only Transactions Using
                  Multiversion Concurrency},
  institution =  MIT,
  year =         2007,
  note =      {Available at \url{http://drkp.net/drkp/papers/anastore-6830.pdf}},
  address =   {Cambridge, MA, USA},
  month =     dec,
  annote =    {anastore},
  abstract =     {Distributed transactional systems typically achieve
                  efficiency by abandoning true serializability for
                  weaker forms of consistency that are difficult to
                  reason about because they expose the concurrency in
                  the underlying system.  We explore an alternate
                  route: weakening <i>causality</i> instead of
                  consistency.  Our proposed algorithm achieves global
                  serializability by sacrificing global causality,
                  which we argue is reasonable in many situations.
                  This allows our algorithm to achieve efficiency by
                  permitting read-only transactions to operate on
                  stale but locally available cache data.  We present
                  the details of a transactional block storage
                  protocol that implements this form of concurrency
                  control, as well as a performance evaluation of an
                  experimental implementation of this protocol and
                  comparison against conventional optimistic
                  concurrency control.},
  pdf =          {papers/anastore-6830.pdf},
  psgz =         {papers/anastore-6830.ps.gz},
  slidespdf =    {papers/anastore-6830-slides.pdf},
  public =       {yes}
}