BTree Performance |
BTree Performance These
classes are quite efficient. The table below shows the times taken (in
milliseconds) for the standard test (description of standard test follows
table) on a Pentium III 500 with 256Mb RAM running Windows '98.
ACCOUNT_BLOGGS_ANNE
These are represented in the file as -
+ACCOUNT_BLOGGS_ANNE
Where the ASCII value of the character at + indicates the number of common characters
shared with the previous record (up to a maximum of 255). If + is 0 then
there is no compression. The first index record in a page is never compressed.
Compression introduces an overhead to the manipulation of data in the BTree
but shows definite advantages in very large trees where there is sufficient
commonality of index prefix to allow a reduction in the number of index
levels and hence access time. It also allows the programmer to provide
sensible keys to the data without worrying unneccessarily about the space
overhead |