Results 271 to 280 of about 287,498 (311)

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   +1 more source

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   +1 more source

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   +1 more source

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

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   +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   +1 more source

Logical Theories of Intention and the Database Perspective

Journal of Philosophical Logic, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Database theory column

ACM SIGACT News, 2006
The 25th edition of the ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Databases (PODS), took place from 26 to 29 June 2006, at the Renaissance Chicago Hotel in Chicago. As usual since 1991, the symposium was organized jointly with the ACM SIGMOD International Conference on Management of Data.
openaire   +1 more source

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

A Modified Hydrologic Model Algorithm Based on Integrating Graph Theory and GIS Database

Water (Switzerland), 2022
Chih-Chung Chung, Tzuping Chiang
exaly