Sciweavers

342 search results - page 17 / 69
» Conjunctive Queries over Trees
Sort
View
EDBT
2008
ACM
122views Database» more  EDBT 2008»
14 years 7 months ago
Mining all frequent projection-selection queries from a relational table
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...
Tao-Yuan Jen, Dominique Laurent, Nicolas Spyratos
TKDE
2010
218views more  TKDE 2010»
13 years 2 months ago
LIGHT: A Query-Efficient Yet Low-Maintenance Indexing Scheme over DHTs
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...
Yuzhe Tang, Shuigeng Zhou, Jianliang Xu
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
14 years 9 months ago
Auditing SQL Queries
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 ...
Rajeev Motwani, Shubha U. Nabar, Dilys Thomas
DLOG
2008
13 years 10 months ago
Explanation in DL-Lite
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 ...
Alexander Borgida, Diego Calvanese, Mariano Rodrig...
ECSQARU
2009
Springer
14 years 2 months ago
Realizing Default Logic over Description Logic Knowledge Bases
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...
Minh Dao-Tran, Thomas Eiter, Thomas Krennwallner