MapReduce and Design Patterns - Inverted Index Pattern Overview

In this video we are discussing inverted index pattern overview

This inverted index, this particular indexing, we require for the fruitful and efficient

searching operations. So, let us go into details. So, what is inverted index

An inverted index is commonly used for map-reduce ytics. And using this, we can make a map of some terms to a list of items

So, here you'll be making a map. of some terms to the list of items for the efficient and fruitful searching

It creates an index from the data set to search for items in lesser time

Different search engines built indexes to improve their searching mechanisms. So different search engines, they are having this particular pattern for their easy and efficient

searching of our search queries. So inverted index pattern structure. So here we are having the respective mappers

So, these mappers will produce key value pairs. That is a keyword for the searching and the unique ID

So, in this way, it is producing key value pairs where we are having the keyword

comma, unique ID. And this particular output will be made available to the partitioner

So, partitional will do the shuffling operation, and then the partitioner's output will

be going for the reducer, and reducer will make, there is a keyword A list of IDs

keyword D list of IDs in this way we're having keyword B list of IDs and keyword C

list of IDs so this is our inverted index pattern overview so let us go for further

discussion on this topic in our next videos thanks for watching this