Transposition of large tabular data structures with applications to physical database organization

SummaryWith the use of results in Part I, the organization of physical data structures of relational databases, together with their manipulative aspects, are discussed. The approach is based on the V-storage organization of Part I. Resulting gain and drawbacks are reviewed; in particular, exclusion of inverted files that usually meet only the static retrieval systems raises the problem of effective compensation for speed losses in V-storage search. To resolve this problem, use can be made of (1) order-preserving internal codes so that the data space on which to operate is efficiently compacted, and/or (2) the special page-prefetching algorithm that considers the sequentiality of data search in relational operations. The effect of this page-prefetching policy is demonstrated by computer simulation. Finally, applications of the transposition algorithm of Part I to file inversions are discussed.