Titlebook: Incomplete Data and Data Dependencies in Relational Databases; Sergio Greco,Cristian Molinaro,Francesca Spezzano Book 2012 Springer Nature

FACET

Introduction,70s and early 1980s [Armstrong, 1974, Codd, 1972, Fagin and Vardi, 1986, Vardi]. Data dependencies have long been used to express . on data, that is semantic properties that database instances should satisfy to properly reflect the real state of the world. Furthermore, data dependencies have been us

emission

傾聽

Data Dependencies and Normal Forms, chapter we study special classes of data dependencies and . for relations. Normal forms are introduced to eliminate or minimize redundant information, that is single attribute values or tuples which can be derived from other information using dependencies. Normal forms have been studied over the la

種植,培養(yǎng)

輕彈

Ruptured-Disk

從容

Relational Databases,A database is a collection of data organized to model relevant aspects of reality and support processes requiring this information.

Overdose

The Chase Algorithm,The Chase is a fixpoint algorithm enforcing satisfaction of data dependencies in databases. It was proposed more than 30 years ago by Aho et al. [1979a], Maier et al. [1979] and has received increasing attention in recent years in both database theory and practical applications.

敏捷

avulsion

Chase and Database Applications,This chapter describes several database applications in which some typical database problems arise, and where the chase represents a fundamental tool for their solution. In every case, the termination of the chase algorithm guarantees the applicability of the proposed resolution methods.