Federal Circuit Says Software Patent Claims not Abstract, are Patent Eligible
WASHINGTON - The United States Court of Appeals for the Federal Circuit issued an important decision on software patent eligibility in Enfish LLC v. Microsoft. The opinion by Judge Hughes, who was joined by Judge Moore and Judge Taranto, doubles the total of Federal Circuit decisions where claims in a software patent were deemed to be patent eligible because they are not abstract. In other words, DDR Holdings is no longer the only point of hope for innovators and patent owners in the software space.
This case stared when Enfish sued Microsoft for patent infringement. The patents at issue were US Patent No. 6,151,604 and US Patent No. 6,163,775, both issued in late 2000 and both claiming priority to the same application filed in March 1995. The ’604 and ’775 patents are directed to an innovative logical model for a computer database. A logical model is a model of data for a computer database explaining how the various elements of information are related to one another. Contrary to conventional logical models, the patented logical model includes all data entities in a single table, with column definitions provided by rows in that same table. The patents describe this as the “self-referential” property of the database.
The patents explain that the claimed invention is an improvement, which the Federal Circuit would make a great deal about in their patent eligibility analysis.
The patents teach that multiple benefits flow from this design. First, the patents disclose an indexing technique that allows for faster searching of data than would be possible with the relational model. Second, the patents teach that the self-referential model allows for more effective storage of data other than structured text, such as images and unstructured text. Finally, the patents teach that the self-referential model allows more flexibility in configuring the database.