Now showing items 1-7 of 7

    • Answering Object Queries over Knowledge Bases with Expressive Underlying Description Logics 

      Wu, Jiewen (University of Waterloo, 2013-10-25)
      Many information sources can be viewed as collections of objects and descriptions about objects. The relationship between objects is often characterized by a set of constraints that semantically encode background knowledge ...
    • Cardinality Estimation in Streaming Graph Data Management Systems 

      Akillioglu, Kerem (University of Waterloo, 2024-02-23)
      Graph processing has become an increasingly popular paradigm for data management systems. Concurrently, there is a pronounced demand for specialized systems dedicated to streaming processing that are essential to address ...
    • Effective Use of SSDs in Database Systems 

      Ghodsnia, Pedram (University of Waterloo, 2018-05-07)
      With the advent of solid state drives (SSDs), the storage industry has experienced a revolutionary improvement in I/O performance. Compared to traditional hard disk drives (HDDs), SSDs benefit from shorter I/O latency, ...
    • Enumerating Query Plans via Conditional Tableau Interpolation 

      Feng, Eva Hu (University of Waterloo, 2023-04-21)
      Database query optimization studies the problem of finding equivalent and efficient query execution plans for user queries under schema constraints. Logic-based approaches to query optimization leverage automated theorem ...
    • Join Cardinality Estimation Graphs: Analyzing Pessimistic and Optimistic Estimators Through a Common Lens 

      Chen, Jeremy Yujui (University of Waterloo, 2020-08-07)
      Join cardinality estimation is a fundamental problem that is solved in the query optimizers of database management systems when generating efficient query plans. This problem arises both in systems that manage relational ...
    • Multiple Continuous Subgraph Query Optimization Using Delta Subgraph Queries 

      Kankanamge, Chathura (University of Waterloo, 2018-10-23)
      This thesis studies the problem of optimizing and evaluating multiple directed structural subgraph queries, i.e., those without highly selective predicates on the edges or vertices, continuously in a changing graph. Existing ...
    • Query Optimization in Dynamic Environments 

      El-Helw, Amr (University of Waterloo, 2012-05-08)
      Most modern applications deal with very large amounts of data. Having to deal with such huge amounts of data is in itself a challenge. This challenge is complicated even more by the fact that, in many cases, this data is ...

      UWSpace

      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages