204 search results - page 8 / 41 » Containment of Conjunctive Queries with Negation: Algorithms... |
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasets structured as graphs. We present an efficient algorithm for minin...
CADE
2000
Springer
14 years 1 days ago
2000
Springer
Abstract. While there has been a great deal of work on the development of reasoning algorithms for expressive description logics, in most cases only Tbox reasoning is considered. I...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
DLOG
2011
12 years 11 months ago
2011
We show that deciding conjunctive query inseparability for OWL 2 QL ontologies is PSpace-hard and in ExpTime. We give polynomial-time (incomplete) algorithms and demonstrate by exp...