Exploiting database similarity joins for metric spaces

Yasin Silva, Spencer Pearson

Research output: Chapter in Book/Report/Conference proceedingChapter

13 Scopus citations

Abstract

Similarity Joins are recognized among the most useful data processing and analysis operations and are extensively used in multiple application domains. They retrieve all data pairs whose distances are smaller than a predefined thresh-old ε. Multiple Similarity Join algorithms and implementation techniques have been proposed. They range from out-of-database approaches for only in-memory and external memory data to techniques that make use of standard database operators to answer similarity joins. Recent work has shown that this operation can be efficiently implemented as a physical database operator. However, the proposed operator only support 1D numeric data. This paper presents DBSimJoin, a physical Similarity Join database operator for datasets that lie in any metric space. DBSimJoin is a non-blocking operator that prioritizes the early generation of results. We implemented the proposed operator in PostgreSQL, an open source database system. We show how this operator can be used in multiple real-world data analysis scenarios with multiple data types and distance functions. Particularly, we show the use of DBSimJoin to identify similar images represented as feature vectors, and similar publications in a bibliographic database. We also show that DB-SimJoin scales very well when important parameters, e.g., ε, data size, increase.

Original languageEnglish (US)
Title of host publicationProceedings of the VLDB Endowment
Pages1922-1925
Number of pages4
Volume5
Edition12
StatePublished - Aug 2012

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • General Computer Science

Fingerprint

Dive into the research topics of 'Exploiting database similarity joins for metric spaces'. Together they form a unique fingerprint.

Cite this