Well I'm sure that plain DNS look up responses are faster but I have been tought... | Hacker News

Hacker News new | past | comments | ask | show | jobs | submit

login

leni536 on Jan 16, 2015 | parent | context | favorite | on: Against DNSSEC

Well I'm sure that plain DNS look up responses are faster but I have been tought that that the difference between O(1) and O(log N) is really just theoretical and in practice the constant factor is typically more important. log N grows really slowly in the function of N.

geocar on Jan 16, 2015 [–]

O-notation lacks utility. It isn't sufficient for a thorough analysis of the space/time complexity of algorithms, and profiling is much easier anyway.

In this case: The constant coefficient in a DNS lookup is very small, whilst the constant coefficients in a DNSSEC response are very big.

Consider applying for YC's Spring batch! Applications are open till Feb 11.
Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact