Sciweavers

66 search results - page 3 / 14
» Conjunctive Query Containment over Trees
Sort
View
EDBT
2004
ACM
155views Database» more  EDBT 2004»
14 years 6 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
IJCAI
2007
13 years 7 months ago
Conjunctive Query Answering for the Description Logic SHIQ
Conjunctive queries play an important role as an expressive query language for Description Logics (DLs). Although modern DLs usually provide for transitive roles, conjunctive quer...
Birte Glimm, Ian Horrocks, Carsten Lutz, Ulrike Sa...
ACNS
2004
Springer
220views Cryptology» more  ACNS 2004»
13 years 11 months ago
Secure Conjunctive Keyword Search over Encrypted Data
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...
Philippe Golle, Jessica Staddon, Brent R. Waters
DLOG
2006
13 years 7 months ago
Data Complexity of Answering Unions of Conjunctive Queries in SHIQ
The novel context of accessing and querying large data repositories through ontologies that are formalized in terms of expressive DLs requires on the one hand to consider query an...
Magdalena Ortiz, Diego Calvanese, Thomas Eiter
ALT
2000
Springer
13 years 10 months ago
On the Hardness of Learning Acyclic Conjunctive Queries
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...
Kouichi Hirata