로그인회원가입 장바구니마이페이지
kangcom
전체
Home >   >   > 

File Structures: An Object-Oriented Approach with C++

   
지은이 Bill Zoellick   |   출판사 Addison-Wesley Professional  |   발행일 년 월 일   |   언어 : 영어
 
클릭하시면 큰 도서이미지를 보실 수 있습니다.
판매가 39,000원38,200원 2%
마일리지 0% 0원
발행일 --
ISBN 0201874016 |  9780201874013
기타정보 원서 | 724쪽 | $ 92 | Hardcover
예상출고일
배송비 무료배송
   
프로그래밍언어
종합지수 1p 729 위
   
  위 도서(Original Edition)의 International Edition도서
File Structures : An Object-Oriented Approach with C++ (International Edition, Soft Cover)
Addison-Wesley Professional
 

이 책은 베스트셀러로 자리잡고 있는 "File Structures, Second Edition"을 기반으로 만들어 졌다. 이 책은 학생들과 전문가들이 이 책을 통해 파일 파일 스트럭처문제에 대한 적절하고도 지능적, 비용 효율적인 솔루션을 디자인하는데 필요한 기본 도구를 얻을 수 있도록 하기 위해 객체 지향 접근방법을 통해 파일 구조를 설명하고 있다. 파일 구조 디자인을 어플리케이션 개발에 중요한 요소로 결합해주는 소프트웨어와 하드웨어적 특성을 설명하는 것으로 시작하여 정보를 저장하고 추출할수 있도록 파일의 효율적 사용을 지원하는 도구의 취급을 설명해준다.
Chapter1. Introduction to the Design and Specification of File Structures
1.1 The Heart of File Structure Design
1.2 A Short History of File Structure Design
1.3 A Conceptual Toolki : File Structure Literacy
1.3 A Conceptual Toolkit : File Structure Literacy
1.4 An Object-Oriented Toolkit : Making File Structures Usable
1.5 Using Objects in C++

Chapter2. Fundamental File Processing Operations
2.1 Physical Files and Logical Files
2.2 Opening Files
2.3 Closing Files
2.4 Reading and Writing
2.5 Seeking
2.6 Special Characters in Files
2.7 The Unix Directory Structure
2.8 Physical Device and Logical Files
2.9 File-Related Header Files
2.10 Unix File System Commands

Chapter3. Secondary Storage and System Software
3.1 Disks
3.2 Magnetic Tape
3.3 Disk Versus Tape
3.4 Introduction to CD-ROM
3.5 Physical Organization of CD-ROM
3.6 CD-ROM Strengths and Weakness
3.7 Storage a Hierarchy
3.8 A Journey of a Byte
3.9 Buffer Management
3.10 I/O in Unix
 
Chapter4. Fundamental File Structure Conepts
4.1 Field and Record ORganization
4.2 Using Classes to Manipulate Buffers
4.3 Using Inheritance for Record Buffer Classes
4.4 Managing Eixed-Length, Fixed-Field Buffers
4.5 An Object-Oriented Class for Record Files

Chapter5. Managing Files of Records
5.1 Record Access
5.2 More about Record Structures
5.3 Encapsulating Record I/O Operations in a Single Class
5.4 File Access and File Organization
5.5 Beyond Record Structures
5.6 Portability and Standardization

Chapter6. Organizing Files for Performance
6.1 Data Compression
6.2 Reclaiming Space in Files
6.3 Finding Things Quickly : An Introduction to Internal Sorting and Binary Searching
6.4 Keysorting

Chapter7. Indexing
7.1 What Is and Index
7.2 A Simple Index for Entry-Sequenced Files
7.3 Using Template Classes in C++ for Object I/O
7.4 Object-Oriented Support for Indexed, Entry-Sequenced Files of Data Objects
7.5 Indexes That Are Too Large to Hold in Memory
7.6 Indexing to Provide Access by Multiple keys
7.7 Retrieval Using Combinations of Secondary Keys
7.8 Improving the Secondary Index Structure : Inverted Lists
7.9 Selective Indexes
7.10 Binding
 
Chapter8. Cosequential Processing and the Sorting of Large Files
8.1 An Object-Oriented Model for Implementing Cosequential Process
8.2 Application of the Model to a General Ledfer Program
8.3 Extension of the Model to Include Multiway Merging
8.4 A Second Look at Sorting in Memory
8.5 Merging as a Way of Sorting LArge Files on Disk
8.6 Sorting Files on Tape
8.7 Sort-Merge PAckages
8.8 Sorting and Cosequential Processing in Unix
 

Chapter9. Multilevel Indexing and B-Trees
9.1 Introduction : The Invention of the B-Tree
9.2 Statement of the Problem
9.3 Indexing with Binary Search Trees
9.4 Multilevel Indexing, a Better Approach to Tree Indexes
9.5 B-trees : Working up from the Botton
9.6 Example of Creating a B-Tree
9.7 An Object-Oriented Representation of B-Trees
9.8 B-Tree Methods Search, Insert, and Others
9.9 B-Tree Nomenclature
9.10 Formal Definition of B-Tree Properties
9.11 Worst-Case Serch Depth
9.12 Deletion, Merging, and Redistribution
9.13 Redistribution Dring Insertion : A Way to Improve Storage Utilization
9.14 B*Trees
9.15 Buffering of Pages : Virtual B-Trees
9.16 Variable-Length Records and Keys
 
Chapter10. Indexed Sequential File Access and Prefix B+ Trees
10.1 Indexed Sequential Access
10.2 Maintaining a Sequence Set
10.3 Adding a Simple Index to the Sequence Set
10.4 The Content of the Index : Separators Instead of Keys
10.5 The Simple Prefix B+ Tree
10.6 Simple Prefix B+ Tree Maintenance
10.7 Index Set Block Size
10.8 Internal Structure of Index Set Blocks : A Variable- Order B-Tree
10.9 Loading a Simple Prefix B+ Tree
10.10 B+ Trees
10.11 B-Trees, B+ Trees, and Simple Prefix B+ Trees in Perspective
 
Chapter11. Hashing
11.1 Introduction
11.2 A Simple HAshing Algorithm
11.3 Hashing Functions and Record Distributions
11.4 How Much Extra Memory Should Be Used?
11.5 Collision Resolution by Progressive Overflow
11.6 Storing More Than One Record per Address : Buckets
11.7 MAking Deletions
11.8 Other Collision Resolution Techniques
11.9 Patterns of Record Access
 
Chapter12. Extendible HAshing
12.1 Introduction
12.2 How Extendible Hashing Works
12.3 Implementation
12.4 Deletion
12.5 Extendible Hashing Performance
12.6 Alternative Approaches

Appendix A. Designing File Structures for CD-ROM
Appendix B. ASCII Table
Appendix C. Formatted Output with C++ Stream Classes
Appendix D. Simple File Input/Output Examples
Appendix E. Classes for Buffer Manipulation
Appendix F. A Class Hiearchy for Buffer Input/Output
Appendix G. Single Level Indexing of Records by Key
Appendix H. Cosequential Processing
Appendix I. Multi-level Indexing with B-Trees
Appendix J. Extendivle Hashing

 
Michael J. Folk manages the Scientific Data Technologies Group at the National Center for Supercomputing Applications at the University of Illinois in Urbana. He has been responsible for developing a general purpose scientific data file format called HDF and software for managing data in high-performance, high-volume computing environments. Prior to his work at Illinois, Dr. Folk was a professor of computer science for fifteen years at Oklahoma State and Drake Universities.


Bill Zoellick is currently a partner in and founder of Fastwater LLP, a consultancy focusing on helping companies build effective web businesses. He frequently writes about the issues addressed in Web Engagement and speaks on them at user conferences such as Seybold and Internet World and at various user associations and seminars. He has been a software developer, business owner, executive in a $100 million software company, and, most recently, a management consultant and business analyst.


Greg Riccardi is a professor of computer science at Florida State University and an associate of the Supercomputer Computations Research Institute. Professor Riccardiis research interests include scientific databases, object-oriented databases, and parallel computation. He is also affiliated with the Thomas Jefferson National Accelerator Facility where he works on the acquisition, management, and analysis of data for experimental physics. He received a University Teaching Award in 1997 from Florida State University.

등록된 서평이 없습니다.
John Thomp...
Hannah Hig...
Mayank Kej...
 
전체평균(0)
회원평점   회원서평수 0
Addison-Wesley Professional 출판사의 신간
Python Essential Reference
David Beazley 저
58,700원
(16%↓+1%)
 
Better Code: Goals for Software Developers
Sean Parent 저
42,300원
(16%↓+1%)
 
The C++ Programming Language (Hardcover)
Bjarne Stroustrup 저
99,900원
(16%↓+1%)
 
Advanced Programming in the Unix Environment
W. Richard Stevens 저
88,100원
(10%↓+1%)
 
Software Architecture in Practice
Paul Clements 저
94,000원
(16%↓+1%)
 
이메일주소수집거부