Articoli correlati a Similarity Joins in Relational Database Systems

Similarity Joins in Relational Database Systems - Brossura

 
9781627050289: Similarity Joins in Relational Database Systems

Sinossi

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

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Compra usato

Condizioni: molto buono
Fast Shipping - Safe and Secure...
Visualizza questo articolo

EUR 3,43 per la spedizione in U.S.A.

Destinazione, tempi e costi

Altre edizioni note dello stesso titolo

9783031007231: Similarity Joins in Relational Database Systems

Edizione in evidenza

ISBN 10:  3031007239 ISBN 13:  9783031007231
Casa editrice: Springer, 2013
Brossura

Risultati della ricerca per Similarity Joins in Relational Database Systems

Foto dell'editore

Augsten, Nikolaus,BÃ hlen, Michael H.
ISBN 10: 1627050280 ISBN 13: 9781627050289
Antico o usato paperback

Da: suffolkbooks, Center moriches, NY, U.S.A.

Valutazione del venditore 4 su 5 stelle 4 stelle, Maggiori informazioni sulle valutazioni dei venditori

paperback. Condizione: Very Good. Fast Shipping - Safe and Secure 7 days a week! Codice articolo 3TWOWA001PJZ

Contatta il venditore

Compra usato

EUR 30,29
Convertire valuta
Spese di spedizione: EUR 3,43
In U.S.A.
Destinazione, tempi e costi

Quantità: 2 disponibili

Aggiungi al carrello