See this document in CiteSeerX!

Versioned Backups and Index Concurrency  (Make Corrections)  
David Lomet, Betty Salzberg



  Home/Search   Context   Related

 
View or download:
microsoft.com/users/lomet/...newhpts.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  microsoft.com/~lomet/pu...default (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: this paper, we present more detail of our work on versioned backups. In section three, we outline our concurrency results. Section four is a summary (Update)

Active bibliography (related documents):   More   All
1.2:   Media Recovery with Time-Split B-trees - Lomet, Salzberg   (Correct)
0.8:   Principles of Transaction-Based On-Line Reorganization - Salzberg, Dimock (1992)   (Correct)
0.6:   Concurrency and Recovery for Index Trees - Lomet, Salzberg (1991)   (Correct)

Similar documents based on text:   More   All
0.3:   Protecting File Systems: A Survey of Backup Techniques - Chervenak, Vellanki, Kurmas (1998)   (Correct)
0.3:   Rollback Databases - Lomet, Salzberg (1992)   (Correct)
0.3:   in the Subject line: On Digital's EASYnet: CRL::TECHREPORTS On.. - This Work   (Correct)

BibTeX entry:   (Update)

@misc{ lomet-versioned,
  author = "David Lomet and Betty Salzberg",
  title = "Versioned Backups and Index Concurrency",
  url = "citeseer.ist.psu.edu/599035.html" }
Citations (may not include all citations):
189   ARIES: A Transaction Recovery Method Supporting Fine-Granula.. (context) - Mohan, Haderle et al.
88   The hB-tree: A Multiattribute Indexing method with Good Guar.. (context) - Lomet, Salzberg - 1990
83   Access Methods for Multiversion Data (context) - Lomet, Salzberg - 1989
83   The Design of the POSTGRES Storage System - Stonebraker - 1987
80   Efficient Locking for Concurrent Operations on B-trees (context) - Lehman, Yao - 1981
79   Database Systems: Achievements and Opportunities (context) - Silberschatz, Stonebraker et al. - 1990
31   Concurrent Search Structure Algorithms (context) - Shasha, Goodman - 1988
17   Transaction Processing: Techniques and Concepts (context) - Gray, Reuter
13   Key-Sequence Data Sets on Indelible Storage (context) - Easton - 1986
11   A Robust Multi-Attribute Search Structure (context) - Lomet, Salzberg - 1989
9   Concurrent Operations on B* trees with Overtaking (context) - Sagiv - 1986
7   ARIES/IM: An Efficient and High Concurrency Index Management.. (context) - Mohan, Levine - 1989
4   Concurrency and Recovery for Index Trees - Lomet, Salzberg - 1990
4   Restructuring the Lehman-Yao Tree (context) - Salzberg - 1985
3   Consistent Timestamping for Transactions in Distributed Syst.. - Lomet - 1990
3   A Relational Database Management System for Production Appli.. (context) - Joshi, Rodwell - 1989
2   Managing Timestamping in a Multiversion Database (context) - Lomet, Salzberg
2   Modification of the hB-tree for Node Consolidation and Concu.. (context) - Evangelidis, Lomet et al.
2   Media Recovery with Time-Split B-trees - Lomet, Salzberg - 1990
1   Performance of Multiversion Data (context) - Lomet, Salzberg - 1990
1   Naming and Synchronization in a Decentralized System (context) - Reed - 1978

Documents on the same site (http://www.research.microsoft.com/~lomet/pub/default.htm):   More
Phoenix: Making Applications Robust - Barga, Lomet (1999)   (Correct)
Digital B-Trees - David Lomet Ibm (1981)   (Correct)
Symbol Binding and Resolution in Programming - Languages David Lomet   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC