Conclusions
•The natural data layout of simple
heap tables is ideal for event-type tables, naturally clustering
hot, recent rows together at the top – don’t mess with this
useful natural result! (Rebuilding heap tables with parallel
threads is one way to shuffle recent rows in among old
rows, with disastrous results to caching and performance!)