Trending Bestseller

Algorithms and Data Structures for External Memory

No reviews yet Write a Review
Paperback / softback
09 June 2008
$218.45
Ships in 3-5 business days

Delivery estimate

Hurry up! Current stock:
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.

You Can Find This Title In

    Product Details
    ISBN-13
    9781601981066
    Author
    Jeffrey Scott Vitter
    Publisher
    Now Publishers
    Published
    09 June 2008
    Format
    Paperback / softback

    This product hasn't received any reviews yet. Be the first to review this product!

    $218.45
    Ships in 3-5 business days

    Delivery estimate

    Hurry up! Current stock:

    Algorithms and Data Structures for External Memory

    $218.45

    Description

    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.

    You Can Find This Title In

      This Title Is Categorised As