210 search results - page 15 / 42 » On the Structure of Bounded Queries to Arbitrary NP Sets |
ECIR
2003
Springer
13 years 10 months ago
2003
Springer
As more and more structured documents, such as SGML or XML documents become available on the Web, there is a growing demand to develop effective structured document retrieval which...
LPNMR
2007
Springer
14 years 2 months ago
2007
Springer
Logic programming under the answer-set semantics nowadays deals with numerous different notions of equivalence between programs. This is due to the fact that equivalence for substi...
PODS
1997
ACM
14 years 24 days ago
1997
ACM
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
Gowers [Gow98, Gow01] introduced, for d 1, the notion of dimension-d uniformity Ud (f) of a function f : G C, where G is a finite abelian group. Roughly speaking, if a function ...
PODS
2008
ACM
14 years 8 months ago
2008
ACM
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...