Appeal No. 1995-3501 Page 5
Application No. 07/927,788
If a file directory group runs out of
space to store any more file directory
entries for its path, a new file directory
group is allocated. The last block of the
old file directory group points to the
first block of the new file directory
group, and vice versa. This doubly linked
chain permits searching the file directory
groups having a common path either
backwards or forwards. This technique also
allows for an unlimited number of data
files per path on the WORM volume, subject
only to the physical space limitations of
the WORM volume. [Specification at page 6.]
The specification discloses that the PVR table contains the
address of the next file directory group and the address of
the previous file directory group, if any, for the path to
allow chaining of all file directory groups per path
(Specification at pages 19 and 20).
The examiner is of the opinion that the Path Table of
Miki disclosed in Figures 7D and 8C is a PVR table as recited
in claims 87 and 90. In this regard the examiner is of the
opinion that what Miki calls directory files i.e. AAA, BBB,
CCCCC, and A to K are file directory groups. However,
directories AAA, BBB, CCCCC, and A to K do not comprise a path
name and a plurality of file directory blocks each of which
contain a plurality of file directory entries (See Figures 7B
Page: Previous 1 2 3 4 5 6 7 8 Next
Last modified: November 3, 2007