Please note: This PhD seminar will be given online.
Mina
Farid, PhD
candidate
David
R.
Cheriton
School
of
Computer
Science
Denial constraints are expressive forms of defining integrity constraints on data. While discovering constraints from relational data is well studied in the literature, there are multiple technical challenges that face discovering constraints from RDF data. First, the absence of structure in the RDF data model complicates the definition of constraints and requires a preprocessing step in the constraint discovery process. Second, the large scale of RDF data requires implementing optimized and scalable constraints mining algorithms.
In this talk, we introduce our algorithm to discover denial constraints from RDF data. First, we describe how we mine structured views over the RDF data to discover constraints from. Then, we run a constraint discovery algorithm on the discovered views to generate a set of denial constraints, reusing expensive operations as much as possible. We show the results of the discovery algorithm on multiple datasets.
To join this PhD seminar on Zoom, please go to https://us02web.zoom.us/j/83067823461?pwd=b0M3RGdIZDd5TmIzVnRla2t6T2M1dz09.
Meeting
ID:
830
6782
3461
Password:
808572