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 11 of 11 for “"query decomposition"”.

  1. Query processing in heterogeneous distributed database management systems

    The goal of this work is to present an advanced query processing algorithm formulated and developed in support of heterogeneous distributed database management systems. Heterogeneous distributed database management systems view the integrated data through an uniform global schema. The query …

    vt Repository record for Query processing in heterogeneous distributed database management systems (opens in a new tab)

  2. DESIGN AND IMPLEMENTATION OF A MARINE CORPS RECRUITING COMMAND (MCRC) ARTIFICIAL INTELLIGENCE (AI) GUIDANCE ENGINE (MCRAGE)

    … vector index, orchestrated by a multi-agent query decomposition, retrieval and synthesis pipeline. Evaluation demonstrated 96.1% retrieval accuracy across a 1,000 question structured test battery, 5.51-second median latency, and a 14.4% self-correction rate. The Trust Framework was further …

    nps Repository record for DESIGN AND IMPLEMENTATION OF A MARINE CORPS RECRUITING COMMAND (MCRC) ARTIFICIAL INTELLIGENCE (AI) GUIDANCE ENGINE (MCRAGE) (opens in a new tab)

  3. Novel techniques for location-cloaked applications

    … client. While the server needs to retrieve more query results and transmit them to the client, the client downloading these results wastes its battery power because most of them are useless. To address these problems, we propose a suite of novel techniques including query decomposition, …

    iastate Repository record for Novel techniques for location-cloaked applications (opens in a new tab)

  4. Efficient algorithms for graph all-matching and containment search

    … and analyzing graph data by proposing efficient query processing algorithms. These problems include (1) similarity all-matching (2) supergraph containment search and (3) subgraph containment search. We first study the problem of similarity all-matching to retrieve all similarity matches of a …

    unsw Repository record for Efficient algorithms for graph all-matching and containment search (opens in a new tab)

  5. Replication Techniques for Peer-to-Peer Networks

    … complex search queries through hierarchical query decomposition and result recomposition. The method allows the initiator to ascertain query completion, and offers a broad range of trade-offs between network bandwidth consumption and the number of connections required to complete the search. …

    maryland Repository record for Replication Techniques for Peer-to-Peer Networks (opens in a new tab)

  6. Data and knowledge management in cloud computing environment

    … partitioned into graph segments and the initial query Q is decomposed into a set of BGP subqueries. In the first three approaches, the widely used MapReduce framework is used for querying a large amount of linked data. In the first approach, a generic two-phase, MapReduce algorithm is presented. …

    greece Repository record for Data and knowledge management in cloud computing environment (opens in a new tab)

  7. Multidimensional Index Structure based on Learned Space Filling Curve

    … A well-designed index can effectively reduce query execution time. However, traditional index models struggle to maintain high performance when dealing with large-scale datasets. This is because traditional index models cannot adapt past knowledge and experience, and they cannot easily …

    unsw Repository record for Multidimensional Index Structure based on Learned Space Filling Curve (opens in a new tab)

  8. Fragmentação e decomposição de consultas em XML

    … conceitual seja decomposta em uma consulta XQuery especificada no nível XML. Como linguagem de consulta para o nível conceitual, é adotado o CXPath (Conceptual XPath), uma linguagem de consulta proposta em um trabalho anterior.

    brazil-ufrgs Repository record for Fragmentação e decomposição de consultas em XML (opens in a new tab)

  9. Democratizing and Modernizing Information Access: From Open Rerankers to Scalable RAG Evaluation

    … needs that demand multi-hop reasoning and query decomposition. On the evaluation front, we hope to extend the AutoNuggetizer methodology to several tasks that go beyond web retrieval, into other domains like biomedical texts and conversational question answering.

    waterloo Repository record for Democratizing and Modernizing Information Access: From Open Rerankers to Scalable RAG Evaluation (opens in a new tab)

  10. Techniques For Boosting The Performance In Content-based Image Retrieval Systems

    … In a CBIR system, one or more images are used as query to search for similar images. The similarity is measured on the low level features, such as color, shape, edge, texture. First, each image is processed and visual features are extract. Therefore each image becomes a point in the feature space. …

    ucf Repository record for Techniques For Boosting The Performance In Content-based Image Retrieval Systems (opens in a new tab)

  11. Mediation on XQuery Views

    … heterogeneous data sources with a single query. At the same time, one of the current trends is to use standard technologies for implementing solutions to complex software problems. In this dissertation, I used XML and XQuery as the standard technologies and have developed an extended …

    unt Repository record for Mediation on XQuery Views (opens in a new tab)