Appeal No. 2004-1597
Application No. 09/383,889
and arranging the data in a particular relational manner.3 Other
disclosed embodiments describe a different and particular schema
such as considering the entropy of the data (page 5) and row
major order (page 7), which more specifically define how the data
is “partitioned” and “reordered.”
Therefore, we remain unconvinced by Appellants that “schema”
defines anything more than a generic name for compression
technique that involves some form of dividing and arranging the
data. Attributing to “schema” the full range of its ordinary
meaning as understood by skilled artisan and without importing
limitations from the specification into the claim, the step of
“transforming the data in accordance with a schema” reads on the
step of dividing the uncompressed, unmodified codes into cache
line blocks of Breternitz. Additionally, even if some form of
partitioning and reordering are required in a “schema,” the
divided code is indeed, partitioned and reordered into blocks,
which are later compressed. Even claim 2, which requires that
3 Schema is defined as “a description of a database to the database
management system (DBMS), generated using the data definition language
provided by the DBMS....Regardless of context, however, a schema defines a
particular view of some aspect of the database ....” Computer Dictionary,
Microsoft Press, Second Edition, 1994.
Schema is also defined as “the structure of a database system, described
in a formal language supported by the database management system (DBMS). In a
relational database, the schema defines the tables, the fields in each table,
and the relationships between fields and tables.” Webopedia online
encyclopedia, (http://webopedia.com), as modified June 21, 2002.
Copies of these two definitions accompany this decision.
7
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 Next
Last modified: November 3, 2007