4 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.DB2021★ 4 cited
Efficient Discovery of Approximate Order Dependencies
Reza Karegar, Parke Godfrey, Lukasz Golab +3
Order dependencies (ODs) capture relationships between ordered domains of attributes. Approximate ODs (AODs) capture such relationships even when there exist exceptions in the data…
cs.DB2019★ 2 cited
Errata Note: Discovering Order Dependencies through Order Compatibility
Parke Godfrey, Lukasz Golab, Mehdi Kargar +2
A number of extensions to the classical notion of functional dependencies have been proposed to express and enforce application semantics. One of these extensions is that of order…