192 search results - page 15 / 39 » Using SAT-Solvers to Compute Inference-Proof Database Instan... |
ICDE
2012
IEEE
12 years 12 months ago
2012
IEEE
—The importance of introducing distance constraints to data dependencies, such as differential dependencies (DDs) [28], has recently been recognized. The metric distance constrai...
PODS
2005
ACM
15 years 9 months ago
2005
ACM
Abstract. We present a semantics and answer set programs for relational peer data exchange systems. When a peer answers a query, it exchanges data with other peers in order to supp...
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
High-quality annotation of biological data is central to bioinformatics. Annotation using terms from ontologies provides reliable computational access to data. The Gene Ontology (...
ICDT
1995
ACM
15 years 1 months ago
1995
ACM
A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple ...
EDBT
2010
ACM
15 years 4 months ago
2010
ACM
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...