Appeal No. 2001-1605
Application 08/735,168
partitions over different DASD volumes, with each I/O stream on a
separate channel path. However, when access is granted to an
application, the entire table is locked, even if a subset of the
data (e.g. data for only a few partitions) will be accessed.
When a table is partitioned, locking the entire table may degrade
concurrency and database system performance. It is an object of
Appellants’ invention to provide a means for serializing access
to a partitioned table in a relational database without requiring
locking of the entire table when a serialized application
requires access to less than all of the partitions of the table.
See page 2 of Appellants’ specification. Appellants provide this
object by the use of selective partition locking that allows the
database system to lock only those partitions of a partitioned
table space to which access is sought by the first application.
See page 3 of Appellants’ specification.
Independent claim 1 present in the application represent
Appellants’ claimed invention and is reproduced as follows:
1. A method for controlling concurrency of access to data
in a database system, comprising:
partitioning a table in the database system into a plurality
of partitions;
receiving a request for access to data in the table;
3
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Next
Last modified: November 3, 2007