From the Publisher:
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.
Cited By
- Martin B and Eklund P Custom asymmetric page split generalized index search trees and formal concept analysis Proceedings of the 5th international conference on Formal concept analysis, (82-97)
- Martin B and Eklund P Asymmetric page split generalized index search trees for formal concept analysis Proceedings of the 16th international conference on Foundations of Intelligent Systems, (218-227)
- Martin B and Eklund P Spatial indexing for scalability in FCA Proceedings of the 4th international conference on Formal Concept Analysis, (205-220)
- Kollios G and Tsotras V (2002). Hashing Methods for Temporal Data, IEEE Transactions on Knowledge and Data Engineering, 14:4, (902-919), Online publication date: 1-Jul-2002.
- Nascimento M and Chitkara V Color-based image retrieval using binary signatures Proceedings of the 2002 ACM symposium on Applied computing, (687-692)
- Belussi A, Bertino E and Catania B (2002). Using spatial data access structures for filtering nearest neighbor queries, Data & Knowledge Engineering, 40:1, (1-31), Online publication date: 1-Jan-2002.
- Preslan K, Barry A, Brassow J, Declerck M, Lewis A, Manthei A, Marzinski B, Nygaard E, Van Oort S, Teigland D, Tilstra M, Whitehouse S and O'Keefe M Scalability and failure recovery in a linux cluster file system Proceedings of the 4th annual Linux Showcase & Conference - Volume 4, (10-10)
- Page C Astronomical Tables, 2-D Indexing, and Fuzzy-joins Proceedings of the Eighth International Conference on Scientific and Statistical Database Management, (44-52)
- Jannink J (2019). Implementing deletion in B+-trees, ACM SIGMOD Record, 24:1, (33-38), Online publication date: 1-Mar-1995.
- Aref W and Samet H Hashing by proximity to process duplicates in spatial databases Proceedings of the third international conference on Information and knowledge management, (347-354)
Recommendations
A multiple-file write scheme for improving write performance of small files in Fast File System
Fast File System (FFS) stores files to disk in separate disk writes, each of which incurs a disk positioning (seek + rotation) limiting the write performance for small files. We propose a new scheme called co-writing to accelerate small file writes in ...