Appeal No. 1996-3089
Application No. 08/006,860
This is a decision on appeal from the final
rejection of claims 1 through 5 and 7 through 9, all of the
claims pending in the application.
The invention relates to an improvement of the B+-
tree index structure for retrieving information from a
computer. B+-trees are characterized in that all key records
are stored in the leaf nodes, while other nodes in the tree
contain only index entries for routing searches. Information
as to which leaf in the tree contains the key records that
follow in sequence is not ordinarily contained in the leaf
nodes themselves. By adding an additional pointer to each
leaf node, Appellants have provided the ability to
sequentially access key records in leaf nodes without
accessing non-leaf nodes, thus speeding up sequential access.
The only independent claim, claim 1, is reproduced
as follows:
1. A computer system for retrieval of information,
said computer system comprising storage means being adapted to
store an index structure, said index structure comprising:
a tree with one or more paths from a root node
2
Page: Previous 1 2 3 4 5 6 7 8 9 10 Next
Last modified: November 3, 2007