Database Design
	• HEAP Tables – Stored in memory • They will vanish at server shutdown – Very fast hash-based lookups • Limited index use • Range queries are slower – B-Tree available in 4.1 – Table locking – Great for static lookups – Size can be limited to prevent disaster
			Copyright 2003, Jeremy Zawodny