![]() |
Ryan Barrett |
Nov. 24, 2008
(also see the
article)
Similar to building:
n
pieces, each with
sharding parameter k
in [0, n)
note that each worker is still scanning over the entire tablet. however, this is relatively cheap compared to the multiple reads and writes required to build or delete the new index(es) for each entity. remember, disk bandwidth (ie large contiguous disk reads) are cheap, disk seeks are expensive!
k modulo n
sharding, which was added recentlyREAD_CONSISTENT
(see the tx isolation article),
but indices aren't, so the kind index might miss some entities.