Eager versus lazy swizzling
Moss and Eliot (1990) define eager swizzling as the swizzling of all OIDs for persistent
objects on all data pages used by the application before any object can be accessed. This
is rather extreme, whereas Kemper and Kossman (1993) provide a more relaxed definition,
restricting the swizzling to all persistent OIDs within the object the application wishes to
access. Lazy swizzling swizzles pointers only as they are accessed or discovered. Lazy
swizzling involves less overhead when an object is faulted into memory, but it does mean
that two different types of pointer must be handled for every object access: a swizzled
pointer and an unswizzled pointer.