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 exploitinggeneralized recovery LSNs. These advances permit more cost-effective recovery for, e.g., files and applications.
机译:“对数域状态空间”:用于对数域过滤的系统晶体管级方法
机译:“对数域状态空间”:用于对数域滤波的系统晶体管级方法
机译:远程访问逻辑漏洞分类的域方法
机译:逻辑日志记录将恢复扩展到新域
机译:计划域的交互式逻辑分析
机译:扩展结肠癌逻辑模型的中间建模策略改善了上皮衍生的癌细胞系中的药物协同性预测
机译:最近的成功与逻辑逻辑推理的元逻辑方法(扩展摘要)