Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/27885
Title: | Discovery of Temporal Graph Functional Dependencies |
Authors: | Noronha, Levin |
Advisor: | Chiang, Fei |
Department: | Computing and Software |
Publication Date: | 2022 |
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. |
URI: | http://hdl.handle.net/11375/27885 |
Appears in Collections: | Open Access Dissertations and Theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Levin_Noronha_Thesis.pdf | 1.92 MB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.