BIND - sorting of reverse domain.

[Kevin Darcy]

"D. Stussy" wrote:

> Older versions of BIND did not.  However, BIND-9 does - but someone else
> indicated that this is a side effect of its memory image of the data and not
> intentionally done.  If truly not intentional, that could moot my question.
>
> I do note that someone also indicated that BIND arranges the data in
> alphabetical/machine order so as to abort early with an NXDOMAIN error if it
> passes the point where the target query name would be.  Such a search is
> potentially an O(n/2) on the average - while a balanced binary tree search would
> be O(log2(n)) (and the worst case unbalanced tree - O(n/2)).  Except for n=1 or
> n=2, log2(n) < (n/2) for postive integers, so why choose a non-optimal search?
> [This goes beyond my original question/comment, so responses aren't necessary.]

BIND stores zone data in memory in a hashed structure which has little or no relationship to the format in which it writes out
zonefiles.


- Kevin