4 citations · 4 across the 2 of their papers we have counts for
Showing cs.DBShow all
2 papers · 1 filter
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.DB2020
Discovering Domain Orders through Order Dependencies
Reza Karegar, Melicaalsadat Mirsafian, Parke Godfrey +4
Much 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 im…