2008 IEEE 24th International Conference on Data Engineering (2008)
Apr. 7, 2008 to Apr. 12, 2008
Ross Shaull , Department of Computer Science, Brandeis University, Waltham, Massachusetts, USA. firstname.lastname@example.org
Liuba Shrira , Department of Computer Science, Brandeis University, Waltham, Massachusetts, USA. email@example.com
Hao Xu , Department of Computer Science, Brandeis University, Waltham, Massachusetts, USA. firstname.lastname@example.org
Decreasing disk costs have made it practical to retain long-lived snapshots, enabling new applications that analyze past states and infer about future states. Current approaches offer no satisfactory way to organize long-lived snapshots because they disrupt the database in either short or long run. Split snapshots are a recent approach that overcomes some of the limitations. An unsolved problem has been how to support efficient application code access to arbitrarily long-lived snapshots. We describe Skippy, a new approach that solves this problem. Performance evaluation of Skippy, based on theoretical analysis and experimental measurements, indicates that the new approach is effective and efficient.
R. Shaull, L. Shrira and H. Xu, "Skippy: Enabling Long-Lived Snapshots of the Long-Lived Past," 2008 IEEE 24th International Conference on Data Engineering(ICDE), Cancun, Mexico, 2008, pp. 1474-1476.