On Mon, Mar 14, 2016 at 08:12:24PM +0000, Ted Lemon <ted.le...@nominum.com> wrote a message of 7 lines which said:
> I have no idea how you would implement this efficiently with a > hashed cache: either you search every parent domain of a particular > name before answering to see if there's an NXDOMAIN higher in the > hierarchy, or else when you get an NXDOMAIN for a name you traverse > the entire hash table looking for subdomains. Neither of these can > be done efficiently. Personal curiosity: how could you implement DNSSEC with a cache where tree operations (such as finding the parent) are unbearably slow? _______________________________________________ DNSOP mailing list DNSOP@ietf.org https://www.ietf.org/mailman/listinfo/dnsop
