Recovery can be extended to new domains at reduced logging cost by exploiting "logical"log operations. During recovery, a logical log operation may read data values from any recoverable object, not solely from values on the log or from the updated object. Hence, we needn't log these values, a substantial saving. In [8], we developed a redo recovery theory that deals with general log operations and proved that the stable database remains recoverable when it is explained in terms of an installation graph. This graph was used to derived a write graph that determines a flush order for cached objects that ensures that the database remains recoverable. In this paper, we introduce a refined write graph that permits more flexible cache management that flushes smaller sets of objects. Using this write graph, we show how: (i) the cache manager can inject its own operations to break up atomic flush sets; and (ii) the recovery process can avoid redoing operations whose effects aren't needed by exploiting generalized recovery LSNs. These advances permit more cost-effective recovery for, e.g., files and applications.
CITATION STYLE
Lomet, D., & Tuttle, M. (1999). Logical Logging to Extend Recovery to New Domains. In Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 73–84). Association for Computing Machinery. https://doi.org/10.1145/304182.304189
Mendeley helps you to discover research relevant for your work.