Media recovery with time-split B-trees

Details Media recovery with time-split B-trees Media recovery with time-split B-trees

1995-09-01

1998-06-09

Beausoliel, Jr., Robert W.

Excavating

39518213, 395448, 395600, 371 81, G06F 1100, G06F 1134

Patent

active

057648778

ABSTRACT:
Modern database systems provide media recovery by taking periodic backups and applying a transaction log to the backup to bring the data up-to-date. A multi-versioned database is one that retains and provides access to historical versions of data. The present invention shows how a history database, supported by the Time-Split B-tree, can be used to also provide the backup function of media recovery. Thus, the same versions used for database history are used for database backup. The cost of taking a backup is comparable to the cost of a good differential backup method, whereby only changed data is backed up. The media recovery cost, especially when the media failure is only partial, e.g., a single disk page, will frequently be lower.

REFERENCES:
patent: 4611272 (1986-09-01), Lomet
patent: 4814971 (1989-03-01), Thatte
patent: 4878167 (1989-10-01), Kapulka et al.
patent: 4945474 (1990-07-01), Elliott et al.
patent: 5123104 (1992-06-01), Levine et al.
patent: 5175849 (1992-12-01), Schneider
patent: 5201044 (1993-04-01), Frey, Jr. et al.
patent: 5204958 (1993-04-01), Cheng et al.
patent: 5222235 (1993-06-01), Hintz et al.
patent: 5280612 (1994-01-01), Lorie et al.
patent: 5287496 (1994-02-01), Chen et al.
Concurrency Index Management Method Using Write-Ahead Logging, IBM Research Report RJ 6846, (Aug. 1989) IBM Almaden Research Center, San Jose, CA. Journal of Computer and System Sciences, vol. 33, No. 2 (1986) pp. 275-296. University Technical Report TR BS-85-21 (1985), Boston, MA.
Yannis Manolopoulos Overlapping B+Tree for Temporal Data 1990, pp. 491-498.
VA-ON TAM `Fast Recovery in Distributed Shared Virtual Memory Systems` 1990 pp. 38-45.
Lomet et al. `A Robust Multi-Attribute Search Structure` 1989 pp. 296-304.
Sang Hyukson Distributed Checkpoint for Globally Consistent States of Databases 1989 pp. 1157-1167.
Le Gruenwald `Reload in a Main Memory Database System:MARS`1990 pp. 174-176.
M. Samy Gamal-Elelin `Local And Global Constraints In Database Integration` 1989 pp. 604-611. Acta Informatica, vol. 9 (1977) pp. 1-21. Consistency and Predicate Locks in a Database System. Communications of ACM vol. 19, No. 11 (Nov. 1976) pp. 624-633. on B-Trees. ACM Trans on Database Systems, vol. 6, No. 4 (Dec. 1981) pp. 650-670. atomic actions. Proc. ACM Conf. on Language Design for Reliable Software, SIGPLAN Notices 12, 3 (Mar. 1977) pp. 128-137. Trans. on Software Engineering, vol. SE-6, No. 3 (May 1980) pp. 297-304. Logs. Digital Equipment Corp. Technical Report CRL90/4 (Oct. 1990) Cambridge Research Lab, Cambridge, MA. Proc. ACM SIGMOD Conf. 1989, Portland, OR, pp. 315-324. Database Systems, vol. 15, No. 4 (Dec. 1990). Locking and Parial Rollbacks Using Write-Ahead Logging. IBM Research Report RJ 6649, (Jan. 1989) IBM Almaden Research Center, San Jose, CA. Trans. on Database Systems, vol. 13, No. 1 (Mar. 1988) pp. 53-90.

Affiliated with

Also associated with

Rating

Media recovery with time-split B-trees does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Media recovery with time-split B-trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Media recovery with time-split B-trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2211974