Data Engineer Given a list of followers in the format:123, 345234, 678345, 123…Where column one is the ID of the follower and column two is the ID of the followee. Find all mutual following pairs (the pair 123, 345 in the example above). How would you use Map/Reduce to solve the problem when the list does not fit in memory?
No Answer is Posted For this Question
Be the First to Post Answer
What are the network requirements for using hadoop?
What problems can be addressed by using Zookeeper?
What is Apache Hadoop YARN?
How Mapper is instantiated in a running job?
What is the use of combiners in the hadoop framework?
What is a namenode? How many instances of namenode run on a hadoop cluster?
Explain the features of pseudo mode?
Is secondary namenode a substitute to the namenode?
what is a datanode?
what are the steps involved in commissioning adding
What is rack-aware replica placement policy?
How can we change the split size if our commodity hardware has less storage space?
Apache Hadoop (394)
MapReduce (354)
Apache Hive (345)
Apache Pig (225)
Apache Spark (991)
Apache HBase (164)
Apache Flume (95)
Apache Impala (72)
Apache Cassandra (392)
Apache Mahout (35)
Apache Sqoop (82)
Apache ZooKeeper (65)
Apache Ambari (93)
Apache HCatalog (34)
Apache HDFS Hadoop Distributed File System (214)
Apache Kafka (189)
Apache Avro (26)
Apache Presto (15)
Apache Tajo (26)
Hadoop General (407)