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 is the difference between rdbms and hadoop?
Where is the Mapper Output intermediate kay-value data stored ?
What are the port numbers of namenode, job tracker and task tracker?
Is map like a pointer?
What does job conf class do?
What is the communication channel between client and namenode/datanode?
What is yarn in hadoop?
when hadoop enter in safe mode?
Is it necessary to know java to learn hadoop?
What is HDFS Federation?
what should be the ideal replication factor in hadoop?
What is high availability in hadoop?
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)