Now showing items 1-7 of 7

    • A+ Indexes: Highly Flexible Adjacency Lists in Graph Database Management Systems 

      Khaliq, Shahid (University of Waterloo, 2019-09-17)
      Adjacency lists are the most fundamental storage structure in existing graph database management systems (GDBMSs) to index input graphs. Adjacency lists are universally linked-list like per-vertex structures that allow ...
    • Domain Ordering and Box Cover Problems for Beyond Worst-Case Join Processing 

      Alway, Kaleb (University of Waterloo, 2019-09-17)
      Join queries are a fundamental computational task in relational database management systems. For decades, complex joins were most often computed by decomposing the query into a query plan made of a sequence of binary joins. ...
    • 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 ...
    • Majority in the Three-Way Comparison Model 

      Nazari, Azin (University of Waterloo, 2019-08-28)
      In this thesis, we study comparison based problems in a new comparison model called three-way, where a comparison can result in { >, =, < }. We consider a set of n balls with fixed ordered coloring. Particularly, we are ...
    • 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 ...
    • Parallel Paths Analysis Using Function Call Graphs 

      Naeimian, Arman (University of Waterloo, 2019-09-23)
      Call graphs have been used widely in different software engineering areas. Since call graphs provide us with detailed information about the structure of software elements and components and how they are connected with each ...
    • Systems for Graph Extraction from Tabular Data 

      Anzum, Nafisa (University of Waterloo, 2020-09-28)
      Connections amongst real-world entities provide significant insights for numerous real-life applications in social networks, semantic web, road maps, finance, among others. Graphs are perhaps the most natural way to model ...

      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