Similarity Joins in Relational Database Systems
Similarity Joins in Relational Database Systems
Paperback
Couldn't load pickup availability
Join our rewards scheme and earn reward points on this purchase!
Earn points on this!
Sign in or Sign up!- Release Date: 19/11/2013
- Barcode: 9783031007231
- Imprint: Springer International
- Publisher: Springer

Similarity Joins in Relational Database Systems
Couldn't load pickup availability
Collapsible content
DESCRIPTION
Since the edit distance is computationally expensive, token-based distances have been introduced to speed up edit distance computations. Token-based distances are used to compute an approximation of the edit distance and prune expensive edit distance calculations.
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.
DELIVERY & RETURNS
UK Delivery:
- Free delivery on all orders of £10 or more.
- £1.49 delivery fee on orders below £10.
- UK orders are shipped via Royal Mail 2nd Class.
International Delivery:
- Flat rate delivery charges vary by country.
Dispatch and Delivery Times:
- All orders are shipped from our warehouse in Northampton, UK within 48 hours of receipt during working hours.
- UK mainland orders typically arrive within 3-5 working days via Royal Mail 2nd Class.
- International estimated delivery times:
- Europe & Channel Islands: 7 to 10 working days
- USA: 7 to 15 working days
- Rest of the World: 9 to 21 working days
View our full delivery infomation here.
-
OVER
2 MILLION PRODUCTS
-
60 MILLION CUSTOMERS
ACROSS 190 COUNTRIES
You might also like
Loading recommendations...