Consistency preserving updates in deductive databases

Mayol, Enric; Teniente, Ernest

doi:10.1016/s0169-023x(03)00061-2

Cited by 11 publications

(7 citation statements)

References 34 publications

(58 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There has been considerable research into this problem over the last four decades, and numerous different approaches have been suggested in the context of relational, non-relational (e.g., [21,29,31,33]), and deductive databases (e.g., [2,3,7,24]). We shall now briefly review some key developments in the relational context.…”

Section: The View Update Problemmentioning

confidence: 99%

Characterising relational view updates using relative information capacity

Stanger

2017

Proceedings of the Australasian Computer Science Week Multiconference

View full text Add to dashboard Cite

In 2013, Chris Date published a book about the view update problem in the context of the Relational Model. He presented several detailed examples of different varieties of view updates and characterised their behaviour, in the process deriving a set of principles for updating views based on the notion of information equivalence of view schemas. In this paper we discuss work in progress that examines how Date's operational definition of information equivalence can be formally characterised using Hull's concept of relative information capacity. As a proof of concept, we use an extension of Miller's schema intension graph formalism to model the information equivalence of Date's restriction view example.

show abstract

Section: The View Update Problemmentioning

confidence: 99%

Characterising relational view updates using relative information capacity

Stanger

2017

Proceedings of the Australasian Computer Science Week Multiconference

View full text Add to dashboard Cite

show abstract

“…The results on diagnosing and repairing logical inconsistency in multi-context systems [16,17] can therefore be used to tackle this problem. By considering deductive databases as MCSs, we also see the problem of repairing an inconsistent MCS as a generalization of the view-update problem [24,25,32].…”

Section: Repairs and Managed Multi-context Systemsmentioning

confidence: 99%

Integrity Constraints for General-Purpose Knowledge Bases

Cruz-Filipe¹,

Nunes²,

Schneider–Kamp³

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Integrity constraints in databases have been studied extensively since the 1980s, and they are considered essential to guarantee database integrity. In recent years, several authors have studied how the same notion can be adapted to reasoning frameworks, in such a way that they achieve the purpose of guaranteeing a system's consistency, but are kept separate from the reasoning mechanisms. In this paper we focus on multi-context systems, a general-purpose framework for combining heterogeneous reasoning systems, enhancing them with a notion of integrity constraints that generalizes the corresponding concept in the database world.Comment: FoIKS 201

show abstract

“…In Section 4.1 we formalize the construction of this graph, whose idea is drawn from an approach to improve the efficiency of integrity maintenance in deductive databases [Mayol and Teniente 2003]. Then, in Section 4.2 we explain how to use this graph to determine the absence of infinite models in the schema.…”

Section: Validationmentioning

confidence: 99%

Verification and Validation of UML Conceptual Schemas with OCL Constraints

Queralt

Teniente

2012

ACM Trans. Softw. Eng. Methodol.

Self Cite

View full text Add to dashboard Cite

To ensure the quality of an information system, it is essential that the conceptual schema that represents the knowledge about its domain is semantically correct. The semantic correctness of a conceptual schema can be seen from two different perspectives. On the one hand, from the point of view of its definition, a conceptual schema must be right. This is ensured by means of verification techniques that check whether the schema satisfies several correctness properties. On the other hand, from the point of view of the requirements that the information system should satisfy, a schema must also be the right one. This is ensured by means of validation techniques, which help the designer understand the exact meaning of a schema and to see whether it corresponds to the requirements. In this article we propose an approach to verify and validate UML conceptual schemas, with arbitrary constraints formalized in OCL. We have also implemented our approach to show its feasibility.

show abstract

Consistency preserving updates in deductive databases

Cited by 11 publications

References 34 publications

Characterising relational view updates using relative information capacity

Characterising relational view updates using relative information capacity

Integrity Constraints for General-Purpose Knowledge Bases

Verification and Validation of UML Conceptual Schemas with OCL Constraints

Contact Info

Product

Resources

About