4 citations · 10 across the 5 of their papers we have counts for
6 papers
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…
Answer Graph: Factorization Matters in Large Graphs
Zahid Abul-Basher, Nikolay Yakovets, Parke Godfrey +2
Our answer-graph method to evaluate SPARQL conjunctive queries (CQs) finds a factorized answer set first, an answer graph, and then finds the embedding tuples from this. This appro…
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…
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…
Towards Query Optimization for SPARQL Property Paths
Nikolay Yakovets, Parke Godfrey, Jarek Gryz
The extension of SPARQL in version 1.1 with property paths offers a type of regular path query for RDF graph databases. Such queries are difficult to optimize and evaluate efficien…
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…