357 search results - page 8 / 72 » An Algebraic Approach to the Complexity of Generalized Conju... |
DMDW
2000
13 years 9 months ago
2000
View materialization is a central issue in logical design of data warehouses since it is one of the most powerful techniques to improve the response to the workload. Most approach...
ALGORITHMICA
2002
13 years 7 months ago
2002
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
The XPath language incorporates powerful primitives for formulating queries containing nested subexpressions which are existentially or universally quantified. However, even the b...
PODS
2007
ACM
14 years 8 months ago
2007
ACM
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
LICS
2002
IEEE
14 years 25 days ago
2002
IEEE
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...