Sciweavers

PODS
2008
ACM
178views Database» more  PODS 2008»
14 years 11 months ago
The chase revisited
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...
Alin Deutsch, Alan Nash, Jeffrey B. Remmel
PODS
2008
ACM
129views Database» more  PODS 2008»
14 years 11 months ago
Tree-width and functional dependencies in databases
Conjunctive query (CQ) evaluation on relational databases is NP-complete in general. Several restrictions, like bounded tree-width and bounded hypertree-width, allow polynomial ti...
Isolde Adler
PODS
2008
ACM
250views Database» more  PODS 2008»
14 years 11 months ago
Approximating predicates and expressive queries on probabilistic databases
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...
Christoph Koch
PODS
2008
ACM
211views Database» more  PODS 2008»
14 years 11 months ago
The power of two min-hashes for similarity search among hierarchical data objects
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...
Sreenivas Gollapudi, Rina Panigrahy
PODS
2008
ACM
170views Database» more  PODS 2008»
14 years 11 months ago
Answering aggregate queries in data exchange
Data exchange, also known as data translation, has been extensively investigated in recent years. One main direction of research has focused on the semantics and the complexity of...
Foto N. Afrati, Phokion G. Kolaitis
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 11 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
PODS
2008
ACM
165views Database» more  PODS 2008»
14 years 11 months ago
Data exchange and schema mappings in open and closed worlds
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
Leonid Libkin, Cristina Sirangelo
PODS
2008
ACM
221views Database» more  PODS 2008»
14 years 11 months ago
A generic flow algorithm for shared filter ordering problems
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...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
PODS
2007
ACM
151views Database» more  PODS 2007»
14 years 11 months ago
Optimization of continuous queries with shared expensive filters
We consider the problem of optimizing and executing multiple continuous queries, where each query is a conjunction of filters and each filter may occur in multiple queries. When f...
Kamesh Munagala, Utkarsh Srivastava, Jennifer Wido...
PODS
2007
ACM
113views Database» more  PODS 2007»
14 years 11 months ago
Maximally joining probabilistic data
Benny Kimelfeld, Yehoshua Sagiv