+612 9045 4394
 
CHECKOUT
File Organization and Processing - Alan L. Tharp

File Organization and Processing

Paperback Published: 18th January 1988
ISBN: 9780471605218
Number Of Pages: 416

Share This Book:

Paperback

$232.80
or 4 easy payments of $58.20 with Learn more
Ships in 5 to 9 business days

The many and powerful data structures for representing information physically (in contrast to a database management system that represents information with logical structures) are introduced by this book. Specialized data structures are covered, and there is an explanation of 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. The opening chapters cover sequential file organization, direct file organization, indexed sequential file organization, bits of information, secondary key retrieval, and bits and hashing. The 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. The book contains pseudocode, or an outline in English, for most algorithms as well as end-of-section questions (some with answers) and many illustrations.

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.

ISBN: 9780471605218
ISBN-10: 0471605212
Audience: General
Format: Paperback
Language: English
Number Of Pages: 416
Published: 18th January 1988
Country of Publication: US
Dimensions (cm): 23.42 x 19.25  x 2.44
Weight (kg): 0.72
Edition Number: 1