Dependencies in Relational Databases

Thalheim, Bernhard

doi:10.1007/978-3-663-12018-6

Cited by 122 publications

(58 citation statements)

References 135 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Due to its extensive usage, a large number of extensions to this model were proposed in the 1980s and 1990s. Cardinality constraints [5,10,11,19,32] are the most important generalisation of relational database constraints [31]. These proposals have been evaluated, integrated or explicitly discarded in the intensive research discussion surrounding this area.…”

Section: Codesign Of Schema-centric Database Systems: the Local-as-vimentioning

confidence: 99%

See 1 more Smart Citation

Codesign of Web Information Systems

Thalheim

Schewe

2015

Correct Software in Web Applications and Web Services

Self Cite

View full text Add to dashboard Cite

Web information systems are nowadays widely used. E-business, edutainment, infotainment, community and identity Web systems are data and information intensive. They integrate a variety of database, workflow and other processing, communication and presentation systems. Their design and development is thus based on an integrated development of structuring, functionality, distribution and interactivity of users. The codesign framework allows the integration of these different aspects. This chapter surveys the codesign approach and its deployment for the development of large Web information systems.

show abstract

Section: Codesign Of Schema-centric Database Systems: the Local-as-vimentioning

confidence: 99%

“…Other classes of importance for the HERM schema are multivalued dependencies, inclusion and exclusion constraints and existence dependencies [31]. Functional dependencies, keys and referential constraints (or key-based inclusion dependencies) can be expressed through cardinality constraints.…”

Section: Static Integrity Constraintsmentioning

confidence: 99%

Codesign of Web Information Systems

Thalheim

Schewe

2015

Correct Software in Web Applications and Web Services

Self Cite

View full text Add to dashboard Cite

show abstract

“…Integrity constraints have been introduced in order to increase the semantic contents of relational databases. Amon integrity constraints, the following are the most studied classes: functional dependencies [34,51], equality generating dependencies and tuple generating dependencies [15]. Integrity constraints, as opposed to relational types, can be used for query optimization.…”

Section: Preliminariesmentioning

confidence: 99%

Types and Constraints: From Relational to XML Data

Bidoit-Tollu

2011

Semantics in Data and Knowledge Bases

View full text Add to dashboard Cite

Abstract. The goal of this article is to show that, in the context of XML data processing, information conveyed by schema or XML types is a powerful component to deploy optimization methods. We focus on the one hand on recent work developed for optimizing query and update evaluation for main-memory engines and on the other hand on techniques for checking XML query-update independence. These methods are all based on static type analysis. The aim of the article is to show how types rank before constraints for XML data processing and the presentation of each method is kept informal.

show abstract

“…The topic of dependencies on relational databases has been studied extensively, if not exhaustively [Tha91]. Therefore, the discussion here is limited to establishing notation and nonstandard conventions.…”

Section: Egds and Uindsmentioning

confidence: 99%

The complexity of embedded axiomatization for a class of closed database views

Hegner

2006

Ann Math Artif Intell

View full text Add to dashboard Cite

It is well known that the complexity of testing the correctness of an arbitrary update to a database view can be far greater than the complexity of testing a corresponding update to the main schema. However, views are generally managed according to some protocol which limits the admissible updates to a subset of all possible changes. The question thus arises as to whether there is a more tractable relationship between these two complexities in the presence of such a protocol. In this paper, this question is addressed for closed update strategies, which are based upon the constant-complement approach of Bancilhon and Spyratos. The approach is to address a more general question -that of characterizing the complexity of axiomatization of views, relative to the complexity of axiomatization of the main schema. For schemata constrained by denial or consistency constraints, that is, statements which rule out certain situations, such as the equalitygenerating dependencies (EGDs) or, more specifically, the functional dependencies (FDs) of the relational model, a broad and comprehensive result is obtained in a very general framework which is not tied to the relational model in any way. It states that every such schema is governed by an equivalent set of constraints which embed into the component views, and which are no more complex than the original set. For schemata constrained by generating dependencies, of which tuple-generating dependencies (TGDs) in general and, more specifically, both join dependencies (JDs) and inclusion dependencies (INDs) are examples within the relational model, a similar result is obtained, but only within a context known as meet-uniform decompositions, which fails to recapture some important situations.To address the all-important case of relational schemata constrained by both FDs and INDs, a hybrid approach is also developed, in which the general theory regarding denial constraints is blended with a focused analysis of a special but very practical subset of the INDs known as fanout-free unary inclusion dependencies (fanout-free UINDs), to obtain results parallel to the above-mentioned cases: every such schema is governed by an equivalent set of constraints which embed into the component views, and which are no more complex than the original set. In all cases, the question of view update complexity is then answered via a corollary to this main result. † Parts of this paper are based upon work reported in [Heg04b] 1

show abstract

Dependencies in Relational Databases

Cited by 122 publications

References 135 publications

Codesign of Web Information Systems

Codesign of Web Information Systems

Types and Constraints: From Relational to XML Data

The complexity of embedded axiomatization for a class of closed database views

Contact Info

Product

Resources

About