e-book

Algorithms and Data Structures for External Memory

---

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.

---

Ketersediaan

Tidak ada salinan data

Informasi Detail

Judul Seri

-

No. Panggil

-

Penerbit

Boston : now Publishers Inc.., 2008

Deskripsi Fisik

xiv, 174 Hlm.

Bahasa

English

ISBN/ISSN

978-1-60198-106-6

Klasifikasi

-

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

-

Subjek

MATEMATIKA

Info Detail Spesifik

-

Pernyataan Tanggungjawab

agus

Versi lain/terkait

Lampiran Berkas

Komentar

---

Anda harus masuk sebelum memberikan komentar