Records retention in relational database systems
Records retention in relational database systems
复制标题
关系数据库系统中的记录保留
DOI：
--
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
Frank Wm. Tompa
中科院分区：
文献类型：
--
作者：
Ahmed A. Ataullah;Ashraf Aboulnaga;Frank Wm. Tompa
最近出台的几项立法规定了公司记录的最短和最长保留期，这促使企业内容管理(ECM)社区开发了各种记录保留解决方案。记录保留是记录管理的一个重要子领域，法律记录保留要求适用于公司记录，无论其形状或形式如何。遗憾的是，现有解决方案的范围在很大程度上局限于文件的适当识别、分类和保留，而不是更一般的数据。
在本文中，我们讨论了在关系数据库系统的上下文中管理记录保留的问题。由于几个原因，这个问题比文档的问题更具挑战性。最重要的是，关系数据库中的业务记录没有明确的定义；它可以是整个表、元组、元组的一部分，也可以是多个表中几个元组的一部分。也没有用于清除、匿名和保护关系记录的标准化机制。函数依赖、用户定义的约束和触发器引起的副作用使得更难保证任何给定的记录在需要保护或在满足必要条件时被删除时实际上将受到保护。最重要的是，可以组织关系元组，使得一条数据可以是各种法律记录的一部分，并服从几个(可能相互冲突的)保留策略。
我们解决了上述问题，并提出了一个完整的解决方案，用于设计、管理和实施关系数据库系统中的记录保留策略。我们通过实验证明，所提出的框架可以保证在现成的系统上遵守广泛的保留策略，而不会在策略监控和执行方面产生显著的性能开销。
The recent introduction of several pieces of legislation mandating minimum and maximum retention periods for corporate records has prompted the Enterprise Content Management (ECM) community to develop various records retention solutions. Records retention is a significant subfield of records management, and legal records retention requirements apply over corporate records regardless of their shape or form. Unfortunately, the scope of existing solutions has been largely limited to proper identification, classification and retention of documents, and not of data more generally.
In this paper we address the problem of managed records retention in the context of relational database systems. The problem is significantly more challenging than it is for documents for several reasons. Foremost, there is no clear definition of what constitutes a business record in relational databases; it could be an entire table, a tuple, part of a tuple, or parts of several tuples from multiple tables. There are also no standardized mechanisms for purging, anonymizing and protecting relational records. Functional dependencies, user defined constraints, and side effects caused by triggers make it even harder to guarantee that any given record will actually be protected when it needs to be protected or expunged when the necessary conditions are met. Most importantly, relational tuples may be organized such that one piece of data may be part of various legal records and subject to several (possibly conflicting) retention policies.
We address the above problems and present a complete solution for designing, managing, and enforcing records retention policies in relational database systems. We experimentally demonstrate that the proposed framework can guarantee compliance with a broad range of retention policies on an off-the-shelf system without incurring a significant performance overhead for policy monitoring and enforcement.