Algorithms and Data Structures for External Memory
نام عام مواد
[Book]
نام نخستين پديدآور
Jeffrey Scott Vitter
وضعیت نشر و پخش و غیره
نام ناشر، پخش کننده و غيره
now
تاریخ نشرو بخش و غیره
2008
مشخصات ظاهری
نام خاص و کميت اثر
180
یادداشتهای مربوط به مندرجات
متن يادداشت
1: Introduction 2: Parallel Disk Model (PDM) 3: Fundamental I/O Operations and Bounds 4: Exploiting Locality and Load Balancing 5: External Sorting and Related Problems 6: Lower Bounds and I/O 7: Matrix and Grid Computations 8: Batched Problems in Computational Geometry 9: Batched Problems on Graphs 10: External Hashing for Online Dictionary Search 11: Multiway Tree Data Structures 12: Spatial Data Structures and Range Search 13: Dynamic and Kinetic Data Structures 14: String Processing 15: Compressed Data Structures 16: Dynamic Memory Allocation 17: External Memory Programming Environments. Conclusions. Notations and Acronyms. References
یادداشتهای مربوط به خلاصه یا چکیده
متن يادداشت
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast internal memory and slower external memory (such as disks) can be a major performance bottleneck. Algorithms and Data Structures for External Memory surveys the state of the art in the design and analysis of external memory (or EM) algorithms and data structures, where the goal is to exploit locality in order to reduce the I/O costs. A variety of EM paradigms are considered for solving batched and online problems efficiently in external memory. Algorithms and Data Structures for External Memory describes several useful paradigms for the design and implementation of efficient EM algorithms and data structures. The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, databases, geographic information systems, and text and string processing. Algorithms and Data Structures for External Memory is an invaluable reference for anybody interested in, or conducting research in the design, analysis, and implementation of algorithms and data structures.
رده بندی کنگره
شماره رده
QA76
.
9
.
D35
نشانه اثر
J444
2008
نام شخص به منزله سر شناسه - (مسئولیت معنوی درجه اول )