File Organization and Processing

by Alan L. Tharp

Introduces the many and powerful data structures for representing information physically (in contrast to a database management system that represents information with logical structures). 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. Contains pseudocode, or an outline in English, for most algorithms. Includes end-of-section questions, with answers to some. Extensively illustrated.

Genres: Computer Science

Paperback

First published January 18, 1988

Reviews

[Steve · Rating 3 out of 5]

One of the few really in-depth books on building on-disk data structures (also called File Structures). Detailed analysis of techniques for writing b-trees (+/#), hashtables, binary trees, etc.

[Kgb]

good, very good book !

[Sirbon · Rating 5 out of 5]

Great Book

[Abisoye]

COmputer science must read for Nigerians

[Mustafa]

good book

[Gustavo Farias]

aaaaa

[Tanmay Badhe · Rating 4 out of 5]

nice

[Min Lee · Rating 5 out of 5]

how to read this book

[Kerem Parlakgumus · Rating 5 out of 5]

ITS A GREAT BOOK