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 42 for “"Efficient query processing"”.

  1. Managing cache for efficient query processing

    … the opportunities and mechanisms to leverage query processing performance using caches. Our first set of techniques is realized in a centralized multi-user environment where we propose a non-speculative demand-driven caching: Conform-CoD, Scramble-CoD and Integrated-CoD, where the exact cost …

    nus Repository record for Managing cache for efficient query processing (opens in a new tab) Download file for Managing cache for efficient query processing (opens in a new tab)

  2. Efficient query processing in distributed database systems

    … the basis for the implementation of a series of efficient Distributed Data Management Systems in a variety of application domains, such as: Performance Measurement Simulators of Distributed Layout Algorithms (P2P Infrastructures or overlays), digital rights management on protected digital content …

    greece Repository record for Efficient query processing in distributed database systems (opens in a new tab)

  3. Efficient query processing over highly distributed data

    … this thesis is to investigate the performance of query processing over highly distributed data. Peer-to-peer (P2P) systems emerge as a powerful model for searching vast amounts of data distributed over independent sources. While different peer-to-peer architectures have been proposed in the …

    greece Repository record for Efficient query processing over highly distributed data (opens in a new tab)

  4. Efficient query processing over personal process description graphs

    … on a formal model and (ii) to investigate novel query techniques and data analytics on such descriptions. Firstly, we proposed Personal Process Description Graph (PPDG) to concretely represent the personal process descriptions as graphs. Based on the model, a template-based query approach is …

    unsw Repository record for Efficient query processing over personal process description graphs (opens in a new tab)

  5. Grouping of semistructured data for efficient query processing

    … for the optimisation of semistructured data processing based on data groupings. Such groupings are of fundamental importance for efficient querying of semistructured data.The semistructured model does not imply the natural organisation of data that characterises rigidly structured …

    strathclyde Repository record for Grouping of semistructured data for efficient query processing (opens in a new tab)

  6. Memory-Efficient Query Processing for Main-Memory Databases

    … the impact of memory consumption imposed by query processing tends to get overlooked. Common techniques, however, exist, and encompass traditional techniques like hash table and probe side partitioning when executing joins, employing data structures with minimal memory footprint during query …

    qucosa-diss

  7. Secure and efficient query processing in outsourced databases

    As organizations struggle with processing vast amounts of information, outsourcing sensitive data to third parties becomes a necessity. Various cryptographic techniques are used in outsourced database systems to ensure data privacy while allowing for efficient querying. This thesis proposes a …

    bu Repository record for Secure and efficient query processing in outsourced databases (opens in a new tab)

  8. Machine learning techniques for efficient query processing in kowledge base systems

    … this dissertation we propose a new technique for efficient query processing in knowledge base systems. Query processing in knowledge base systems poses strong computational challenges because of the presence of combinatorial explosion. This arises because at any point during query processing there …

    lsu-thes Repository record for Machine learning techniques for efficient query processing in kowledge base systems (opens in a new tab)

  9. Sequencing geographical data for efficient query processing on air in mobile computing.

    … for sequencing point data for spatial range query processing, while graph partition tree traversal ordering heuristic in conjunction with the optimization methods is suitable for sequencing graph data for network path query processing over air.

    oklahoma-thes Repository record for Sequencing geographical data for efficient query processing on air in mobile computing. (opens in a new tab)

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

    qucosa-diss

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

    … semantic webs, software engineering, etc. Efficient algorithms are strongly demanded in these applications to manage and analyze graph data. Thesis studies three fundamental problems in managing and analyzing graph data by proposing efficient query processing algorithms. These problems …

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

  12. Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs

    … shortest distance queries. We propose an efficient index structure based on 2-hop labeling approaches. Supported by a path dominance relationship incorporating both quality and length information, we demonstrate the minimal property of the new index. An efficient query processing algorithm …

    unsw Repository record for Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs (opens in a new tab)

  13. Query domains : grouping heterogeneous sensors based on proximity

    Efficient query processing in sensor networks involves identifying groups of nodes that coordinate to satisfy applications’ requests. In this thesis, we propose a query domain abstraction that allows an application to dynamically specify the nodes best suited to answering a particular query. To …

    texas Repository record for Query domains : grouping heterogeneous sensors based on proximity (opens in a new tab) Restricted access

  14. Efficient processing of XML twig pattern matching

    … and presented in XML format. The ability to efficiently query XML data sources, therefore, becomes increasingly important. This thesis studies the query processing of a core subset of XML query languages: XML twig queries. An XML twig query, represented as a small query tree, is essentially a …

    nus Repository record for Efficient processing of XML twig pattern matching (opens in a new tab) Download file for Efficient processing of XML twig pattern matching (opens in a new tab)

  15. Wireless Networks for Communication and Sensing

    … For the function computation problem, we propose efficient algorithms for computing symmetric functions over noisy channels. For the data storage problem, we develop distributed algorithms for efficient query processing.

    uiuc Repository record for Wireless Networks for Communication and Sensing (opens in a new tab)

  16. Relational database applications' optimization and performance study

    The objective of the thesis is to develop efficient query processing techniques for large relational database applications since, when such applications have to process more than a million records, performance becomes a key issue. Some techniques rely upon massive hardware architectures and new …

    ttu Repository record for Relational database applications' optimization and performance study (opens in a new tab)

  17. Semantic query optimization : a data-driven approach

    … two decades has raised serious needs for more efficient query processing schemes. One of the proposed techniques for query optimization is Semantic Query Optimization (SQO), which is the subject of this thesis. One thing that distinguishes this technique from others is that it doesn't deal with …

    ubc Repository record for Semantic query optimization : a data-driven approach (opens in a new tab) Download PDF for Semantic query optimization : a data-driven approach (opens in a new tab)

  18. Integrating OLAP and Ranking: The Ranking-Cube Methodology

    … of results, which poses challenges to both efficient query processing and effective digest of the query results. To address this problem, ranked search has been introduced to database systems. We study the problem of On-Line Analytical Processing (OLAP) of ranked queries, where ranked …

    uiuc Repository record for Integrating OLAP and Ranking: The Ranking-Cube Methodology (opens in a new tab)

Page 1 of 3