Algorithms for Processing Large-Scale Data

Abstract

The PI and coauthors have developed the first known algorithms for sorting, problems in computational geometry, graph problems, and different forms of range searching that are simultaneously optimal in terms of storage space usage and I/O performance. The PI has worked on how to implement these algorithms in practice using a powerful I/O programming environment called TPIE. The working group discussed the strategic directions and challenges in the management and use of ---storage systems--those components of computer systems responsible for the storage and retrieval of data. The performance gap between main and secondary memories shows no of vanishing, and thus continuing research into storage I/O will be essential to reap the full benefit from the advances occurring in many other areas of computer science. We identified a few strategic research goals and possible thrusts to meet those goals.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 25, 1997
Accession Number
ADA332577

Entities

People

  • Jeffrey S. Vitter

Organizations

  • Duke University

Tags

Communities of Interest

  • Air Platforms
  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programming
  • Computer Science
  • Computers
  • Databases
  • Geographic Information Systems
  • Geometry
  • Information Systems
  • Parallel Computing
  • Parallel Processors
  • Standards
  • Three Dimensional
  • Trees (Data Structures)
  • Two Dimensional

Fields of Study

  • Computer science

Readers

  • Parallel and Distributed Computing.
  • Systems Analysis and Design

Technology Areas

  • Space