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 105 for “"Query Performance"”.

  1. Data transformation for improved query performance

    … queries and box queries. Implementation of a box query typically involves simple comparison of values in each dimension of the query feature vector with the corresponding dimension of an object in the database. Implementing range queries and k-NN queries, however, may be more involveddue to …

    msu Repository record for Data transformation for improved query performance (opens in a new tab)

  2. Optimizing graph query performance by indexing and caching

    … of subgraph isomorphism. To expedite graph query processing, the community has contributed a wealth of approaches that gradually form two categories, i.e., heuristic subgraph isomorphism (SI) methods and algorithms following “filter-then-verify” paradigm (FTV). However, they both bear …

    glasgow Repository record for Optimizing graph query performance by indexing and caching (opens in a new tab) Download PDF for Optimizing graph query performance by indexing and caching (opens in a new tab)

  3. Enhance Database Query Performance through Software Optimization and Hardware Adaptation

    … of GPUs has become essential to ensure good query performance. However, without careful query planning and hardware-aware execution, database queries can underutilize GPU resources. To fully unlock GPU potential, my thesis focuses on improving query performance through a combination of …

    gatech Repository record for Enhance Database Query Performance through Software Optimization and Hardware Adaptation (opens in a new tab)

  4. Optimizing Log Data Storage and Query Performance: A Study on Industrial Applications

    … analysis of storage efficiency optimization and query performance improvement in highly scalable log management systems. As log volumes are experiencing exponential growth, optimization of storage as well as retrieval mechanisms has become more and more important to ensure scalability of the …

    chalmers Repository record for Optimizing Log Data Storage and Query Performance: A Study on Industrial Applications (opens in a new tab)

  5. An empirical study of the effects of data model and query language on novice user query performance

    … database systems more effectively to enhance performance. A major research interest is to evaluate and compare user performance across different data models and query languages. So far, experiments have tested combinations of model plus language. An interesting theoretical and practical …

    nus Repository record for An empirical study of the effects of data model and query language on novice user query performance (opens in a new tab) Download file for An empirical study of the effects of data model and query language on novice user query performance (opens in a new tab)

  6. Integrating Column-Oriented Storage and Query Processing Techniques into Graph Database Management Systems

    … workloads, employ a specific set of storage and query processing techniques for scalability and performance, such as positional tuple IDs, column-specific compression, and block-oriented processing. We revisit these techniques in the context of contemporary graph database management systems …

    waterloo Repository record for Integrating Column-Oriented Storage and Query Processing Techniques into Graph Database Management Systems (opens in a new tab)

  7. Galo: guided automated learning for query workload re-optimization

    Traditional query optimization techniques often fail when logical subtleties in business queries and schemas circumvent them. Query performance problem determination is typically performed manually in consultation with experts through the analysis of query execution plans (QEPs). Galo, a novel …

    uoit Repository record for Galo: guided automated learning for query workload re-optimization (opens in a new tab)

  8. Dynamic Behavior of Balanced NV-trees

    … by trading off quality guarantees for improved query performance. While the query performance and quality of these methods has been well studied, however, the performance of index maintenance has not yet been reported in any detail. In this thesis we focus on the dynamic behavior of the NV-tree, …

    reykjavik Repository record for Dynamic Behavior of Balanced NV-trees (opens in a new tab)

  9. Efficient Reverse kNN search in Spatial Database

    … in Euclidean Space. Given a set of objects and a query Q, an object p is Q’s Reverse k Nearest Neighbour if Q is one of p’s k-closest objects. With location-based services become popular in past few years, more applications have been developed to answer users queries by using users locations to …

    unsw Repository record for Efficient Reverse kNN search in Spatial Database (opens in a new tab)

  10. Bisimulation-based Structural Summaries of Large Graphs

    … it is a challenge to understand, explore, and query these large graphs. Bisimulation-based structural summaries have often been used as a compact representation of the dataset that can improve query performance. However, current bisimulation summary construction techniques for large graphs do …

    toronto-retro Repository record for Bisimulation-based Structural Summaries of Large Graphs (opens in a new tab)

  11. Hybrid approach for XML access control (HyXAC)

    … For instance, view based approach provides high performance in query evaluation, but suffers from the view maintenance issues. To remedy the problems, we propose a hybrid approach, namely HyXAC: Hybrid XML Access Control. HyXAC provides efficient access control and query processing by maximizing …

    ku Repository record for Hybrid approach for XML access control (HyXAC) (opens in a new tab)

  12. Data Layout Recommendation for Big Data Systems via Large Language Models

    The physical layout of data is critical to the performance of analytical queries, especially in column-store systems like IBM Db2. Among layout strategies, Z-ordering is a popular technique that maps multi-dimensional data to a one-dimensional space while preserving locality. However, tuning …

    york Repository record for Data Layout Recommendation for Big Data Systems via Large Language Models (opens in a new tab)

  13. Predictive In-memory Multi-Level Indexing Algorithm for Spatiotemporal Trajectory Streams in Distributed Environments

    … of search queries on spatial data, such as range query and join query. Despite the importance of these types of queries on streaming data, many systems do not support them. Many also fail to handle the scalability and efficiency problems when the input data is too large. This thesis proposes the …

    umn Repository record for Predictive In-memory Multi-Level Indexing Algorithm for Spatiotemporal Trajectory Streams in Distributed Environments (opens in a new tab)

  14. A comparison of the impact of data vault and dimensional modelling on data warehouse performance and maintenance

    … modelling and data vault modelling on the performance and maintenance effort of data warehouses. Dimensional modelling is a data warehouse modelling technique pioneered by Ralph Kimball in the 1980s that is much more effective at querying large volumes of data in relational databases than …

    nwu-za Repository record for A comparison of the impact of data vault and dimensional modelling on data warehouse performance and maintenance (opens in a new tab)

  15. Beyond Binary Search: Parallel In-Place Construction of Implicit Search Tree Layouts

    … of our algorithms and empirically measure their performance. Given N elements and P processors, our fastest algorithms have a parallel runtime of O(N/P) for the BST layout, O((N/P + logB N) logB N) for the B-tree layout,and O(N/P log log N) for the vEB layout using the CREW Parallel Random Access …

    hawaii Repository record for Beyond Binary Search: Parallel In-Place Construction of Implicit Search Tree Layouts (opens in a new tab)

  16. A node partitioning strategy for optimising the performance of XML queries

    … adopted as a data storage format. However, XML query processing presents issues both in terms of query performance and updatability. Thus, many are choosing to shred XML data into relational databases in order to benet from its mature technology. The problem with this approach is that (often …

    dcu Download PDF for A node partitioning strategy for optimising the performance of XML queries (opens in a new tab)

  17. Labelling Dynamic XML Documents: A GroupBased Approach

    … XML data, which requires accurate and efficient query-able XML database systems. XML querying depends on XML labelling in much the same way as relational databases rely on indexes. Document order and structural information are encoded by labelling schemes, thus facilitating their use by queries …

    whiterose Download PDF for Labelling Dynamic XML Documents: A GroupBased Approach (opens in a new tab)

  18. Spatial Indexing for Moving Geometry in Main Memory

    … such a way that subsets can be queried with high performance. However, good query performance is no guarantee for a corresponding update performance. There is currently little research of spatial indexing for non-point geometry which receive frequent updates. This thesis studies and compares …

    chalmers Repository record for Spatial Indexing for Moving Geometry in Main Memory (opens in a new tab)

  19. Bitemporal Sliding Windows

    … of space footprint, maintenance overhead and query performance.

    waterloo Repository record for Bitemporal Sliding Windows (opens in a new tab)

Page 1 of 6