Sciweavers

169
Voted
PODS
2015
ACM
31views Database» more  PODS 2015»
9 years 8 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
117
Voted
PODS
2015
ACM
11views Database» more  PODS 2015»
9 years 8 months ago
Symmetric Weighted First-Order Model Counting
Paul Beame, Guy Van den Broeck, Eric Gribkoff, Dan...
104
Voted
PODS
2015
ACM
13views Database» more  PODS 2015»
9 years 8 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
102
Voted
PODS
2015
ACM
12views Database» more  PODS 2015»
9 years 8 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
101
Voted
PODS
2015
ACM
17views Database» more  PODS 2015»
9 years 8 months ago
The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication
Dirk Van Gucht, Ryan Williams, David P. Woodruff, ...
Database
Top of PageReset Settings