3 ms·

I'd be curious if matching 128 bit words is slower or more painful than variable-length string comparisons in any RDBMS. I would bet not. Plus, you can't do C

by dpifke 17y ago

I'd be curious if matching 128 bit words is slower or more painful than variable-length string comparisons in any RDBMS. I would bet not. Plus, you can't do CIDR operations on strings, making it a pain to i.e. match all addresses within a given /27.

audidude 17y ago
You will often have to do a page-fault for both, so loading wont be too much an issue. However, you have to get it into an integer to compare it to begin with. So the string method is purely overhead.
- tptacek 17y ago
  A page fault, because you touched a 4 byte word, a 16 byte string, or a 16 byte binary address? We're talking about data types that fit in a single L1 cache line.
- audidude 17y ago
  Something has to load it from disk into the cache line ..