FILE ORGANIZATION AND PROCESSING (HB 1988)

This book introduces the many and powerful data structures for representing information physically (in contrast to a database management system that represents information with logical structures). It covers specialized data structures, and explains how to choose the appropriate algorithm or data structure for the job at hand. The four sections treat primary file organizations, bit level and related structures, tree structures, and file sorting. Opening chapters cover sequential file organization, direct file organization, indexed sequential file organization, bits of information, secondary key retrieval, and bits and hashing. Following chapters cover binary tree structures, B-trees and derivatives, hashing techniques for expandable files, other tree structures, more on secondary key retrieval, sorting, and applying file structures. It contains pseudocode, or an outline in English, for most algorithms. Table Of Introduction PRIMARY FILE ORGANIZATIONS ?Sequential File Organization ?Direct File Organization ?Indexed Sequential File Organization BIT LEVEL AND RELATED STRUCTURES ?Bits of Information ?Secondary Key Retrieval ?Bits and Hashing TREE STRUCTURES ?Binary Tree Structures ?B-Trees and Derivatives ?Hashing Techniques for Expandable Files ?Other Tree Structures ?Secondary Key Retrieval Revisited FILE SORTING ?Sorting ?Applying File Structures Special ?Advanced Undergraduate and Graduate Students in Computer Science