• Understanding UniData hashed and dynamic files with resize and memresize

    If part of your job involves administering UniData, they you’re aware that the objective of file resizing is to minimize overflow as overflow is a performance overhead. Have you seen this blog post? It’s a great overview and best practices guide covering:

    • 32-bit v 64-bit dynamic hashed files
    • UniData static hashed files, dynamic hashed files, and group structure
    • Level 1 level 2 overflow
    • Benefits of the group structure
    • How do UniData dynamic hashed files work?
    • How does UniData decide which group is to be split?
    • How is the split pointer calculated?
    • What happens when a group is split?
    • How does UniData decide when a group is split?
    • Keyonly
    • Keydata
    • Wholefile
    • Default split type
    • Resize v memresize
    • Limitations of memresize
    • Worked example to demonstrate differences