Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 31,64
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
EUR 33,99
Cantidad disponible: 1 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 32,42
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 31,77
Cantidad disponible: 1 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Idioma: Inglés
Publicado por Springer International Publishing AG, CH, 2013
ISBN 10: 3031007239 ISBN 13: 9783031007231
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
EUR 36,70
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: New.
Librería: Speedyhen LLC, Hialeah, FL, Estados Unidos de America
EUR 37,01
Cantidad disponible: 2 disponibles
Añadir al carritoCondición: NEW.
Librería: Chiron Media, Wallingford, Reino Unido
EUR 29,97
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 31,76
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 35,23
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In English.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 35,94
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 50,55
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. 1st edition NO-PA16APR2015-KAP.
EUR 35,34
Cantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
EUR 28,68
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: NEW.
Idioma: Inglés
Publicado por Springer, Berlin|Springer International Publishing|Morgan & Claypool|Springer, 2013
ISBN 10: 3031007239 ISBN 13: 9783031007231
Librería: moluna, Greven, Alemania
EUR 37,61
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: 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.
Idioma: Inglés
Publicado por Springer International Publishing, Springer International Publishing, 2013
ISBN 10: 3031007239 ISBN 13: 9783031007231
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 35,30
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
EUR 35,10
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Idioma: Inglés
Publicado por Springer International Publishing AG, CH, 2013
ISBN 10: 3031007239 ISBN 13: 9783031007231
Librería: Rarewaves.com UK, London, Reino Unido
EUR 33,63
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: New.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 32,62
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: new. Questo è un articolo print on demand.
Idioma: Inglés
Publicado por Springer-Nature New York Inc, 2013
ISBN 10: 3031007239 ISBN 13: 9783031007231
Librería: Revaluation Books, Exeter, Reino Unido
EUR 36,34
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Brand New. 123 pages. 9.25x7.51x9.25 inches. In Stock. This item is printed on demand.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 47,52
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 48,58
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND.
Idioma: Inglés
Publicado por Springer International Publishing Nov 2013, 2013
ISBN 10: 3031007239 ISBN 13: 9783031007231
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 35,30
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - 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. 128 pp. Englisch.
Idioma: Inglés
Publicado por Springer, Springer Nov 2013, 2013
ISBN 10: 3031007239 ISBN 13: 9783031007231
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 35,30
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: 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.