Hallo! Tracked shipping to Austria with Delivery Duty Paid for just €3.99  

Ship to
Austria
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada Similarity Joins in Relational Database Systems
Type
Physical Book
Author
Publisher
Language
English
Pages
106
Format
Paperback
Dimensions
23.5 x 19.1 x 0.7 cm
Weight
0.23 kg.
ISBN13
9783031007231
Edition No.
1
Categories

Similarity Joins in Relational Database Systems

Nikolaus Augsten (Author) · Michael Bohlen (Author) · Springer · Paperback

Similarity Joins in Relational Database Systems - Augsten, Nikolaus ; Bohlen, Michael

Cheaper New Book Imported to Austria
Delivery: 03 Sep - 08 Sep Shipping: 12 to 14 business days.
46,56 €
Faster New Book Imported to Austria
Delivery: 19 Aug - 20 Aug Shipping: 2 to 2 business days.
49,55 €
Import costs and 10% VAT included in the price ✅
46,56 €

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "Similarity Joins in Relational Database Systems"

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.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews