Appeal No. 2003-1036
Application No. 09/330,865
Appellants’ invention relates to assigning recoverable unique sequence numbers
in a transaction processing system. An understanding of the invention can be derived
from a reading of exemplary claim 1, which is reproduced below.
1. A computer-implemented system for assigning sequence numbers,
comprising:
(a) a computer system; and
(b) sequence number assignment logic, performed by the computer
system, for generating a recoverable, unique sequence number for
assignment to an application when requested by the application, wherein
subsequent ones of the sequence number can be assigned to applications
concurrently without waiting for other applications which have been
previously assigned the sequence number, and for periodically
checkpointing the sequence number to a data storage device connected
to the computer, wherein the checkpointed sequence number is used to
initialize the sequence number assignment logic.
The prior art of record relied upon by the examiner in rejecting the appealed
claims is as follows:
Myre, Jr. et al. (Myre) 5,043,866 Aug. 27, 1991
Mohan et al. (Mohan) 5,327,556 Jul. 05, 1994
Zbikowski et al. (Zbikowski) 5,590,318 Dec. 31, 1996
Claims 1, 3-6, 8-11, 14, 16-19, 21-24, 27, 29-32, 34-37, 40-41, 43, 44, 46, 47, and
50-55, 57-62, 64-69 and 71-76 stand rejected under 35 U.S.C. § 103 as being
unpatentable over Myre in view of Zbikowski. Claims 12, 25, 38, 39, and 48, stand rejected
under 35 U.S.C. § 103 as being unpatentable over Myre in view of Zbikowski further in view
of Mohan.
2
Page: Previous 1 2 3 4 5 6 7 8 Next
Last modified: November 3, 2007