Appeal No. 2006-1055
Application No. 09/752,355
Appellants point out that Muret’s system “uses a very
complex, and inevitably slow, sequential program to parse through
web-log data, distributing this data across a vast array of
tables” (brief-page 4), with the tables including a visitor
table, data tables, a hash table, a rank table, a record table,
and a string table. Appellants assert that the complexity and
sequential nature of Muret’s control program and the database
management pieces that it must oversee somehow precludes Muret’s
system from gaining any benefit from the use of plural parallel
processing modules. But, complexity of a system, per se, does
not appear to us to preclude the use of plural, parallel
processing modules for the purpose of speeding up processing
time.
Accordingly, since, in our view, the examiner has
established a prima facie case of obviousness that has not been
successfully rebutted by any evidence or convincing argument by
appellants, we will sustain the rejection of claims 1-15 under 35
U.S.C. § 103.
9
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 Next
Last modified: November 3, 2007