Augsten Nikolaus (23 results)
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
US$ 34.97
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contact seller5-star sellerCondition: New
US$ 37.62
Free ShippingShips within U.S.A.Quantity: 1 available
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
US$ 37.12
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
Language: English
Published by Springer International Publishing AG, CH, 2013
- Softcover
Seller: Rarewaves.com USA, London, LONDO, United KingdomRarewaves.com USA
Contact seller5-star sellerCondition: New
US$ 41.69
Free ShippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. 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 and techniques to incorporate similarity into d…atabase 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.
- Softcover
Seller: PBShop.store UK, Fairford, GLOS, United KingdomPBShop.store UK
Contact seller5-star sellerCondition: New
US$ 37.33
US$ 5.54 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
- Softcover
Seller: Chiron Media, Wallingford, United KingdomChiron Media
Contact seller5-star sellerCondition: New
US$ 34.52
US$ 20.62 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: New.
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 40.87
US$ 15.95 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In English.
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: New
US$ 37.32
US$ 19.97 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New.
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: Used - As new
US$ 41.40
US$ 19.97 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
- Softcover
Seller: Chiron Media, Wallingford, United KingdomChiron Media
Contact seller5-star sellerCondition: New
US$ 40.71
US$ 20.62 shippingShips from United Kingdom to U.S.A.Quantity: 10 available
PF. Condition: New.
- Softcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
US$ 60.48
US$ 3.99 shippingShips within U.S.A.Quantity: 4 available
Condition: New. 1st edition NO-PA16APR2015-KAP.
- Softcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
US$ 64.85
US$ 13.31 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: Brand New. 120 pages. 9.25x7.50x0.50 inches. In Stock.
- Softcover
Seller: Speedyhen, Hertfordshire, United KingdomSpeedyhen
Contact seller5-star sellerCondition: New
US$ 33.04
US$ 54.58 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Condition: NEW.
Language: English
Published by Springer, Berlin|Springer International Publishing|Morgan & Claypool|Springer, 2013
- Softcover
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
US$ 44.07
US$ 55.74 shippingShips from Germany to U.S.A.Quantity: 1 available
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.
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 45.67
US$ 69.72 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: 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 c…oncepts 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.
- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 41.18
US$ 79.64 shippingShips from Germany to U.S.A.Quantity: 5 available
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
- Softcover
Seller: Rarewaves.com UK, London, United KingdomRarewaves.com UK
Contact seller5-star sellerCondition: New
US$ 38.74
US$ 86.53 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: New.
- Softcover
- Print on Demand
Seller: Brook Bookstore On Demand, Napoli, NA, ItalyBrook Bookstore On Demand
Contact seller5-star sellerCondition: New
US$ 38.23
US$ 6.26 shippingShips from Italy to U.S.A.Quantity: Over 20 available
Condition: new. Questo è un articolo print on demand.
- Softcover
- Print on Demand
Seller: Basi6 International, Irving, TX, U.S.A.Basi6 International
Contact seller5-star sellerCondition: New
US$ 53.80
Free ShippingShips within U.S.A.Quantity: 10 available
Condition: Brand New. New. US edition. Print on demand title. Delivery takes 20-25 days. Excellent Customer Service.
- Softcover
- Print on Demand
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
US$ 41.87
US$ 13.31 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: Brand New. 123 pages. 9.25x7.51x9.25 inches. In Stock. This item is printed on demand.
- Softcover
- Print on Demand
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: New
US$ 58.16
US$ 8.65 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
Condition: New. Print on Demand.
- Softcover
- Print on Demand
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: New
US$ 63.22
US$ 11.32 shippingShips from Germany to U.S.A.Quantity: 4 available
Condition: New. PRINT ON DEMAND.
- Softcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
US$ 41.37
US$ 68.26 shippingShips from Germany to U.S.A.Quantity: 1 available
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 des…cribes 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.
