Re:When Big O Fools You
by malisper on Tuesday August 23, 2016 @03:05PM
(#12346522)
This advice applies a ton to databases. At my job, our application is heavily disk i/o bound, with a database query typically taking several seconds. I benchmarked how different sorting the rows in our db by time would be compared to our current layout (partially sorted by user, partially sorted by time, which was completely accidental). Sorting by time benchmarked ~10x faster, which is absolutely huge.
[ Parent
| on HN ]
Re:When Big O Fools You
by qwertyuiop924 on Tuesday August 23, 2016 @03:50PM
(#12346915)
Yeah, heavy data access is where this matters.