Appeal No. 2006-2702 Page 8
Application No. 09/881,234
datasets (i.e. N and M) involving a multiplication of data elements
nN x nM as, stated in instant claims 1 and 13.
According to the examiner (id.), Altschul teaches that “the sequence segments
can be of any length . . . or certain short sequences thus having a specified
range . . . .” The examiner recognizes, however, that like Smith, Altschul does
“not describe uncompressing data or looping processes.”
The examiner relies on Reed to make up for this deficiency in the
combination of Smith and Altschul. According to the examiner (Answer, page 8),
Reed describes “a system and methods that coordinate the transfer of data,
metadata, and instructions between databases to control and process
communications . . . which represents a separation or stripping of metadata from
data.” In this regard, the examiner finds (id.), Reed teaches that “this transfer of
metadata and methods allow for the control by the provider and consumer of the
types and contents of information subsequently transferred . . . which represents
storing minimal information if so desired.” In addition, the examiner finds (id.),
Reed teaches “compressing database, database query, or other file format using
PKZIP . . . that represents packing data into an efficient structure using a
redundancy reduction data compression method.”
In addition, the examiner finds (id.), Reed teaches “corresponding data,
metadata, and instructions in the provider program can control and automate
decryption and decompression of data . . .”; “communication networks that allow
both parties to control, filter, store, index, and process communications from
each other . . . which represents creating an index in an uncompressed manner”;
and “querying a provider database and loops through each communication object
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 12 Next
Last modified: November 3, 2007