FOL Modeling of Integrity Constraints (Dependencies)

@inproceedings{Deutsch2009FOLMO,
  title={FOL Modeling of Integrity Constraints (Dependencies)},
  author={Alin Deutsch},
  booktitle={Encyclopedia of Database Systems},
  year={2009}
}
  • A. Deutsch
  • Published in
    Encyclopedia of Database…
    2009
  • Computer Science
DEFINITION Integrity constraints (also known as dependencies in the relational model) are domain-specific declarations which indicate the intended meaning of the data stored in a database. They complement the description of the structure of the data (e.g. in the relational model the structure is given by listing the names of tables and the names and types of their attributes). Integrity constraints express properties that must be satisfied by all instances of a database schema that can arise in… 

Cardinality Constraints for Probabilistic and Possibilistic Databases

This thesis addresses the gap in the possibilistic model by developing probabilistic cardinality constraints and, after identifying the inability to finitely axiomatise the authors' understanding of a class of Probabilistic functional dependencies, it turns to extending the Possibilism model by merging the two classes of possibIListic cardinalities constraints and possibile functional dependencies.

A Diagnosis and Repair Framework for DL-LiteA KBs

This work proposes a novel, fully automatic framework for detecting and repairing violations of integrity constraints, by considering both explicit and implicit ontological knowledge.

Consistent Query Answering for Expressive Constraints under Tuple-Deletion Semantics

The complexity of consistent query answering and repair checking under tuple-deletion semantics for different fragments of the above constraint language is established and new subclasses of constraints in which the above problems are tractable or even rewritable are identified.

Formal foundations for RDF/S KB evolution

This work defines the notion of a rational change operator as one that satisfies the belief revision principles of Success, Validity and Minimal Change, and proposes a general-purpose algorithm for implementing rational change operators in knowledge bases with integrity constraints.

Foundations of SPARQL query optimization

While studied in the context of a theoretically motivated set semantics, almost all results carry over to the official, bag-based semantics and therefore are of immediate practical relevance.

The Chase Procedure and its Applications in Data Exchange

  • Adrian Onet
  • Computer Science
    Data Exchange, Information, and Streams
  • 2013
This chapter reviews the chase algorithm and its properties as well as its application in data exchange.

The View Update Problem Revisited

This paper characterise when a view mapping is invertible, establishing that this is the case precisely when each database symbol has an exact rewriting in terms of the view symbols under the given constraints, and provides a general effective criterion to understand whether the changes introduced by a view update can be propagated to the underlying database relations in a unique and unambiguous way.

Evolution of Ontologies using ASP

This is the first work to examine how ASP techniques can be applied to model and implement the evolution process, and consists in providing a general translation of the problem into ASP, thereby reducing it to an instance of an ASP program that can be solved by an ASP solver.

The backchase revisited

  • M. Meier
  • Computer Science
    The VLDB Journal
  • 2013
The implementation of this paper's approach, the Pegasussystem, outperforms existing C&B systems an average by two orders of magnitude and is due to a combination of novel methods that lower the complexity in practical situations significantly.

Materialized Views

This monograph provides an accessible introduction and reference to materialized views, explains its core ideas, highlights its recent developments, and points out its sometimes subtle connections to other research topics in databases.

References

SHOWING 1-10 OF 27 REFERENCES

Normalization and hierarchical dependencies in the relational data model

A new approach to the conceptual design of logical schemata for relational databases by means of functional dependencies and multivalued dependencies is presented and first-order hierarchical decomposition is introduced.

Multivalued dependencies and a new normal form for relational databases

It is shown that every relation schema can be decomposed into a family of relation schemata in fourth normal form without loss of information (that is, the original relation can be obtained from the new relations by taking joins).

Horn clauses and database dependencies

A new concept is mtroduced, called "faithfulness (with respect to direct product)," which enables powerful results to be proved about the existence of "Armstrong relations" in the presence of these new dependencies.

XML queries and constraints, containment and reformulation

On the foundations of the universal relation model

The universal relation model aims at achieving complete access-path independence in relational databases by relieving the user of the need for logical navigation among relations. We clarify the

Algebraic dependencies

On decomposition of relational databases

  • Moshe Y. Vardi
  • Mathematics
    23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
  • 1982
It is got that the reconstruction map, which is the inverse to the decomposition map, is also first-order, but is not necessarily the natural join, by applying Beth's Definability Theorem from model theory.

Rewriting queries using views with access patterns under integrity constraints

Elements of Relational Database Theory

  • P. Kanellakis
  • Computer Science
    Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990

Relational Completeness of Data Base Sublanguages

  • E. Codd
  • Computer Science
    Research Report / RJ / IBM / San Jose, California
  • 1972
This paper attempts to provide a theoretical basis which may be used to determine how complete a selection capability is provided in a proposed data sublanguage independently of any host language in which the sublanguage may be embedded.