Buy File Structures Book by Michael J. Folk - Bookswagon
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer programming / software engineering > Algorithms and data structures > File Structures
File Structures

File Structures


     0     
5
4
3
2
1



Available


X
About the Book

This book provides the conceptual tools to build file structures that can be quickly and efficiently accessed. It teaches good design judgement through an approach that puts the "hands-on" work of constructing and running programs at the center of the learning process. This best-selling book has been thoroughly updated. It includes timely coverage of file structures in a UNIX environement, in addition to a new and substantial appendix on CD-ROM. All former programs in C and Pascal have been updated to ANSI C and Turbo Pascal 6.0.

Table of Contents:
(All chapters, except Chapter 1, contain a Summary, Key Terms, Exercises and Further Readings.) Introduction to File Structures. The Heart of File Structure Design. A Short History of File Structure Design. A Conceptual Toolkit: File Structure Literacy. Summary. Key Terms. Fundamental File Processing Operations. Physical Files and Logical Files. Opening Files. Closing Files. Reading and Writing. Seeking. Special Characters in Files. The UNIX Directory Structure. Physical and Logical Files in UNIX. File-related Header Files. UNIX Filesystem Commands. Secondary Storage Devices and System Software. Disks. Magnetic Tape. Disk Versus Tape. Storage as a Hierarchy. A Journey of a Byte. Buffer Management. I/O in UNIX. Fundamental File Structure Concepts. Field and Record Organization. Record Access. More about Record Structures. File Access and File Organization. Beyond Record Structures. Portability and Standardization. C Programs. Pascal Programs. Organizing Files for Performance. Data Compression. Reclaiming Space in Files. Finding Things Quickly: An Introduction to Internal Sorting and Binary. Searching. Keysorting. Indexing. What Is an Index? A Simple Index with an Entry-Sequenced File. Basic Operations on an Indexed, Entry-Sequenced File. 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. Selective Indexes. Binding. Cosequential Processing and the Sorting Process 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 RAM. Merging as a Way of Sorting Large Files on Disk. Sorting Files on Tape. Sort-Merge Packages. Sorting and Cosequential Processing in UNIX. B-Trees and Other Tree-Structured File Organizations. Introduction: The Invention of the B-Tree. Statement of the Problem. Binary Search Trees as a Solution. AVL Trees. Paged Binary Trees. The Problem with the Top-down Construction of Paged Trees. B-Trees: Working up from the Bottom. Splitting and Promoting. Algorithms for B-Tree searching and Insertion. B-Tree Nomenclature. Formal definition of B-Tree Properties. Worst-case Search Depth. Deletion, Redistribution, and Concatenation. Redistribution During Insertion: A Way to Improve Storage Utilization. B+ Trees. Buffering of Pages: Virtual B-Trees. Placement of Information Associated with the Key. Variable-length Records and Keys. C Programs to Insert Keys into a B-Tree. Pascal Programs to Insert Keys into a B-Tree. The B+ Tree Family and Indexed Sequential File Access. 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, B+ Trees, and Simple Prefix B+ Trees in Perspective. Hashing. Introduction. 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. Making Deletions. Other Collision Resolution Techniques. Patterns of Record Access. Extendible Hashing. Introduction. How Extendible Hashing Works. Implementation. Deletion. Extendible Hashing Performance. Alternative Approaches. Appendix A. 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: String Functions in Pascal. Appendix D: Comparing Disk Drives. Bibliography. Index. 0201557134T04062001

About the Author :
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. 0201557134AB05172001


Best Sellers


Product Details
  • ISBN-13: 9780201557138
  • Publisher: Pearson Education (US)
  • Publisher Imprint: Pearson
  • Language: English
  • Weight: 1000 gr
  • ISBN-10: 0201557134
  • Publisher Date: 09 Jan 1992
  • Binding: Hardback
  • No of Pages: 590


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
File Structures
Pearson Education (US) -
File Structures
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

File Structures

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!