Exploiting uniqueness in query optimization

  title={Exploiting uniqueness in query optimization},
  author={G. Paulley and P. Larson},
Exploiting functional dependence in query optimization
Functional dependency analysis can be applied to various problems in query optimization: selectivity estimation, estimation of (intermediate) result sizes, order optimization (in particular sortExpand
Edit Based Grading of SQL Queries
This paper discusses techniques to find a minimum cost set of edits to a student query that can help assign partial marks, and proposes a greedy heuristic approach that works well both in terms of runtime and accuracy on queries in real-world datasets. Expand
Efficient Duplicate Elimination in SPARQL to SQL Translation
This work identifies specific query traits that lead to duplicate introduction and tracks down the mappings that are responsible for this behavior and shows how to incorporate this technique into query optimization decisions. Expand
Relational DBMS Internals
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercialExpand
Application of Definability to Query Answering over Knowledge Bases
Answering object queries (i.e. instance retrieval) is a central task in ontology based data access (OBDA). Performing this task involves reasoning with respect to a knowledge base K (i.e. ontology)Expand
On Codd Families of Keys over Incomplete Relations
The results help to bridge the gap between the existing theory of database constraints and database practice and settle various questions related to the maximal size of a family of non-redundant key sets. Expand
Definition of cross-domain indexes and ordering functions in relational algebra and its usage in relational database management systems
It is shown that all foreign keys in a database can be transformed in indexes with the benefit of speeding data access and with this new technique, commercial database engines should not degrade performance because all supporting structures are already present and, in some cases, a better performance might be achieved. Expand
Design by Example for SQL Tables with Functional Dependencies
An Armstrong relation satisfies the functional dependencies (FD) implied by a given FD set and violates all other FDs. Therefore, they form an instance of the design-by-example methodology: theExpand
Equivalence of Queries with Nested Aggregation
This thesis addresses the problem of deciding query equivalence between conjunctive SQL queries containing aggregation operators that may be nested and proposes useful sufficient conditions that generalize previously known results for restricted classes of queries. Expand
Equivalence of queries that are sensitive to multiplicities
Combined semantics is presented, which formally models query evaluation combining set, bag and bag-set semantics and shows sufficient conditions for equivalence for several important common classes of queries. Expand