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
Is hadoop obsolete?
What are the site-specific configuration files in Hadoop?
Can you explain how do ‘map’ and ‘reduce’ work?
How to enable recycle bin in hadoop?
What are the four characteristics of Big Data?
What is cloudera and why it is used?
What are the hadoop's three configuration files?
What is a spill factor with respect to the ram?
Is hadoop a memory?
How can you overwrite the replication factors in HDFS?
What do you know about sequencefileinputformat?
Can Apache Kafka be used without Zookeeper?
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)