fast, arbitrary implementation of compareTo for “uninteresting” components of a lexical order

Question

I want to store messages in a

ConcurrentSkipListSets> db,

so that I can query the messages by time slices