The Benefits of Context in Processing Sets.

Abstract

The problem of finding unions and intersections of sets in an efficient manner pervades many areas of computer science. A profusion of examples can be found in both business and scientific computer applications. This paper discusses the importance of tailoring the algorithm to be employed to the intended application. A simple union and intersection algorithm is analyzed in detail, and the results of this analysis are compared to several similar analyses published by other researchers. It is shown that some relatively small changes in the nature of the problem conditions and/or the algorithm can lead to significant changes in the expected amount of work required to accomplish the desired task. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1977
Accession Number
ADA037822

Entities

People

  • Gerald A. Wilson

Organizations

  • United States Naval Research Laboratory

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Artificial Intelligence
  • Computer Programming
  • Computer Science
  • Computers
  • Data Management
  • Databases
  • Language
  • Military Research
  • New York
  • Preprocessing
  • Probability
  • Probability Density Functions
  • Side Effects

Fields of Study

  • Computer science

Readers

  • Approximation Theory.
  • Organizational Process Management (OPM).
  • Systems Analysis and Design