3 search results - page 1 / 1 » On the Hardness of Learning Acyclic Conjunctive Queries |
137
Voted
ALT
2000
Springer
15 years 9 months ago
2000
Springer
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
142
Voted
ACNS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We study the setting in which a user stores encrypted documents (e.g. e-mails) on an untrusted server. In order to retrieve documents satisfying a certain search criterio...
165
click to vote
PODS
2007
ACM
16 years 5 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...