Scalable Uncertainty Management
7th International Conference, SUM 2013, Washington, DC, USA, September 16-18, 2013. Proceedings
Page
%P
-
Chapter and Conference Paper
Generalized Weighted Repairs
This paper deals with the problem of repairing inconsistent relational database instances in which facts are associated with nonnegative weights, representing their quality or trustfulness. Given a numeric agg...
-
Article
Consistent Query Answering for Primary Keys in Datalog
We study the complexity of consistent query answering on databases that may violate primary key constraints. A repair of such a database is any consistent database that can be obtained by deleting a minimal se...
-
Reference Work Entry In depth
Temporal Integrity Constraints
-
Reference Work Entry In depth
Temporal Dependencies
-
Living Reference Work Entry In depth
Temporal Dependencies
-
Living Reference Work Entry In depth
Temporal Integrity Constraints
-
Chapter and Conference Paper
First-Order Under-Approximations of Consistent Query Answers
Consistent Query Answering (CQA) has by now been widely adopted as a principled approach for answering queries on inconsistent databases. The consistent answer to a query q on an inconsistent database ...
-
Chapter and Conference Paper
A Survey of the Data Complexity of Consistent Query Answering under Key Constraints
This paper adopts a very elementary representation of uncertainty. A relational database is called uncertain if it can violate primary key constraints. A repair of an uncertain database is obtained by selectin...
-
Book and Conference Proceedings
-
Chapter and Conference Paper
Certain Conjunctive Query Answering in SQL
An uncertain database db is defined as a database in which distinct tuples of the same relation can agree on their primary key. A repair (or possible world) of db is then obtained by selecting a maximal number of...
-
Chapter and Conference Paper
Uncertainty That Counts
Uncertainty is modeled by a multibase (db,μ) where db is a database with zero or more primary key violations, and μ associates a multiplicity (a positive integer) to each fact of db. In data integration, the mult...
-
Reference Work Entry In depth
Temporal Dependencies
-
Reference Work Entry In depth
Temporal Integrity Constraints
-
Chapter and Conference Paper
On the Consistent Rewriting of Conjunctive Queries Under Primary Key Constraints
This article deals with the computation of consistent answers to queries on relational databases that violate primary key constraints. A repair of such inconsistent database is obtained by selecting a maximal ...
-
Book and Conference Proceedings
Current Trends in Database Technology – EDBT 2006
EDBT 2006 Workshops PhD, DataX, IIDB, IIHA, ICSNW, QLQP, PIM, PaRMA, and Reactivity on the Web, Munich, Germany, March 26-31, 2006, Revised Selected Papers
-
Chapter and Conference Paper
Project-Join-Repair: An Approach to Consistent Query Answering Under Functional Dependencies
Consistent query answering is the term commonly used for the problem of answering queries on databases that violate certain integrity constraints. We address this problem for universal re...
-
Chapter and Conference Paper
Making More Out of an Inconsistent Database
Repairing a database means making the database consistent by applying changes that are as small as possible. Nearly all approaches to repairing have assumed deletions and insertions of entire tuples as basic r...
-
Chapter
Logical Languages for Data Mining
Data mining focuses on the development of methods and algorithms for such tasks as classification, clustering, rule induction, and discovery of associations. In the database field, the view of data mining as a...
-
Chapter and Conference Paper
Condensed Representation of Database Repairs for Consistent Query Answering
Repairing a database means bringing the database in accordance with a given set of integrity constraints by applying modifications that are as small as possible. In the seminal work of Arenas et al. on query a...
-
Chapter and Conference Paper
On Monotone Data Mining Languages
We present a simple Data Mining Logic (DML) that can express common data mining tasks, like “Find Boolean association rules” or “Find inclusion dependencies.” At the center of the paper is the problem of chara...
