Appeal 2007-1307
Application 10/454,274
instruction, regardless of whether it processes an 8-
bit or 32-bit storage unit, it is significantly faster to
process the larger bitmap storage units, such as 32-
bit storage units. However, processing bitmaps,
even in 32-bit storage units, uses significant
computer processor and memory resources.
Moreover, this problem increases as the number
and size of bitmaps increases.
(Specification 8).
5. Appellant indicates that “processing the bitmaps in 128-bit storage units,
rather than in 32-bit storage units, significantly improves efficiency and
speed by reducing the number of instructions, memory accesses, and loop
iterations needed to process a bitmap of given size” (Specification 9).
6. Bhashyam was cited by the Examiner merely because it “relates in general
to database management systems performed by computers, and in particular,
to the optimization of a star join operation in a relational database
management system using a bitmap index structure” (col. 1, ll. 9 to 12)1
(Answer 4).
7. Hathaway was cited by the Examiner because he “teaches allocating
registers in a superscalar machine (See abstract), in which he teaches
utilizing a microprocessor supporting instructions for simultaneous
processing of at least 128 bits and having storage units of at least 128 bits to
process bitmap index format database structures (See column 1, lines 10-14,
lines 54-59, where ‘register’ is read on ‘storage units’)” (Answer 4).
8. Ginter was cited by the Examiner for a teaching of “systems and methods
for secure transaction management and electronic rights protection (See
1 Compare the referenced teaching in Bhashyam with the acknowledged
prior art teaching in Appellant’s disclosure described supra in finding of fact
number 2.
4
Page: Previous 1 2 3 4 5 6 7 8 Next
Last modified: September 9, 2013