Skip to main content

Facebook predicts what you like to see on web page

The conventional wisdom of HTTP web page request between browser and servers is to transmit the response as whole in the form of a structured mark up language. However, this may not be how it works in today’s social networks.

Today’s smart social networks like Facebook use Hadoop and Hive driven intelligence to predict which resources of web page have a predetermined likelihood to be included in a response to a future request. Resources which includes java-scripts, style sheets, image etc are identified based on map-reduce and other computational algorithms which run on distributed systems analyzing billions of entries in the resource logs. These identified resources are stored/cached in server hash maps and the page is rendered in phase wise manner.

This method and system is described in US patent 8,108,377 Predictive resource identification and phased delivery of structured documents (Inventors: Jiang; Changhao, Wei; Xiaoliang; Assignee: Facebook, Inc. (Palo Alto, CA)) .

As the disclosure goes on to describe Hadoop and Hive usage, we find that
“…the resource logging, analyzing, filtering, predicting, and/or selecting operations discussed above can be implemented using Hive to accomplish ad hoc querying, summarization and data analysis, as well as using as incorporating statistical modules by embedding mapper and reducer scripts, such as Python or Perl scripts that implement a statistical algorithm. Other development platforms that can leverage Hadoop or other Map-Reduce execution engines can be used as well…”

Must say, this is one of the smart implementations of predictive computation which is reducing latency, limiting network load and overall leading to a better user experience. Remember, since this is patented, check with assignee before any commercial usage. 


Post a Comment

Popular posts from this blog

Technical deep dive into Apache Tajo

Over the past few months, a new Hadoop based warehouse called Apache Tajo has been making the buzz. We tried to do a technical deep dive in the topic and reached out to PMC chair Hyunsik Choi. Apache Tajo is an Apache top level project since March 2014 and supports SQL standards. It has a powerful distributed processing architecture which is not based on MapReduce. To get more sense on Tajo's claims for providing a distributed, fault-tolerant, low-latency and high throughput SQL engine, we asked a few questions to Choi. This Q&A is published in a two part article series on Read below to get a better idea on Apache Tajo.
How does Apache Tajo work? As you may already know, Tajo does not use MapReduce and has its own distributed processing framework which is flexible and specialized to relational processing. Since its storage manager is pluggable, Tajo can access data sets stored in various storages , such as HDFS, Amazon S3, Openstack Swift or local file system. …

In-memory data model with Apache Gora

Open source in-memory data model and persistence for big data framework Apache Gora™ version 0.3, was released in May 2013. The 0.3 release offers significant improvements and changes to a number of modules including a number of bug fixes. However, what may be of significant interest to the DynamoDB community will be the addition of a gora-dynamodb datastore for mapping and persisting objects to Amazon's DynamoDB. Additionally the release includes various improvements to the gora-core and gora-cassandra modules as well as a new Web Services API implementation which enables users to extend Gora to any cloud storage platform of their choice. This 2-part post provides commentary on all of the above and a whole lot more, expanding to cover where Gora fits in within the NoSQL and Big Data space, the development challenges and features which have been baked into Gora 0.3 and finally what we have on the road map for the 0.4 development drive.
Introducing Apache Gora Although there are var…

Data deduplication tactics with HDFS and MapReduce

As the amount of data continues to grow exponentially, there has been increased focus on stored data reduction methods. Data compression, single instance store and data deduplication are among the common techniques employed for stored data reduction.
Deduplication often refers to elimination of redundant subfiles (also known as chunks, blocks, or extents). Unlike compression, data is not changed and eliminates storage capacity for identical data. Data deduplication offers significant advantage in terms of reduction in storage, network bandwidth and promises increased scalability.
From a simplistic use case perspective, we can see application in removing duplicates in Call Detail Record (CDR) for a Telecom carrier. Similarly, we may apply the technique to optimize on network traffic carrying the same data packets.
Some of the common methods for data deduplication in storage architecture include hashing, binary comparison and delta differencing. In this post, we focus on how MapReduce and…