PODS
2007
ACM
14 years 5 months ago
2007
ACM
PODS
2006
ACM
14 years 5 months ago
2006
ACM
This is a survey of algorithms, complexity results, and general solution techniques for efficiently processing queries on tree-structured data. I focus on query languages that com...
PODS
2006
ACM
14 years 5 months ago
2006
ACM
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
PODS
2004
ACM
14 years 5 months ago
2004
ACM
PODS
2003
ACM
14 years 5 months ago
2003
ACM
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
PODS
2002
ACM
14 years 5 months ago
2002
ACM
PODS
2002
ACM
14 years 5 months ago
2002
ACM
We consider conjunctive queries with arithmetic comparisons over multiple continuous data streams. We specify an algorithm for determining whether or not a query can be evaluated ...
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
VLDB
2006
ACM
14 years 5 months ago
2006
ACM
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
VLDB
2003
ACM
14 years 5 months ago
2003
ACM
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...