| Next | Lightweight Databases | 26 |
search3.pl works for any value of $/
It's similar to the innards of Search::Dict
It uses binary search only to locate the block that contains the target
Then it does linear search on the block
It's about 75% slower than search1.pl
Also, it might fail if any of the records are longer than a disk block
The code is at the back of your book
| Next | |
Copyright © 2003 M. J. Dominus |