File Structures: An Object-Oriented Approach with C++ / Edition 3by Michael J. Folk
Pub. Date: 12/16/1997
Based on the bestselling File Structures, Second Edition, this book takes an object-oriented approach to the study of file structures. It allows students and professionals to acquire the fundamental tools needed to design intelligent, cost-effective, and appropriate solutions to file structure problems. The book begins by presenting the software and hardware/b>
Based on the bestselling File Structures, Second Edition, this book takes an object-oriented approach to the study of file structures. It allows students and professionals to acquire the fundamental tools needed to design intelligent, cost-effective, and appropriate solutions to file structure problems. The book begins by presenting the software and hardware characteristics that combine to make file structure design important to application development. It continues with a thorough treatment of the tools that support effective use of files for storing and retrieving information.
This book teaches design by putting the hands-on work of constructing and running programs at the center of the learning process. By following the many programming examples included in the book and in the exercise sets, readers will gain a significant understanding of object-oriented techniques and will see how C++ can be an effective software development tool. HIGHLIGHTS
- Presents file structures techniques, including direct access I/O, buffer packing and unpacking, indexing, cosequential processing, B-trees, and external hashing.
- Includes extensive coverage of secondary storage devices, including disk, tape, and CD-ROM.
- Covers the practice of object-oriented design and programming with complete implementations in C++. Every line of code in the book has been tested on a variety of C++ systems and is available on the Internet.
- Develops a collection of C++ classes that provide a framework for solving file structure problems.
- Includes class definitions, sample applications and programming problems and exercises, making this book a valuable learning and referencetool.
** Instructor's materials are available from your sales rep. If you do not know your local sales representative, please call 1-800-552-2499 for assistance, or use the Addison Wesley Longman rep-locator at
- Publication date:
- Product dimensions:
- 6.73(w) x 9.55(h) x 1.25(d)
Table of Contents
INTRODUCTION TO FILE STRUCTURES.
The Heart of File Structure Design.
A Short History of File Structure Design.
A Conceptual Toolkit: File Structure Literacy.
Object-Oriented Programming in C++.
FUNDAMENTAL FILE PROCESSING OPERATIONS.
Physical Files and Logical Files.
Reading and Writing.
Special Characters in Files.
The UNIX Directory Structure.
Physical and Logical Files in UNIX.
File-related Header Files.
UNIX File System Commands.
SECONDARY STORAGE AND SYSTEM SOFTWARE.
Disk versus Tape.
Storage as a Hierarchy.
A Journey of a Byte.
I/O in UNIX.
FUNDAMENTAL FILE STRUCTURE CONCEPTS.
Field and Record Organization.
Using Classes to Manipulate Buffers.
Using Inheritance for Record Buffer Classes.
Managing Fixed Length, Fixed Field Buffers.
An Object-Oriented Class for Record Files.
MANAGING FILES OF RECORDS.
More about Record Structures.
Encapsulating Record Operations in a Single Class.
File Access and File Organization.
Object-Oriented Approach to File Access.
Portability and Standardization.
ORGANIZING FILES FOR PERFORMANCE.
Reclaiming Space in Files.
Finding Things Quickly: An Introduction to Internal Sorting and Binary Searching.
What Is an Index?
A Simple Index for Entry-Sequenced File.
Template Classes in C++.
Object-Oriented support for Indexed, Entry-Sequenced Files of Data Objects.
Indexes That Are Too Large to Hold in Memory.
Indexing to Provide Access by Multiple Keys.
Retrieval Using Combinations of Secondary Keys.
Improving the Secondary Index Structure: Inverted Lists.
COSEQUENTIAL PROCESSING AND THE SORTING OF LARGE FILES.
A Model for Implementing Cosequential Processes.
Application of the Model to a General Ledger Program.
Extension of the Model to Include Multiway Merging.
A Second Look at Sorting in Memory.
Merging as a Way of Sorting Large Files on Disk.
Sorting Files on Tape.
Sorting and Cosequential Processing in UNIX.
MULTI-LEVEL INDEXING AND B-TREES.
Introduction: The Invention of the B-Tree.
Statement of the Problem.
Binary Search Trees are not a Solution.
Multi-level Indexing, A Better Approach to Tree Indexes.
B-Trees: Working up from the Bottom.
Example of Creating a B-Tree.
An Object-Oriented Representation of B-Trees.
B-Tree MEthods Search, Insert, and Others.
Formal Definition of B-Tree Properties.
Worst-case Search Depth.
Deletion, Merging, and Redistribution.
Redistribution during Insertion: A Way to Improve Storage Utilization.
Buffering of Pages: Virtual B-Trees.
Variable-length Records and Keys.
INDEXED SEQUENTIAL FILE ACCESS AND PREFIX B+ TREES.
Indexed Sequential Access.
Maintaining a Sequence Set.
Adding a Simple Index to the Sequence Set.
The Content of the Index: Separators Instead of Keys.
The Simple Prefix B+ Tree.
Simple Prefix B+ Tree Maintenance.
Index Set Block Size.
Internal Structure of Index Set Blocks: A Variable-order B-Tree.
Loading a Simple Prefix B+ Tree.
B-Trees, B+ Trees, and Simple Prefix B+ Trees in Perspective.
A Simple Hashing Algorithm.
Hashing Functions and Record Distributions.
How Much Extra Memory Should Be Used?
Collision Resolution by Progressive Overflow.
Storing More Than One Record per Address: Buckets.
Other Collision Resolution Techniques.
Patterns of Record Access.
How Extendible Hashing Works.
Extendible Hashing Performance.
APPENDIX A. FILE STRUCTURES ON CD-ROM.
Using this Appendix.
Introduction to CD-ROM.
Physical Organization of CD-ROM.
CD-ROM Strengths and Weaknesses.
Tree Structures on CD-ROM.
Hashed Files on CD-ROM.
The CD-ROM File System.
APPENDIX B. ASCII TABLE.
APPENDIX C. SIMPLE FILE INPUT/OUTPUT EXAMPLES.
List.c. C program to read and display the contents of a file.
List.cpp. C++ program to read and display the contents of a file.
Person.h. Definition for class Person, including code for constructor.
Writestr.cpp. Write Person objects into a stream file Readdel.cpp. Read Person objects with fields delimited by ".
Readvar.cpp. Read variable length records and break up into Person objects.
Writeper.cpp. Function to write a person to a text file.
Readper.cpp. Function to prompt user and read fields of a Person.
APPENDIX D. CLASSES FOR BUFFER MANIPULATION.
Person.h. Definition for class Person.
Person.cpp. Code for class Person.
Deltext.h. Definition for class DelimitedTextBuffer.
Deltext.cpp. Code for class DelimitedTextBuffer.
Lentext.h. Definition for class LengthTextBuffer.
Lentext.cpp. Code for class LengthTextBuffer.
Fixtext.h. Definition for class FixedTextBuffer.
Fixtext.cpp. Code for class FixedTextBuffer.
Test.cpp. Test program for all buffer classes.
APPENDIX E. A CLASS HIERARCHY FOR BUFFER INPUT/OUTPUT.
Person.h. Definition for class Person.
Person.cpp. Code for class Person.
Iobuffer.h. Definition for class IOBuffer.
Iobuffer.cpp. Code for class IOBuffer.
Varlen.h. Definition for class VariableLengthBuffer.
Varlen.cpp. Code for class VariableLengthBuffer.
Delim.h. Definition for class DelimFieldBuffer.
Delim.cpp. Code for class DelimFieldBuffer.
Length.h. Definition for class LengthFieldBuffer.
Length.cpp. Code for class LengthFieldBuffer.
Fixlen.h. Definition for class FixedLengthBuffer.
Fixlen.cpp. Code for class FixedLengthBuffer.
Fixfld.h. Definition for class FixedFieldBuffer.
Fixfld.cpp. Code for class FixedFieldBuffer.
Buffile.h. Definition for class BufferFile.
Buffile.cpp. Code for class BufferFile.
Recfile.h. Template class RecordFile.
Test.cpp. Test program for buffer classes and RecordFile including template function.
APPENDIX F. SIMPLE INDEXING AND TEMPLATE CLASSES.
APPENDIX G. MULTI-LEVEL INDEXING: B+ TREE CLASSES.
APPENDIX H. CLASSES TO SUPPORT HASHING. 0201874016T04062001
and post it to your social network
Most Helpful Customer Reviews
See all customer reviews >