Back to search

McMaster University

Discovery of Temporal Graph Functional Dependencies

Abstract

dc:description.abstract

Real-world graphs are dynamic and evolve over time. Data quality in evolving graphs is essential to downstream decision making and fact checking. This work studies the discovery of Temporal Graph Functional Dependencies (TGFDs), a recently defined class of data quality rules for enforcing consistency over evolving graphs. TGFDs impose topological and attribute dependency constraints over a period of time. We define minimality and support for TGFDs and formalize the TGFD discovery problem. Defining TGFDs manually is a laborious task and requires domain expertise. Hence, we introduce TGFDMiner, a sequential algorithm that discovers minimal and frequent TGFDs. We define various optimizations for TGFDMiner that improve runtime.

Degree

thesis:*
Department dc:contributor.department
Computing and Software
Year dc:date.issued
2022

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Noronha, Levin
Advisor dc:contributor.advisor
  • Chiang, Fei

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/11375/27885

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
related terms
citation

Noronha, Levin. Discovery of Temporal Graph Functional Dependencies. 2022. http://hdl.handle.net/11375/27885