232
click to vote
PODS
10 years 1 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...
154
click to vote
PODS
10 years 1 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...
146
click to vote
PODS
10 years 1 months ago
2015 ACM 
This paper aims to understand the I/O-complexity of maintaining a big sample set—whose size exceeds the internal memory’s capacity—on a data stream. We study this topic in a...
146
click to vote
PODS
10 years 1 months ago
2015 ACM
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...
|
Database