Database Reference
In-Depth Information
AND "remaining" >= 'ssa'
AND "remaining" < 'ssb';
Again, we construct the upper bound for the range slice by simply replacing the last char-
acter of the input with the following character in the alphabet, giving us the right lexical
upper bound. Now we've narrowed our results to a single hashtag:
While compound primary keys are an intuitively good fit storing timestamped data parti-
tioned into logical groups, with a little creativity the data structure can be applied to a
wide range of other problems. The autocomplete implementation we built here might not
be the simplest one you've run across, but it can efficiently store and autocomplete billions
of hashtags, which isn't anything to sneeze at!
