【24h】

Transaction Processing and a Recovery Algorithm for a Deductive Database

机译:演绎数据库的事务处理和恢复算法

获取原文
获取原文并翻译 | 示例

摘要

In order for deductive databases to produce answers in a reasonable amount of time, many systems make the assumption that the relations representing rules will keep previous results in a cache. Changes to these caches may occur when a query requests new information, or when the underlying relational database is updated. The complexity of keeping these caches current dictates that a more robust transaction processing method needs to be developed. This paper outlines such a method and presents the associated recovery algorithm as well.
机译:为了使演绎数据库在合理的时间内产生答案,许多系统都假设表示规则的关系会将先前的结果保留在缓存中。当查询请求新信息或更新基础关系数据库时,可能会对这些缓存进行更改。使这些高速缓存保持最新状态的复杂性决定了需要开发一种更强大的事务处理方法。本文概述了这种方法,并提出了相关的恢复算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号