Results 271 to 280 of about 9,892,012 (315)

An Algebraic Theory of Relational Databases

Bell System Technical Journal, 1983
In this paper we present a theory of relational database systems based on the partition lattice, which represents a new mathematical approach to the structure of relational database systems. A partition lattice can be defined for any given relation.
openaire   +3 more sources

A theory of reliability in database systems

Journal of the ACM, 1988
Reliable concurrent processing of transactions in a database system is examined. Since serializability, the conventional concurrency control correctness criterion, is not adequate in the presence of common failures, another theory of correctness is proposed, involving the concepts ofcommit serializability, recoverability,andresiliency.
openaire   +2 more sources

Contribution to a theory of database reverse engineering

[1993] Proceedings Working Conference on Reverse Engineering, 2002
The paper proposes both a general framework and specific techniques for file and database reverse engineering, i.e. recovering its conceptual schema. The framework relies on a process/product model that matches formal as well as empirical design procedures.
Hainaut, Jean-Luc, Chandelon, Muriel, Tonneau, Catherine, Joris, Michel   +3 more
openaire   +2 more sources

Two applications of equational theories to database theory

1985
Databases and equational theorem proving are well developed and seemingly unrelated areas of Computer Science Research. We provide two natural links between these fields and demonstrate how equational theorem proving can provide useful and tools for a variety of database tasks.
Stavros S. Cosmadakis, Paris C. Kanellakis   +1 more
openaire   +2 more sources

A Generalized Transaction Theory for Database and Non-database Tasks

1999
In both database transaction management and parallel programming, parallel execution of operations is one of the most essential features. Although they look quite different, we will show that many important similarities exist. As a result of a more careful comparison we will be able to point out that recent progress in database transaction management ...
Armin Fessler, Hans-Jörg Schek
openaire   +2 more sources

The theory of deductive database systems

Digest of Papers Compcon Spring '90. Thirty-Fifth IEEE Computer Society International Conference on Intellectual Leverage, 2002
Highlights in three areas are discussed: (1) efficient algorithms for evaluating declarative logic, with 'declarative' referring to logical rules (if . . . then statements) whose intended meaning is the minimal fixpoint, that is, the set of deducible facts; (2) methods for dealing with nonmonotonic logic, that is, with sets of rules that do not have a ...
openaire   +2 more sources

A constructive logic approach to database theory

1992
In this paper we propose an approach to database theory based on a constructive logic. The semantics here assumed is a particular one; it is based on the notion of info(K,F) (the information type of F), where K is the set of constants of a first order language L, F is a formula of L and info(K,F) is the set of all the possible pieces of information ...
Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi   +2 more
openaire   +2 more sources

Database theory—past and future

Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, 1987
We briefly sketch the development of the various branches of database theory. One important branch is the theory of relational databases, including such areas as dependency theory, universal-relation theory, and hypergraph theory. A second important branch is the theory of concurrency control and distributed databases.
openaire   +1 more source

Contribution to the theory of concurrency in databases

1978
A database can be seen as a set of entities which satisfy certain assertions called integrity constraints. A database is simultaneously accessed by numerous transactions. Each transaction is composed of a sequence of atomic actions and performs a set of operations.
openaire   +2 more sources

Constraint satisfaction and database theory

Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '00, 2000
A large class of problems in AI and other areas of computer science can be viewed as constraint-satisfaction problems. This includes problems in machine vision, belief maintenance, scheduling, temporal reasoning, type reconstruction, graph theory, and satisfiability.
openaire   +1 more source