Sciweavers

180
Voted
PODS
2015
ACM
31views Database» more  PODS 2015»
9 years 10 months ago
The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints
A relational database is said to be uncertain if primary key constraints can possibly be violated. A repair (or possible world) of an uncertain database is obtained by selecting a...
Paraschos Koutris, Jef Wijsen
130
Voted
PODS
2015
ACM
11views Database» more  PODS 2015»
9 years 10 months ago
Symmetric Weighted First-Order Model Counting
Paul Beame, Guy Van den Broeck, Eric Gribkoff, Dan...
122
Voted
PODS
2015
ACM
13views Database» more  PODS 2015»
9 years 10 months ago
Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search
Locality Sensitive Hashing (LSH) has emerged as the method of choice for high dimensional similarity search, a classical problem of interest in numerous applications. LSH-based so...
Michael Kapralov
PODS
2015
ACM
12views Database» more  PODS 2015»
9 years 10 months ago
Dichotomies in the Complexity of Preferred Repairs
The framework of database repairs provides a principled approach to managing inconsistencies in databases. Informally, a repair of an inconsistence database is a consistent databa...
Ronald Fagin, Benny Kimelfeld, Phokion G. Kolaitis
117
Voted
PODS
2015
ACM
24views Database» more  PODS 2015»
9 years 10 months ago
Chase Termination for Guarded Existential Rules
Abstract. The chase procedure is considered as one of the most fundamental algorithmic tools in database theory. It has been successfully applied to different database problems suc...
Marco Calautti, Georg Gottlob, Andreas Pieris
Database
Top of PageReset Settings