Similarity Joins in Relational Database Systems

Similarity Joins in Relational Database Systems

Nikolaus Augsten, Michael Bohlen
ISBN: 9781627050289 | PDF ISBN: 9781627050296
Copyright © 2015 | 124 Pages | Publication Date: 11/01/2013

BEFORE YOU ORDER: You may have Academic or Corporate access to this title. Click here to find out: 10.2200/S00544ED1V01Y201310DTM038

Ordering Options: Paperback $35.00   E-book $28.00   Paperback & E-book Combo $43.75


Why pay full price? Members receive 15% off all orders.
Learn More Here

Read Our Digital Content License Agreement (pop-up)

Purchasing Options:



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.

Table of Contents

Preface
Acknowledgments
Introduction
Data Types
Edit-Based Distances
Token-Based Distances
Query Processing Techniques
Filters for Token Equality Joins
Conclusion
Bibliography
Authors' Biographies
Index

About the Author(s)

Nikolaus Augsten, University of Salzburg, Austria

Michael Bohlen, University of Z

Related Series

Data Mining and Knowledge Discovery

Reviews
Browse by Subject
Case Studies in Engineering
ACM Books
IOP Concise Physics
SEM Books
0 items
LATEST NEWS

Newsletter
Note: Registered customers go to: Your Account to subscribe.

E-Mail Address:

Your Name: