Appeal 2007-1505
Application 10/279,481
Insert, Delete, and Relabel (which is similar to Appellant’s replacement).
See paragraphs 0053, 0054, and 0056-0058. Based upon this analysis, a
transformation program is generated for transforming XML documents
using the first schema into documents in the target XML schema. Paragraph
0101. We are unable to find any relevant discussion in Su of verifying or
checking the transformed documents.
Clewis teaches a system to analyze and process hierarchical data
structures. Paragraph 0002. The system permits pruning of nodes to un-
necessary data to improve processing efficiency. Paragraph 0010. We are
unable to find any discussion in Clewis of transforming XML schema. Nor
are we able to find any relevant discussion in Clewis of verifying or
checking of transformed documents.
ANALYSIS
Claims 1 through 9, 16, and 17.
Claim 1 recites “performing a plurality of schema manipulation
operations … the schema manipulation operations including operations of
the group including: inserting a schema segment, deleting a schema segment,
replacing a schema segment.” Claim 16 recites a similar limitation. We note,
while this limitation does not recite that all of the three different schema
manipulations are performed, it does recite that the group of manipulations
includes: inserting, deleting, and replacing schema segments. Claim 16
recites a similar limitation. Thus, we hold that the recitation of manipulation
functions in claims 1 and 16 is not presented in the alternative and the claim
is limited to computer implemented methods (claim 16, to data processing
8
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 12 Next
Last modified: September 9, 2013