Efficient (In-)Consistency Management for Heterogeneous Repositories

When a group of authors collaboratively edits interrelated documents, consistency problems occur almost immediately. Current document management systems (DMS) often lack adequate facilities for consistency management. We extend traditional DMS by explicit formal consistency rules. In contrast to many other approaches, we permit inconsistencies and present the consequences to the user, which is vital for flexible document management and information management. Based on a novel semantics our tools pinpoint inconsistent document parts and tell precisely when, where, and why a repository is inconsistent. In this paper we focus on a key issue: efficient techniques for consistency rule evaluation. Our strategy is known from databases: (1) static analysis characterizes and simplifies consistency rules and (2) at run-time rules are evaluated incrementally. The major differences to databases are that we consider informal documents and explicitly allow inconsistencies. Consequently, we lack formal update descriptions and cannot rely on consistency prior to updates. The contribution of this paper is to incrementally evaluate consistency rules in the presence of previous inconsistencies. We have implemented our techniques in a revision control system. Our experiments show that efficient incremental evaluation is the key to make our approach viable.

[1]  Dimitrios Plexousakis On the Efficient Maintenance of Temporal Integrity in Knowledge Bases , 1996 .

[2]  Dennis de Champeaux Subproblem finder and instance checker, two cooperating modules for theorem provers , 1986, JACM.

[3]  Elke A. Rundensteiner,et al.  Consistently updating XML documents using incremental constraint check queries , 2002, WIDM '02.

[4]  Bashar Nuseibeh,et al.  Leveraging Inconsistency in Software Development , 2000, Computer.

[5]  Serge Abiteboul,et al.  Temporal versus first-order logic to query temporal databases , 1996, PODS.

[6]  Licia Capra,et al.  xlinkit: a consistency checking and smart link generation service , 2002, TOIT.

[7]  Simon Peyton Jones,et al.  Playing by the rules: rewriting as a practical optimisation technique in GHC , 2001 .

[8]  Harrie C. M. de Swart,et al.  Three Types of Redundancy in Integrity Checking: An Optimal Solution , 1999, Data Knowl. Eng..

[9]  Peyton Jones,et al.  Haskell 98 language and libraries : the revised report , 2003 .

[10]  Jennifer Widom,et al.  Constraint checking with partial information , 1994, PODS.

[11]  Johan Nordlander,et al.  Reactive Objects and Functional Programming , 1999 .

[12]  Maria Amélia Pacheco e Silva,et al.  Dynamic Integrity Constraints Definition and Enforcement in Databases: A Classification Framework , 1997, IICIS.

[13]  Yanhong A. Liu Eecient Computation via Incremental Computation , 1998 .

[14]  Jan Scheffczyk,et al.  Consistent document engineering , 2004 .