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 35 for “"Query rewriting;"”.

  1. Global schema generation and query rewriting XML integration

    … semantics in an XML schema. The second issue is query rewriting. Queries on an integrated schema need to be rewritten to query the underlying source repositories. We develop an algorithm for rewriting queries that take the semantic relationship between the source schemas and the integrated schema …

    nus Repository record for Global schema generation and query rewriting XML integration (opens in a new tab) Download file for Global schema generation and query rewriting XML integration (opens in a new tab)

  2. Query Rewriting for Extracting Data behind HTML Forms

    … forms automatically according to a given user query against a global schema for an application domain and, to the extent possible, extract just the relevant data behind these Web forms. Experimental results on two application domains show that the approach is reasonable for HTML forms.

    byu Repository record for Query Rewriting for Extracting Data behind HTML Forms (opens in a new tab) Download PDF for Query Rewriting for Extracting Data behind HTML Forms (opens in a new tab)

  3. Tractable query answering for description logics via query rewriting

    … 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 by evaluating the new query Q′ over A alone. We …

    oxford Repository record for Tractable query answering for description logics via query rewriting (opens in a new tab)

  4. DQN-Guided Rule-Class Selection for Search-Based Query Rewriting

    Query rewrite transforms a SQL query into a semantically equivalent form expected to execute more efficiently. Search-based rewriters such as LearnedRewrite organize alternative rewrite orders as a policy tree and explore it with Monte Carlo Tree Search. In the publicly released LearnedRewrite …

    ottawa-retro Repository record for DQN-Guided Rule-Class Selection for Search-Based Query Rewriting (opens in a new tab)

  5. 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 …

    concordia Download PDF for Efficient and scalable techniques for minimization and rewriting of conjunctive queries (opens in a new tab)

  6. Ontology evolution in data integration

    … dissertation, we provide a solution that allows query answering under evolving ontologies without mapping redefinition. This is achieved by exploiting query rewriting. We elegantly separate the semantics of query rewriting for different ontology versions and for the sources and we present a …

    greece Repository record for Ontology evolution in data integration (opens in a new tab)

  7. Αλγόριθμοι επανεγγραφής τροποποιημένων ερωτημάτων για βατές περιγραφικές λογικές

    … 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 constraints of the knowledge base that are …

    greece Repository record for Αλγόριθμοι επανεγγραφής τροποποιημένων ερωτημάτων για βατές περιγραφικές λογικές (opens in a new tab)

  8. UCQ-rewritings for disjunctive knowledge and queries with negated atoms

    In this thesis, the problem of query rewriting for conjunctive queries with negation with respect to disjunctive existential rules is studied. Query rewriting is a well-known approach for query answering on knowledge bases with incomplete data. Three rewriting techniques are proposed that find …

    greece Repository record for UCQ-rewritings for disjunctive knowledge and queries with negated atoms (opens in a new tab)

  9. Answering Object Queries over Knowledge Bases with Expressive Underlying Description Logics

    … of qualifying objects are given. The proposed query paradigm, called assertion retrieval, is favoured over instance retrieval since it provides more informative answers to users. A more compelling reason is related to performance: assertion retrieval enables a transfer of basic relational …

    waterloo Repository record for Answering Object Queries over Knowledge Bases with Expressive Underlying Description Logics (opens in a new tab)

  10. Higher-order queries and applications

    … queries appear in numerous aspects including query rewriting and query specification. In XML databases, higher-order functions are natural due to the close connection of XML query languages with functional programming.</p><p>The thesis investigates higher-order query languages that combine …

    oxford Repository record for Higher-order queries and applications (opens in a new tab)

  11. Partial answers in information integration systems : their meaning and computation

    … information sources. Our work focuses on query answering in such system. The current generation of query answering algorithms in local-as-view (source-centric) information integration systems all produce what has been thought of as "the best obtainable" answer, given the circumstances that …

    concordia Download PDF for Partial answers in information integration systems : their meaning and computation (opens in a new tab)

  12. The Conceptual Integration Modelling Framework: Semantics and Query Answering

    … able to pose queries expressed in a conceptual query language (CQL). The CIM is comprised of three facets: an Extended Entity Relationship (EER) model (a high level conceptual model that is used to design databases), a conceptual schema against which users pose their queries, a relational …

    ottawa-retro Repository record for The Conceptual Integration Modelling Framework: Semantics and Query Answering (opens in a new tab)

  13. XML Query optimization

    … focuses on two important optimization aspects: query minimization and query answering using views. For query minimization, prior work has focused on minimizing TPQs corresponding to the XPath semantics, with or without constraints. We present a study on the minimization of TPQs with a richer …

    nus Repository record for XML Query optimization (opens in a new tab) Download file for XML Query optimization (opens in a new tab)

  14. Human-Centered Interactive Information Seeking

    … queries specifically, we develop a query rewriting model CONQRR that rewrites a question that depends on dialogue context in the context into a standalone question. It is trained with a novel reward function to directly optimize towards retrieval using reinforcement learning and can …

    washington Repository record for Human-Centered Interactive Information Seeking (opens in a new tab)

  15. XQuery Query Processing in Relational Systems

    … relational database techniques to store and/or query XML data. Since XQuery is becoming a standard XML query language, significant effort has been made in developing an efficient and comprehensive XQuery-to-SQL query processor. In this thesis, we design and implement an <em>XQuery-to-SQL Query …

    waterloo Repository record for XQuery Query Processing in Relational Systems (opens in a new tab)

  16. An integrated framework for comparing forward- and backward-chaining algorithms

    … schema/ontology/knowledge-graph, answer a query posed on the latter. In DE, forward-chaining algorithms known as ontology materialization or the chase, are used to transform source data to a new materialized instance that satisfies the ontology and can be directly used for query-answering. …

    soton Download PDF for An integrated framework for comparing forward- and backward-chaining algorithms (opens in a new tab)

  17. Using dynamic schemas for query optimization over JSON data.

    Query optimization in document stores has traditionally relied on rule-based approaches, but recent research advocates for a shift towards cost-based optimization. However, this transition is hindered by the fragmented nature of existing approaches, stemming from the early development stage of …

    louisville Repository record for Using dynamic schemas for query optimization over JSON data. (opens in a new tab)

  18. Multilevel secure data stream management system

    … queries, and designing authentication models, query rewriting and optimization mechanisms, and scheduling strategies to ensure that queries are processed in a secure and timelymanner, (3) developing sharing approaches between queries to improve quality of service. Besides we've implemented …

    colostate Repository record for Multilevel secure data stream management system (opens in a new tab)

  19. Επαναγραφή και συνεπής απάντηση συζευκτικών ερωτημάτων σε εξελισσόμενες βάσεις γνώσης

    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 …

    greece Repository record for Επαναγραφή και συνεπής απάντηση συζευκτικών ερωτημάτων σε εξελισσόμενες βάσεις γνώσης (opens in a new tab)

Page 1 of 2