Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

Similarity Joins in Relational Database Systems, Paperback / softback Book

Similarity Joins in Relational Database Systems Paperback / softback

Part of the Synthesis Lectures on Data Management series

Paperback / softback

Description

State-of-the-art database systems manage and process a variety of complex objects, including strings and trees.

For such objects equality comparisons are often not meaningful and must be replaced by similarity comparisons.

This book describes the concepts and techniques to incorporate similarity into database systems.

We start out by discussing the properties of strings and trees, and identify the edit distance as the de facto standard for comparing complex objects.

Since the edit distance is computationally expensive, token-based distances have been introduced to speed up edit distance computations.

The basic idea is to decompose complex objects into sets of tokens that can be compared efficiently.

Token-based distances are used to compute an approximation of the edit distance and prune expensive edit distance calculations.

A key observation when computing similarity joins is that many of the object pairs, for which the similarity is computed, are very different from each other.

Filters exploit this property to improve the performance of similarity joins.

A filter preprocesses the input data sets and produces a set of candidate pairs.

The distance function is evaluated on the candidate pairs only.

We describe the essential query processing techniques for filters based on lower and upper bounds.

For token equality joins we describe prefix, size, positional and partitioning filters, which can be used to avoid the computation of small intersections that are not needed since the similarity would be too low.

Information

  • Format:Paperback / softback
  • Pages:124 pages
  • Publisher:Morgan & Claypool Publishers
  • Publication Date:
  • Category:
  • ISBN:9781627050289

Other Formats

£24.99

Item not Available
 
Free Home Delivery

on all orders

 
Pick up orders

from local bookshops

Information

  • Format:Paperback / softback
  • Pages:124 pages
  • Publisher:Morgan & Claypool Publishers
  • Publication Date:
  • Category:
  • ISBN:9781627050289

Also in the Synthesis Lectures on Data Management series  |  View all