The Community for Technology Leaders
Green Image
Issue No. 11 - Nov. (2014 vol. 26)
ISSN: 1041-4347
pp: 2676-2688
Lipika Deka , Loughborough University, Loughborough LE11 3TU, UK
Gautam Barua , Indian Institute of Technology , Guwahati, India
ABSTRACT
The backup taken of a file system must be consistent, preserving data integrity across files in the file system. With file system sizes getting very large, and with demand for continuous access to data, backup has to be taken when the file system is active (is online). Arbitrarily taken online backup may result in an inconsistent backup copy. We propose a scheme referred to as mutual serializability to take a consistent backup of an active file system assuming that the file system supports transactions. The scheme extends the set of conflicting operations to include read-read conflicts, and it is shown that if the backup transaction is mutually serializable with every other transaction individually, a consistent backup copy is obtained. The user transactions continue to serialize within themselves using some standard concurrency control protocol such as Strict 2PL. We put our scheme into a formal framework to prove its correctness, and the formalization as well as the correctness proof are independent of the concurrency control protocol used to serialize user transactions. The scheme has been implemented and experiments show that consistent online backup is possible with reasonable overhead.
INDEX TERMS
Schedules, Concurrency control, Protocols, Databases, File systems, Standards, Analytical models
CITATION

L. Deka and G. Barua, "Consistent Online Backup in Transactional File Systems," in IEEE Transactions on Knowledge & Data Engineering, vol. 26, no. 11, pp. 2676-2688, 2014.
doi:10.1109/TKDE.2014.2302297
188 ms
(Ver 3.3 (11022016))