A systematic approach to relational database theory

@inproceedings{Imielinski1982ASA,
  title={A systematic approach to relational database theory},
  author={Tomasz Imielinski and Witold Lipski},
  booktitle={SIGMOD '82},
  year={1982}
}
In an attempt to eliminate motivational inconsistencies, we propose a new approach to relational database theory. Basically, a database schema is treated as a relational view defined over certain atomic, selfexplainable relations, constituting what we call a conceptual schema. In this new framework, we revisit some basic notions of the relational database theory, such as dependencies and schema equivalence. We point out a fundamental difference between functional dependencies, which we treat as… 
On derivation of network and relational schemas from an enhanced conceptual structure
TLDR
Ten of the basic conceptual structures from the overall number of one hundred transforms recognizable by the system are presented with respect to the network database design and then again for the relational database design.
A technique for translating states between database schemata
TLDR
It turns out that this information can be represented by a table similar to a tableau of Aho, Sagiv and Ullman, and a simple method is shown to construct this table, by using results developed for tables of this type in the context of representing incomplete information in relational databases.
Semantics in Databases
  • J. V. Leeuwen
  • Computer Science
    Lecture Notes in Computer Science
  • 2003
TLDR
This paper addresses the problem of specifying those repaired versions of the database as the minimal models of a theory written in Annotated Predicate Logic, and shows how to specify database repairs using disjunctive logic program with annotation arguments and a classical stable model semantics.
Foundations of entity-relationship modeling
  • B. Thalheim
  • Computer Science
    Annals of Mathematics and Artificial Intelligence
  • 2005
TLDR
The HERM model has the expressive power of semantic models and possesses the simplicity of the entity-relationship model, and shows that the model has a well-founded semantics.
An Overview on Semantical Constraints for Database Models
TLDR
This overview tries to give a unifying framework on integrity constraints in database models, using either a simple type system or type systems like the semantical models.
Semantical Constraints for Database Models
  • B. Thalheim
  • Computer Science
    CISM - Advances in Database Systems
  • 1993
TLDR
This overview tries to give a unifying framework on integrity constraints, which is used to express database semantics in object-oriented models and semantical models.
An enhanced conceptual structure derivation
A novel and comprehensive methodology for derivation of enhanced conceptual structures is presented. The methodology meets the current state of research in semantic database modeling and it has
Schema-agnostic queries for large-schema databases: A distributional semantics approach
TLDR
This work aims at proposing a complementary semantic model for databases, based on distributional semantic models, which provides a complementary perspective to the formal perspective of database semantics, which supports semantic approximation as a first-class database operation.
Null Values in Relational Databases and Sure Information Answers
  • H. Klein
  • Computer Science
    Semantics in Databases
  • 2001
TLDR
The null value problem is revisited with special emphasis on answers representing sure information with respect to possible world semantics and a new semantics for the no information interpretation of nulls is proposed taking into account a problem arising in connection with the closed world assumption.
...
1
2
3
...

References

SHOWING 1-10 OF 20 REFERENCES
A technique for translating states between database schemata
TLDR
It turns out that this information can be represented by a table similar to a tableau of Aho, Sagiv and Ullman, and a simple method is shown to construct this table, by using results developed for tables of this type in the context of representing incomplete information in relational databases.
Incomplete Information in Relational Databases
TLDR
There are precise conditions that should be satisfied in a semantically meaningful extension of the usual relational operators, such as projection, selection, union, and join, from operators on relations to operators on tables with “null values” of various kinds allowed.
A simplied universal relation assumption and its properties
TLDR
This work proposes a simpler method of describing the real world, where constraints are given by functional dependencies and a single join dependency, and characterize in terms of hypergraphs those multivalued dependencies that are the consequence of a given join dependency.
Multivalued dependencies and a new normal form for relational databases
TLDR
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).
On semantic issues connected with incomplete information databases
  • W. Lipski
  • Computer Science
    ACM Trans. Database Syst.
  • 1979
TLDR
This work emphasizes the distinction between two different interpretations of the query language—the external one, which refers the queries directly to the real world modeled in an incomplete way by the system, and the internal one, under which the queries refer to the system's information about this world, rather than to the world itself.
Relational Completeness of Data Base Sublanguages
  • E. Codd
  • Computer Science
    Research Report / RJ / IBM / San Jose, California
  • 1972
TLDR
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.
Calculating constraints on relational expression
TLDR
This paper deals with the problem of determining which of a certain class of constraints hold on a given relational algebra expression where the base relations come from a given schema, and defines operators specifying a closure function that will generate exactly the set of constraints valid on the given relationalgebra expression.
A Relational Model for Large Shared Data Banks
TLDR
His goal is to describe data, not to build a model of computation (which one would then be expected to prove equivalent to Turing Machines), and the idea of using a relation view of data to avoid ordering dependencies, access path dependencies and other implementation dependencies.
Theory of Relations for Databases - A Tutorial Survey
TLDR
This is an account of a theory of relations that has advanced from Codd's relational model of data for databases that deals with syntactic characterizations of the closed families of functional, multivalued, and general join dependencies that hold in relations.
The theory of joins in relational data bases
  • A. Aho, C. Beeri, J. Ullman
  • Computer Science
    18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
  • 1977
TLDR
An efficient algorithm to determine whether the join of several relations is semantically meaningful (lossless) and an efficient algorithmto determine whether a set of relations has a subset with a lossy join are given.
...
1
2
...