Appeal No. 97-1353 Page 3
Application No. 07/843,704
generating pointer data indicating connections
of said allocated memory areas according to node
relationships indicated in said attribute data.
(Paper No. 8 at 3, entered 1 March 1996, footnote added.)
The examiner rejected (Paper No. 7 at 2) all pending
claims under 35 U.S.C. § 103 as having been obvious in view of
Simonetti 5,295,261 15 March 1994.
Simonetti describes a hybrid tree-relational data
structure. He notes that relational databases and tree data
structures each have advantages that depend on the nature of
the data and of the queries (and other functions) to be
performed on the data. Trees are better for data that is
suited to hierarchical organization. (1:30-4:56.) For ease
of explanation, Simonetti begins by describing his hybrid
database strictly in terms of a relational database 10:
Simonetti Figure 1A
Page: Previous 1 2 3 4 5 6 7 8 Next
Last modified: November 3, 2007