《Algorithms and Data Structures for External Memory》PDF电子书下载
《Algorithms and Data Structures for External Memory》内容简介
Jeffrey Scott Vitter / Now Publishers Inc / 2008-6-9 / USD 99.00 -
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 and parallelism 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.
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 and parallelism 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.
同类热门电子书下载更多
- 机器学习基础教程
- 程序设计中实用的数据结构
- TopCoder Cookbook
- The Algorithm Design Manual
- The Design of Approximation Algorithms
- ACM程序设计竞赛基础教程
- 程序设计中常用的解题策略
- Information Theory, Inference and Learning Algorithms
- C数值算法
- 计算机算法设计与分析
- 人工智能
- 计算机图形学几何工具算法详解
- 漫画算法2：小灰的算法进阶
- 改变未来的九大算法
- 人工智能 （第2版）
- Algorithms Illuminated
- 计算机视觉
- 人工智能
- Introduction to Algorithms (4/e)
- 技术之瞳——阿里巴巴技术笔试心得