Algorithms and Data Structures for External Memory
From MaRDI portal
Publication:2903190
DOI10.1561/0400000014zbMath1244.68007WikidataQ60265177 ScholiaQ60265177MaRDI QIDQ2903190
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
68W40: Analysis of algorithms
68W05: Nonnumerical algorithms
68-02: Research exposition (monographs, survey articles) pertaining to computer science
68P05: Data structures
68P20: Information storage and retrieval of data
Related Items
Computing Weighted Strength and Applications to Partitioning, Better External Memory LCP Array Construction, Accounting for Factor Variables in Big Data Regression, Permuting and Batched Geometric Lower Bounds in the I/O Model, LCP Array Construction in External Memory, Unnamed Item, Locality-preserving oblivious RAM, Efficient computation of Lyapunov functions for Morse decompositions, Resilient dynamic programming, Cache-oblivious index for approximate string matching, Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies, iTri: index-based triangle listing in massive graphs, Analyzing clustering and partitioning problems in selected VLSI models, 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, Lightweight LCP construction for very large collections of strings, Clique Counting in MapReduce, Indexing for summary queries, Fault Tolerant External Memory Algorithms, Space-Efficient Frameworks for Top- k String Retrieval, I/O-Efficient Similarity Join, Mechanisms with Monitoring for Truthful RAM Allocation
