External memory algorithms and data structures: Dealing with massive data

JS Vitter - ACM Computing surveys (CsUR), 2001 - dl.acm.org
Data sets in large applications are often too massive to fit completely inside the computers
internal memory. The resulting input/output communication (or I/O) between fast internal …

[图书][B] Algorithms and data structures: The basic toolbox

K Mehlhorn, P Sanders, P Sanders - 2008 - Springer
Algorithms are at the heart of every nontrivial computer application, and algorithmics is a
modern and active area of computer science. Every computer scientist and every …

[图书][B] Algorithms and theory of computation handbook, volume 2: special topics and techniques

MJ Atallah, M Blanton - 2009 - books.google.com
This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

[图书][B] Heuristic search: theory and applications

S Edelkamp, S Schrödl - 2011 - books.google.com
Search has been vital to artificial intelligence from the very beginning as a core technique in
problem solving. The authors present a thorough overview of heuristic search with a balance …

Route planning and map inference with global positioning traces

S Edelkamp, S Schrödl - … Science in Perspective: Essays Dedicated to …, 2003 - Springer
Navigation systems assist almost any kind of motion in the physical world including sailing,
flying, hiking, driving and cycling. On the other hand, traces supplied by global positioning …

Algorithms and data structures for external memory

JS Vitter - … and Trends® in Theoretical Computer Science, 2008 - nowpublishers.com
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 …

Multithreaded asynchronous graph traversal for in-memory and semi-external memory

R Pearce, M Gokhale, NM Amato - SC'10: Proceedings of the …, 2010 - ieeexplore.ieee.org
Processing large graphs is becoming increasingly important for many domains such as
social networks, bioinformatics, etc. Unfortunately, many algorithms and implementations do …

[图书][B] Sequential and Parallel Algorithms and Data Structures

viii Preface reason for this change is that sequential processors have ceased to get
proportional performance improvements from increased circuit complexity. Although the …

STXXL: standard template library for XXL data sets

R Dementiev, L Kettner… - Software: Practice and …, 2008 - Wiley Online Library
We present the software library Stxxl that is an implementation of the C++ standard template
library (STL) for processing huge data sets that can fit only on hard disks. It supports parallel …

Is-label: an independent-set based labeling scheme for point-to-point distance querying on large graphs

AWC Fu, H Wu, J Cheng, S Chu… - arXiv preprint arXiv …, 2012 - arxiv.org
We study the problem of computing shortest path or distance between two query vertices in
a graph, which has numerous important applications. Quite a number of indexes have been …