Algorithms and data structures for external memory

DOI10.1561/0400000014MaRDI QIDQ2903190zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jeffrey Scott Vitter

Publication date 7 August 2012

Published in Foundations and Trends in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/8e41c395cccbef377361fe4dd0503954dafddfd8

zbMATH Keywords

data structuresexternal memoryI/O costs

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05) Information storage and retrieval of data (68P20) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Cited in

(46)

• The buffer tree: A technique for designing batched external data structures
• iTri: index-based triangle listing in massive graphs
• Analyzing clustering and partitioning problems in selected VLSI models
• Range partitioning within sublinear time in the external memory model
• Batched predecessor and sorting with size-priced information in external memory
• Fully persistent B-trees
• How to pack directed acyclic graphs into small blocks
• Engineering a lightweight external memory suffix array construction algorithm
• An exact approach to ridge regression for big data
• I/O-efficient similarity join
• Lightweight data indexing and compression in external memory
• Efficient computation of Lyapunov functions for Morse decompositions
• Lightweight LCP construction for very large collections of strings
• Clique counting in MapReduce: algorithms and experiments
• Indexing for summary queries, theory and practice
• Fault Tolerant External Memory Algorithms
• Space-efficient frameworks for top-k string retrieval
• Efficient Bundle Sorting
• I/O-efficient similarity join
• Mechanisms with monitoring for truthful RAM allocation
• scientific article; zbMATH DE number 1947384 (Why is no real title available?)
• scientific article; zbMATH DE number 2033275 (Why is no real title available?)
• scientific article; zbMATH DE number 1476487 (Why is no real title available?)
• scientific article; zbMATH DE number 1792106 (Why is no real title available?)
• scientific article; zbMATH DE number 1792107 (Why is no real title available?)
• Computing weighted strength and applications to partitioning
• Better external memory LCP array construction
• scientific article; zbMATH DE number 1875404 (Why is no real title available?)
• scientific article; zbMATH DE number 1424311 (Why is no real title available?)
• scientific article; zbMATH DE number 1424325 (Why is no real title available?)
• scientific article; zbMATH DE number 1445385 (Why is no real title available?)
• scientific article; zbMATH DE number 1445386 (Why is no real title available?)
• Accounting for factor variables in big data regression
• The buffer tree: A new technique for optimal I/O-algorithms
• Permuting and batched geometric lower bounds in the I/O model
• Resilient dynamic programming
• Practical batch-updatable external hashing with sorting
• LCP array construction in external memory
• scientific article; zbMATH DE number 5499319 (Why is no real title available?)
• Cache-oblivious index for approximate string matching
• Output-sensitive skyline algorithms in external memory
• Fully persistent B-trees
• Locality-preserving oblivious RAM
• Algorithm design for tensor units
• Competitive data-structure dynamization
• Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies

This page was built for publication: Algorithms and data structures for external memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2903190)