Please note: This master’s thesis presentation will be given online.
MohammadReza Karegar, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Lukasz Golab
Most real-world data come with explicitly defined domain orders; e.g., lexicographic order for strings, numeric for integers, and chronological for time. Our goal is to discover implicit domain orders that we do not already know; for instance, that the order of months in the Chinese Lunar calendar is Corner < Apricot < Peach. To do so, we enhance data profiling methods by discovering implicit domain orders in data through order dependencies. We enumerate tractable special cases and proceed towards the most general case, which we prove is NP-complete. We then consider discovering approximate implicit orders; i.e., those that exist with some exceptions. We propose definitions of approximate implicit orders and prove that all non-trivial cases are NP-complete. We show that the NP-complete cases nevertheless can be effectively handled by a SAT solver. We also devise an interestingness measure to rank the discovered implicit domain orders.
Based on an extensive suite of experiments with real-world data, we establish the efficacy of our algorithms, and the utility of the domain orders discovered by demonstrating significant added value in two applications (data profiling and data mining).
To join this master’s thesis presentation on Zoom, please go to https://zoom.us/j/97621624694?pwd=a2MvZnlsLzFxVDFrMXJ1U2kza0pEQT09.
200 University Avenue West
Waterloo, ON N2L 3G1