File Organization and Processing (Paperback)

Alan L. Tharp

ISBN 10: 0471605212 / ISBN 13: 9780471605218

Verlag: John Wiley & Sons Inc, New York, 1988

Beschreibung

Paperback. 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. 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Bestandsnummer des Verkäufers 9780471605218

Bibliografische Details

Titel: File Organization and Processing (Paperback)

Verlag: John Wiley & Sons Inc, New York

Erscheinungsdatum: 1988

Einband: Paperback

Zustand: new

Auflage: 1. Auflage

Über diesen Titel

Inhaltsangabe:

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.

Reseña del editor:

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.