342 search results - page 17 / 69 » Conjunctive Queries over Trees |
73
Voted
EDBT
2008
ACM
15 years 9 months ago
2008
ACM
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...
TKDE
2010
14 years 4 months ago
2010
DHT is a widely used building block for scalable P2P systems. However, as uniform hashing employed in DHTs destroys data locality, it is not a trivial task to support complex queri...
157
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
We study the problem of auditing a batch of SQL queries: Given a forbidden view of a database that should have been kept confidential, a batch of queries that were posed over this ...
DLOG
2008
14 years 12 months ago
2008
The paper addresses the problem of explaining some reasoning tasks associated with the DL-Lite Description Logic. Because of the simplicity of the language, standard concept level ...
100
click to vote
ECSQARU
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We consider a realization of Reiter-style default logic on top of description logic knowledge bases (DL-KBs). To this end, we present elegant transformations from default...