<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-21T01:45:52Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/30264" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/30264</identifier><datestamp>2025-11-20T16:40:49Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Chiang, Fei</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Wang, Yaoxu</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Computer Science</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2024-09-30T18:54:19Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2024-09-30T18:54:19Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2024</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/30264</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Temporal graphs play a crucial role in modelling dynamic applications where (node) attribute values change over time.  However, in some domains, specific attribute value relationships are expected to remain consistent over a time-interval.   For example, in therapeutic drug monitoring, the measurement of specific drug levels is expected to remain constant at defined time intervals.  A patient must be given a drug dose within a time interval to ensure effective and therapeutic drug concentrations remain in the body.  Existing work has largely focused on static graphs, and are unable to capture attribute value relationships over a time interval.   Recent work has proposed a new class of dependencies, Temporal Graph Functional Dependencies (TGFDs) that model such semantics [Alipour et. al].  However, declarative specification of these constraints is challenging given the large-scale of real-life graphs. &#xd;
&#xd;
In this thesis, we propose, ParaTGFDMiner, a parallel discovery algorithm to identify TGFDs from large-scale graphs.  Given an input graph G, ParaTGFDMiner discovers TGFDs by first generating candidate constraints locally at each worker node from a subset of G.  A coordinator then validates and merges these candidate constraints, across all workers, to compute high-frequency TGFDs that are satisfied in G.   We propose two optimizations that implement asynchronous processing to minimize idle time, and fast graph pattern matching to identify high-likelihood candidates.  Our evaluation on two real large-scale graphs demonstrate that ParaTGFDMiner is up to 60% faster than baseline approaches.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Master of Science (MSc)</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Discovery of Temporal Graph Functional Dependencies</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>