Skip to main content

Analysing patent race in Hadoop area

We take a quick look at the US patents space for 2013. Compiling data from January to July 2013, we list below some of the key observations on patents which are leveraging Hadoop in their architecture.



It is interesting to note that Amazon, Xerox and IBM lead the race so far. While IBM is the usual leader in patent race, Amazon also springs no surprise since Hadoop and MapReduce have been a preferred choice of internet companies. It may be tempting to comment at Xerox’s jump among the race leaders but a closer look at data shows that the patents by Xerox were filed between 2007 and 2010 and have been published this year. It is no surprise though considering that some of the best minds have worked at Xerox and hadoopsphere had covered one of their unique architectures much earlier in the game.

Another surprising fact was thrown up on deeper digging of patent text. The following 4 patents were ditto similar on Hadoop usage text and had similar figures. That much for novelty and uniqueness! Again points out that US patent system is far from perfect. It is interesting to note that two organizations among these, Artificial Solutions and NewVoice Media have got major VC funding this year.
Description
Patent
Issued
Assignee
... delivering advanced natural language ...
US8346563
 1 Jan 2013
Artificial Solutions Ltd.
... optimized and distributed routing of ...
US8463939
 11 Jun 2013
Brian R. Galvin
... optimized and distributed resource management
US8386639
 26 Feb 2013
New Voice Media Limited
... automated testing of functionally complex ...
US8418000
 9 Apr 2013
True Metrics LLC



Looking at year on year comparison, it is clear that with growing awareness and popularity of Hadoop, the no. of patents leveraging Hadoop also has increased. Among the last year leaders, Facebook dominated the race.



Few notes:
1)      Data has been compiled from public patent search sources and not extracted directly from USPTO data. Count and numbers may vary.
2)     Usage of Hadoop has been interpreted based on available text and actual usage may vary in implemented systems.

Comments

Popular posts from this blog

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…

Amazon DynamoDB datastore for Gora

What was initially suggested during causal conversation at ApacheCon2011 in November 2011 as a “neat idea”, would soon become prime ground for Gora's first taste of participation within Google's Summer of Code program. Initially, the project, titled Amazon DynamoDB datastore for Gora, merely aimed to extend the Gora framework to Amazon DynamoDB. However, it seem became obvious that the issue would include much more than that simple vision.

The Gora 0.3 Toolbox We briefly digress to discuss some other noticeable additions to Gora in 0.3, namely: Modification of the Query interface: The Query interface was amended from Query<K, T> to Query<K, T extends Persistent> to be more precise and explicit for developers. Consequently all implementors and users of the Query interface can only pass object's of Persistent type. Logging improvements for data store mappings: A key aspect of using Gora well is the establishment and accurate definitio…

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…