47 search results - page 1 / 10 » Beginnings of a Theory of General Database Completions |
ICDT
1990
ACM
13 years 11 months ago
1990
ACM
Ordinary logical implication is not enough for answering queries in a logic database, since especially negative information is only implicitly represented in the database state. M...
EDBT
1990
ACM
13 years 11 months ago
1990
ACM
Deductive Databases are coming of age with the emergence of efficient and easy to use systems that support queries, reasoning, and application development on databases through dec...
MFCS
2001
Springer
13 years 11 months ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...
PODS
2009
ACM
14 years 7 months ago
2009
ACM
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
The need for high availability and performance in data management systems has been fueling a long running interest in database replication from both academia and industry. However...