5 search results - page 1 / 1 » The complexity of acyclic conjunctive queries revisited |
CORR
2006
Springer
13 years 9 months ago
2006
Springer
FOCS
1998
IEEE
14 years 2 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
WEBDB
2005
Springer
14 years 3 months ago
2005
Springer
In recent years it has been argued that when XML encodings become complex, DOM trees are no longer adequate for query processing. Alternative representations of XML documents, suc...
ICDT
2001
ACM
14 years 2 months ago
2001
ACM
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
PODS
2007
ACM
14 years 10 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...