Appeal No. 2004-1668
Application No. 09/466,529
keys to form an association for each of the plurality of keys,
and storing, in a location of an associative database pointed to
by the association, a subset of a plurality of tallies associated
with the plurality of targets. Claim 23 requires 1) a hashing
calculator, connected to a parser of fault messages for an event
code, target and tally, that determines a key based on the event
code and determines an association for the key, and 2) an
associative database that is connected to the parser and stores
the tally in a location pointed to by the association. Claim 24
requires forming a key for each unique combination of an event
code, target type and target, calculating a hash for the key to
form an association, and storing a tally connected with the key
in a location of an associative database.
The examiner’s arguments that the references are in similar
environments and that combining their teachings would optimize
network functions to maximize data management do not provide an
explanation as to how the references themselves would have led
one of ordinary skill in the art to combine their teachings in
such a manner that a system or method having the association or
associative database features set forth above as required by the
appellants’ independent claims is produced.
6
Page: Previous 1 2 3 4 5 6 7 8 9 Next
Last modified: November 3, 2007