Results 301 to 310 of about 1,622,308 (337)

Database Design Theory

1992
Part 1 Data modelling: a relational data model concepts of the relational data model, operations defined on a set of relations, normal operations defined on a set of instances, synthesis - data dictionary, example - production workshop, integrity rules integrity rule, introduction to dependencies, functional and dimensional dependencies, join and ...
openaire   +2 more sources

Unified Theory of Database Serializability12

Fundamenta Informaticae, 1991
A database system is a collection of data items, read or written by transactions in a possibly interleaved fashion. An interleaved execution is assumed to be correct if the sequence of the steps of the transactions, called history, is serializable, that is, the effect of the execution is equivalent to that of some serial execution of the same ...
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   +2 more sources

An Introduction to Relational Database Theory

2002
A properly designed relational database is a flexible and powerful management tool, and a proper design requires knowledge of relational database theory. Unfortunately, many users undertake the business of creating an Access database with little knowledge of how Access really works.
Martin W. P. Reid, Susan Sales Harkins
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

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

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

Moving database theory into database practice

ACM Computing Surveys, 1996
openaire   +2 more sources

Database theory and practice

Information and Software Technology, 1988
openaire   +2 more sources

Theory of database queries

Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, 1988
openaire   +1 more source