Appeal No. 2001-1605
Application 08/735,168
Figures 3 and 4 describe how Bireley solves the problem of
query parallelism. See column 10, lines 53 through 55. The high
level control flow of query parallelism is described in figures
5A and 5B. See column 11, lines 36 through 40. In step 504,
shown in figure 5A, the originating database management system
binds the query thereby creating a plan for executing the query.
See column 11, lines 47 through 52, of Bireley. The operation of
the originating database management system during the buying time
shown in step 504 is represented by a control flow diagram shown
in figure 6. Thus, the portion of Bireley which the Examiner
relies on for disclosing partitioning a database into several
partitions and reading an access request to such data wherein
access to a partition database is deemed to contain a plurality
of partitions is directed to the method of determining query
parallelism. This portion of Bireley, column 12, lines 20
through 63, is describing the operation of the original database
management during the buying time in which the database
management system decomposes the query into multiple parallel
tasks and allocates the parallel tasks across to the other
database management systems. We agree with the Examiner that
this portion of Bireley does teach that the data is in
partitioned tablespace located in separate physical storage
10
Page: Previous 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 Next
Last modified: November 3, 2007