Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
The performance of a multiversion access method
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
The snapshot index: an I/O-optimal access method for timeslice queries
Information Systems
Deciding when to forget in the Elephant file system
Proceedings of the seventeenth ACM symposium on Operating systems principles
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
FinTime: a financial time series benchmark
ACM SIGMOD Record
Probability Models for Computer Science
Probability Models for Computer Science
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Temporal and Real-Time Databases: A Survey
IEEE Transactions on Knowledge and Data Engineering
The Design of the POSTGRES Storage System
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
SNAP: Efficient Snapshots for Back-in-Time Execution
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Immortal DB: transaction time support for SQL server
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Metadata Efficiency in Versioning File Systems
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
File system design for an NFS file server appliance
WTEC'94 Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference
Thresher: an efficient storage manager for copy-on-write snapshots
ATEC '06 Proceedings of the annual conference on USENIX '06 Annual Technical Conference
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
Remembrance of streams past: overload-sensitive management of archived streams
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Skippy: Enabling Long-Lived Snapshots of the Long-Lived Past
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
FAST '09 Proccedings of the 7th conference on File and storage technologies
ACM Transactions on Storage (TOS)
An evaluation of checkpoint recovery for massively multiplayer online games
Proceedings of the VLDB Endowment
Transaction log based application error recovery and point in-time query
Proceedings of the VLDB Endowment
Auditing a database under retention policies
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the 6th International Systems and Storage Conference
Dynamic Synchronous/Asynchronous Replication
ACM Transactions on Storage (TOS)
| Hi-index | 0.00 |
The storage manager of a general-purpose database system can retain consistent disk page level snapshots and run application programs "back-in-time" against long-lived past states, virtualized to look like the current state. This opens the possibility that functions, such as on-line trend analysis and audit, formerly available in specialized temporal databases, can become available to general applications in general-purpose databases. Up to now, in-place updating database systems had no satisfactory way to run programs on-line over long-lived, disk page level, copy-on-write snapshots, because there was no efficient indexing method for such snapshots. We describe Skippy, a new indexing approach that solves this problem. Using Skippy, database application code can run against an arbitrarily old snapshot, and iterate over snapshot ranges, as efficiently it can access recent snapshots, for all update workloads. Performance evaluation of Skippy, based on theoretical analysis and experimental measurements, indicates that the new approach provides efficient access to snapshots at low cost.