Many hyperlinks are disabled.
Use anonymous login to enable hyperlinks.
1 check-in using file src/btree.c version f1b4d64c
|04:38||Experiment using linear interpolation, instead of a strict binary search, when looking for integer-keyed rows on a single b-tree page. The experiment was not successful. The number of key comparisons is reduced by about 15%, but the added complexity of the search logic causes an overall reduction in performance. The patch is saved for historical reference only. Closed-Leaf check-in: c705cf85 user: drh tags: linear-interpolation|