Paper #:[3 AR] #18
Title: "Free Transactions with Rio Vista" by David E. Lowell and Peter M. Chen


PROBLEM
Transactions have a high overhead, which prevents them from being widely used when
manipulating persistent data.  This overhead is because the data cached must be
committed and this requires disk I/O, which can lead to bottlenecks.  Consequently,
a system needs to be created that limits disk I/O and system calls while preserving
the persistence of data.

NEW IDEAS AND STRENGTHS
*The authors created a system, called Vista that reduces transaction overhead by a
factor of 2000.
*Vista eliminates the redo log, which minimizes disk I/O, and eliminates system
calls.  Both of these help to increase performance and minimize bottlenecks.  This
also minimizes the complexity of the solution.
*By utilizing a heap to store undo records, programs are allowed to store native
memory pointers.
*The paper did a good job of comparing the performance of Vista to RVM and RVM-Rio.

WEAKNESSES AND EXTENSIONS
*It would have been nice if Vista had handled serializability.  By not doing so,
this limits extending this solution to multi-threaded applications.  However, the
authors did do a good job of explaining why they did not focus on this because they
were expecting mostly single-threaded applications.
*While doing benchmarking, the authors only used a 50MB database.  I don't think
this was large enough for the types of applications that they were trying to
emulate, such as banking and warehousing applications.