Sign In Start Free Trial
Account

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Book Overview & Buying Building Big Data Pipelines with Apache Beam
  • Table Of Contents Toc
  • Feedback & Rating feedback
Building Big Data Pipelines with Apache Beam

Building Big Data Pipelines with Apache Beam

By : Lukavský
3.7 (9)
close
close
Building Big Data Pipelines with Apache Beam

Building Big Data Pipelines with Apache Beam

3.7 (9)
By: Lukavský

Overview of this book

Apache Beam is an open source unified programming model for implementing and executing data processing pipelines, including Extract, Transform, and Load (ETL), batch, and stream processing. This book will help you to confidently build data processing pipelines with Apache Beam. You’ll start with an overview of Apache Beam and understand how to use it to implement basic pipelines. You’ll also learn how to test and run the pipelines efficiently. As you progress, you’ll explore how to structure your code for reusability and also use various Domain Specific Languages (DSLs). Later chapters will show you how to use schemas and query your data using (streaming) SQL. Finally, you’ll understand advanced Apache Beam concepts, such as implementing your own I/O connectors. By the end of this book, you’ll have gained a deep understanding of the Apache Beam model and be able to apply it to solve problems.
Table of Contents (13 chapters)
close
close
1
Section 1 Apache Beam: Essentials
5
Section 2 Apache Beam: Toward Improving Usability
9
Section 3 Apache Beam: Advanced Concepts

Task 12 – enhancing SportTracker by runner motivation using CoGroupByKey

In Task 11, we solved the problem of sending motivating push notifications to users currently on track using side inputs. We already know that this approach might suffer from the problem of forcing the side input to fit into memory for all users, which might become restrictive once we have many users. The chances are pretty high that we will not ever hit the memory limit in such a use case, but let's assume that we want to avoid using side inputs and use CoGroupByKey instead.

Now, let's redefine Task 11 so that we can reimplement it by using CoGroupByKey.

Problem definition

Implement Task 11 but instead of using side inputs, use CoGroupByKey to avoid any possible memory pressure due to forcing side input to fit into memory for all keys (user-tracks).

Problem decomposition discussion

We will reuse as much code from Task 11 as we can. Our discussion of the problem remains, so our...

Unlock full access

Continue reading for free

A Packt free trial gives you instant online access to our library of over 7000 practical eBooks and videos, constantly updated with the latest in tech
bookmark search playlist download font-size

Change the font size

margin-width

Change margin width

day-mode

Change background colour

Close icon Search
Country selected

Close icon Your notes and bookmarks

Delete Bookmark

Modal Close icon
Are you sure you want to delete it?
Cancel
Yes, Delete

Confirmation

Modal Close icon
claim successful

Buy this book with your credits?

Modal Close icon
Are you sure you want to buy this book with one of your credits?
Close
YES, BUY