Ask
Login
0
5.1kviews
Write a Map-Reduce Algorithm for Binary search tree. Explain the flow of execution.
written 6.7 years ago by gravatar for swatisharma swatisharma • 1.4k modified 5.6 years ago by gravatar for prashantsaini prashantsaini • 0
big data analytics
ADD COMMENT EDIT
1 Answer
2
285views
written 6.6 years ago by gravatar for teamques10 teamques10 ★ 70k

Overall approach (FLOW):

  1. Scale-divide key, value data into shards.

  2. Build Patricia tree per shard and store all key, values for latter.

  3. Prepare trees to have place hold (short) value for each key.

  4. Flatten each Patricia tree to a disk friendly and byte alighted format fit for random access.

  5. Recalculated file …

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.