Dynaverse.net
Off Topic => Engineering => Topic started by: Nemesis on April 22, 2011, 07:56:33 pm
-
Link to full article (http://www.theregister.co.uk/2011/04/21/texas_jury_says_google_infringed_linux_patent/)
According to the jury verdict, Google infringed two claims in the patent. The first claim describes an information storage and retrieval system comprising:
a linked list to store and provide access to records stored in a memory of the system, at least some of the records automatically expiring
a record search means utilizing a search key to access the linked list
the record search means including a means for identifying and removing at least some of the expired ones of the records from the linked list when the linked list is accessed
a means – utilizing the record search means – for accessing the linked list and, at the same time, removing at least some of the expired ones of the records in the linked list
The second claim also includes a "means for dynamically determining maximum number for the record search means to remove in the accessed linked list of records". The jury found that Google did not provide by a "preponderance of evidence" that these clams were invalid.
I'm neither a programmer nor a database person but doesn't this look a lot like fundamental database functions? Is so then they are way too old to be under patent legitimately.