197
click to vote
PODS
2015
ACM
9 years 11 months ago
2015
ACM
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...
126
Voted
PODS
2015
ACM
9 years 11 months ago
2015
ACM
120
click to vote
PODS
2015
ACM
9 years 11 months ago
2015
ACM
In this paper, we revisit two fundamental problems in database theory. The first one is called join dependency (JD) testing, where we are given a relation r and a JD, and need to...
143
Voted
PODS
2015
ACM
9 years 11 months ago
2015
ACM
135
click to vote
PODS
2015
ACM
9 years 11 months ago
2015
ACM
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...