Condition: New.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
Condition: As New. Unread book in perfect condition.
Language: English
Published by Springer International Publishing AG, CH, 2013
ISBN 10: 3031007239 ISBN 13: 9783031007231
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Paperback. Condition: New.
Condition: NEW.
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
Seller: Chiron Media, Wallingford, United Kingdom
Paperback. Condition: New.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 29.81
Quantity: Over 20 available
Add to basketCondition: New. In English.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Unread book in perfect condition.
PF. Condition: New.
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. 1st edition NO-PA16APR2015-KAP.
Paperback. Condition: Brand New. 120 pages. 9.25x7.50x0.50 inches. In Stock.
Condition: NEW.
Language: English
Published by Springer, Berlin|Springer International Publishing|Morgan & Claypool|Springer, 2013
ISBN 10: 3031007239 ISBN 13: 9783031007231
Seller: moluna, Greven, Germany
Condition: New. 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 a.
Taschenbuch. Condition: Neu. Similarity Joins in Relational Database Systems | Nikolaus Augsten (u. a.) | Taschenbuch | Synthesis Lectures on Data Management | xvii | Englisch | 2013 | Springer | EAN 9783031007231 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Language: English
Published by Springer International Publishing AG, CH, 2013
ISBN 10: 3031007239 ISBN 13: 9783031007231
Seller: Rarewaves.com UK, London, United Kingdom
Paperback. Condition: New.
Seller: Brook Bookstore On Demand, Napoli, NA, Italy
Condition: new. Questo è un articolo print on demand.
Language: English
Published by Springer-Nature New York Inc, 2013
ISBN 10: 3031007239 ISBN 13: 9783031007231
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 123 pages. 9.25x7.51x9.25 inches. In Stock. This item is printed on demand.
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand.
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND.
Language: English
Published by Springer, Springer Nov 2013, 2013
ISBN 10: 3031007239 ISBN 13: 9783031007231
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 128 pp. Englisch.