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?
- 0 Answers
- 490 Views
- Twitter, I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
how would you modify that solution to only count the number of unique words in all the documents?
What is InputSplit and RecordReader?
Knox and Hadoop Development Tools?
Explain the features of fully distributed mode?
What is the problem with HDFS and streaming data like logs
What if a namenode has no data?
Why password is needed in ssh localhost?
How hdfa differs with nfs?
What is the use of Combiner?
what is difference between int and intwritable?
Can NameNode and DataNode be a commodity hardware?
What is a secondary namenode?
-
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)
