Data-Intensive Text Processing with MapReduce

Jimmy Lin

ISBN 10: 3031010086 / ISBN 13: 9783031010088

Published by Springer, Springer Apr 2010, 2010

About this Item

This item is printed on demand - Print on Demand Titel. Neuware -Our world is being revolutionized by data-driven methods: access to large amounts of data has generated new insights and opened exciting new opportunities in commerce, science, and computing applications. Processing the enormous quantities of data necessary for these advances requires large clusters, making distributed computing paradigms more crucial than ever. MapReduce is a programming model for expressing distributed computations on massive datasets and an execution framework for large-scale data processing on clusters of commodity servers. The programming model provides an easy-to-understand abstraction for designing scalable algorithms, while the execution framework transparently handles many system-level details, ranging from scheduling to synchronization to fault tolerance. This book focuses on MapReduce algorithm design, with an emphasis on text processing algorithms common in natural language processing, information retrieval, and machine learning. We introduce the notion ofMapReduce design patterns, which represent general reusable solutions to commonly occurring problems across a variety of problem domains. This book not only intends to help the reader 'think in MapReduce', but also discusses limitations of the programming model as well. Table of Contents: Introduction / MapReduce Basics / MapReduce Algorithm Design / Inverted Indexing for Text Retrieval / Graph Algorithms / EM Algorithms for Text Processing / Closing RemarksSpringer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 180 pp. Englisch.

Seller Inventory # 9783031010088

Bibliographic Details

• Title: Data-Intensive Text Processing with MapReduce
• Publisher: Springer, Springer Apr 2010
• Publication Date: 2010
• Language: English
• ISBN 10: 3031010086
• ISBN 13: 9783031010088
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 191H x 11D millimeters 235 millimeters width by 191 millimeters height by 11 millimeters depth
• Weight: 348 grams

About this title

Synopsis

Our world is being revolutionized by data-driven methods: access to large amounts of data has generated new insights and opened exciting new opportunities in commerce, science, and computing applications. Processing the enormous quantities of data necessary for these advances requires large clusters, making distributed computing paradigms more crucial than ever. MapReduce is a programming model for expressing distributed computations on massive datasets and an execution framework for large-scale data processing on clusters of commodity servers. The programming model provides an easy-to-understand abstraction for designing scalable algorithms, while the execution framework transparently handles many system-level details, ranging from scheduling to synchronization to fault tolerance. This book focuses on MapReduce algorithm design, with an emphasis on text processing algorithms common in natural language processing, information retrieval, and machine learning. We introduce the notion ofMapReduce design patterns, which represent general reusable solutions to commonly occurring problems across a variety of problem domains. This book not only intends to help the reader "think in MapReduce", but also discusses limitations of the programming model as well. Table of Contents: Introduction / MapReduce Basics / MapReduce Algorithm Design / Inverted Indexing for Text Retrieval / Graph Algorithms / EM Algorithms for Text Processing / Closing Remarks

About the Author

Jimmy Lin is an Associate Professor in the iSchool (College of Information Studies) at the University of Maryland, College Park. He directs the recently-formed Cloud Computing Center, an interdisciplinary group that explores the many aspects of cloud computing as it impacts technology, people, and society. Lin's research lies at the intersection of natural language processing and information retrieval, with a recent emphasis on scalable algorithms and large-data processing. He received his Ph.D. from MIT in Electrical Engineering and Computer Science in 2004.