Similarity queries: their conceptual evaluation, transformations, and processing

  • Authors:
  • Yasin N. Silva;Walid G. Aref;Per-Ake Larson;Spencer S. Pearson;Mohamed H. Ali

  • Affiliations:
  • Arizona State University, Phoenix, USA;Purdue University, West Lafayette, USA;Microsoft Research, Redmond, USA;Arizona State University, Phoenix, USA;Microsoft Corporation, Redmond, USA

  • Venue:
  • The VLDB Journal — The International Journal on Very Large Data Bases
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many application scenarios can significantly benefit from the identification and processing of similarities in the data. Even though some work has been done to extend the semantics of some operators, for example join and selection, to be aware of data similarities, there has not been much study on the role and implementation of similarity-aware operations as first-class database operators. Furthermore, very little work has addressed the problem of evaluating and optimizing queries that combine several similarity operations. The focus of this paper is the study of similarity queries that contain one or multiple first-class similarity database operators such as Similarity Selection, Similarity Join, and Similarity Group-by. Particularly, we analyze the implementation techniques of several similarity operators, introduce a consistent and comprehensive conceptual evaluation model for similarity queries, and present a rich set of transformation rules to extend cost-based query optimization to the case of similarity queries.