DocumentCode
3324909
Title
Skippy: Enabling Long-Lived Snapshots of the Long-Lived Past
Author
Shaull, Ross ; Shrira, Liuba ; Xu, Hao
Author_Institution
Dept. of Comput. Sci., Brandeis Univ., Waltham, MA
fYear
2008
fDate
7-12 April 2008
Firstpage
1474
Lastpage
1476
Abstract
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.
Keywords
database management systems; Skippy long-lived snapshot; database disruption; general- purpose database; long-lived past state analysis; Application software; Buffer storage; Computer science; Costs; Database systems; Performance analysis; Transaction databases;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Engineering, 2008. ICDE 2008. IEEE 24th International Conference on
Conference_Location
Cancun
Print_ISBN
978-1-4244-1836-7
Electronic_ISBN
978-1-4244-1837-4
Type
conf
DOI
10.1109/ICDE.2008.4497594
Filename
4497594
Link To Document