Vitter | Algorithms and Data Structures for External Memory | Buch | 978-1-60198-106-6 | www.sack.de

Buch, Englisch, Band 8, 180 Seiten, Format (B × H): 156 mm x 234 mm

Reihe: Foundations and Trends® in Theoretical Computer Science

Vitter

Algorithms and Data Structures for External Memory


1. Auflage 2008
ISBN: 978-1-60198-106-6
Verlag: Now Publishers

Buch, Englisch, Band 8, 180 Seiten, Format (B × H): 156 mm x 234 mm

Reihe: Foundations and Trends® in Theoretical Computer Science

ISBN: 978-1-60198-106-6
Verlag: Now Publishers

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.

Vitter Algorithms and Data Structures for External Memory jetzt bestellen!

Autoren/Hrsg.

Vitter, Jeffrey Scott

Weitere Infos & Material

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

Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.