Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 22 for “"Conjunctive query"”.
-
Conjunctive query answering over unrestricted OWL 2 ontologies
Conjunctive query (CQ) answering is one of the primary reasoning tasks over knowledge bases (KBs). However, when considering expressive description logics (DLs), query answering can be computationally very expensive; reasoners for CQ answering, although heavily optimized, often sacrifice expressive …
-
CGU: A common graph utility for DL Reasoning and Conjunctive Query Optimization
… the overlap between reasoning involved in <em>conjunctive query optimization</em> (CQO) and in tableaux-based approaches to reasoning about subsumption in <em>description logics</em> (DLs). In both cases, an underlying graph is created, searched and modified. This process is determined by a …
-
Tractable query answering for description logics via query rewriting
We consider the problem of answering conjunctive queries over description logic knowledge bases via query rewriting. Given a conjunctive query Q and a TBox T, we compute a new query Q′ that incorporates the semantic consequences of T such that, for any ABox A, evaluating Q over T and A can be done …
-
Επαναγραφή και συνεπής απάντηση συζευκτικών ερωτημάτων σε εξελισσόμενες βάσεις γνώσης
The last years conjunctive query answering constitutes a key reasoning service for many applications which involve managing very large datasets. One of the most important reasoning techniques for query answering is query rewriting. Given a conjunctive query (CQ), a process of query rewriting …
-
Efficient and scalable techniques for minimization and rewriting of conjunctive queries
Query rewriting as an approach to query answering has been a challenging issue in database and information integration systems. In general, rewriting of a conjunctive query Q using a set of views in conjunctive form consists of two phases: (1) generating proper building blocks using the views, and …
-
Real-time Business Intelligence through Compact and Efficient Query Processing Under Updates
… analytical results or their basic elements in a query language, where the main task then is to maintain these results under frequent updates efficiently. The task of reacting to updates and analyzing changing data has been addressed in two ways in the literature: traditional business intelligence …
-
Automated Reasoning via a Multi-sorted Fragment of Computable Set Theory with Applications to Semantic Web
… data enables software agents to manipulate and query information on behalf of human agents. To achieve such goal, machines are provided with appropriate languages and tools. Investigating new technologies which can extend the power of knowledge representation and reasoning systems is the main …
-
On the termination of the chase algorithm
… such as the constraint implication problem, conjunctive query optimization, rewriting queries using views, data exchange, and data integration. The basic idea of the chase is, given a database instance and a set of constraints as input, to fix constraint violations in the database instance. …
-
PAGOdA: Pay-as-you-go ontology query answering using a datalog reasoner
Answering conjunctive queries over ontology-enriched datasets is a core reasoning task for many applications of semantic technologies. Conjunctive query answering is, however, computationally very expensive, which has led to the development of query answering procedures that sacrifice either the …
-
Factorisation in relational databases
… are especially applicable to results of conjunctive queries.</p> <p>In the first part of the dissertation we derive tight asymptotic size bounds for two flavours of factorised representations of results of conjunctive queries. Any conjunctive query is characterised by rational parameters …
-
An Ordered Bag Semantics for SQL
Semantic query optimization is an important issue in many contexts of databases including information integration, view maintenance and data warehousing and can substantially improve performance, especially in today's database systems which contain gigabytes of data. A crucial issue in semantic …
-
Evaluating conjunctive and graph queries over the EL profile of OWL 2
… </p> <p>We first focus on the complexity of conjunctive query (CQ) answering in OWL 2 EL and show that the problem is PSpace-complete in combined complexity, the complexity measured in the total size of the input. All the previously known approaches encode the regular role inclusions using …
-
Combining Description Logic Reasoning with AI Planning for Composition of Web Services
… and realization tasks. * Optimizations for conjunctive query answering w.r.t. DL knowledge bases. Inspired by some query optimization techniques used in relational databases, a cost-based model is presented to estimate the evaluation time of DL queries. * An implementation of the HTN-DL …
-
Αλγόριθμοι επανεγγραφής τροποποιημένων ερωτημάτων για βατές περιγραφικές λογικές
The reasoning problem of answering conjunctive queries over Description Logic knowledge bases via query rewriting has gained a lot of attention in the last few years. Given a conjunctive query and a knowledge base (TBox and ABox) a query rewriting procedure computes a new query that incorporates …
-
The impact of disjunction on reasoning under existential rules
… can be derived from the extensional data. Conjunctive queries are therefore answered against this combined <em>knowledge base</em> of extensional and intensional data.</p> <p>Many languages that represent ontologies have been introduced in the literature. In this thesis we will focus on …
-
Secure and efficient searchable encryption
… Furthermore, we investigate the area of Conjunctive Queries SSE. We present a SSE scheme that supports conjunctive queries, called ConQSSE. We store popular combinations of keywords consecutive on an inverted index. If the conjunctive query consists of popular combination of keywords then …
-
Practical Rewriting Techniques for Warded Ontology-Mediated Queries
… main tasks in this context is Ontology-Mediated Query (OMQ) Answering. That is, given an Ontology-Mediated Query O = (q, Σ), comprising a TGD-based ontology Σ and a query q (usually a conjunctive query), find all the answers to q that can be entailed from the logical theory D ∧ Σ, where D is …
Page 1 of 2