127
Voted
PODS
16 years 18 days ago
2008 ACM 
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
PODS
16 years 18 days ago
2008 ACM
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
105
click to vote
PODS
16 years 18 days ago
2008 ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
112
click to vote
PODS
16 years 18 days ago
2008 ACM 
We present a formal framework for capturing the provenance of data appearing in XQuery views of XML. Building on previous work on relations and their (positive) query languages, w...
115
click to vote
PODS
16 years 18 days ago
2008 ACM
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
|
Database