>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.
How deep do you expect the name tree to get? I rarely see anything more than four levels deep, and three times through the loop isn't a whole lot. R's, John _______________________________________________ DNSOP mailing list DNSOP@ietf.org https://www.ietf.org/mailman/listinfo/dnsop
