activity
20122021
most citedEfficient Discovery of Approximate Order Dependencies

4 citations · 9 across the 4 of their papers we have counts for

collaborators

6 papers

cs.DB20214 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.LG20203 cited

Joint Variational Autoencoders for Recommendation with Implicit Feedback

Bahare Askari, Jaroslaw Szlichta, Amirali Salehi-Abari

Variational Autoencoders (VAEs) have recently shown promising performance in collaborative filtering with implicit feedback. These existing recommendation models learn user represe…

cs.DB20192 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…

cs.DB2019

ABC of Order Dependencies

Pei Li, Michael Bohlen, Jaroslaw Szlichta +1

We enhance constrained-based data quality with approximate band conditional order dependencies (abcODs). Band ODs model the semantics of attributes that are monotonically related w…

cs.DB2019

Guided Automated Learning for query workload re-Optimization

Guilherme Damasio, Vincent Corvinelli, Parke Godfrey +4

Query optimization is a hallmark of database systems enabling complex SQL queries of today's applications to be run efficiently. The query optimizer often fails to find the best pl…

cs.DB2012

Fundamentals of Order Dependencies

Jaroslaw Szlichta, Parke Godfrey, Jarek Gryz

Dependencies have played a significant role in database design for many years. They have also been shown to be useful in query optimization. In this paper, we discuss dependencies…