Data Representation (cont.)

Slide Index < Previous Next >

Slide 9 of 12

Data Representation (cont.)

An S-step requires that we set the first 1 in the current sequence’s bit slice to 0, and all bits afterward to 1, to indicate that the new item can only come in a transaction after the last transaction in the current sequence.
This operation is implemented efficiently via a bitmap lookup table.

Decorative Image

Slide Links:

Slide Comments:

Text-Only Version Text-Mostly Version Graphic Version