Advertisement

Sets Over a Small Universe

  • James A. Storer

Abstract

So far, when looking at implementations of generic operations like MEMBER, INSERT, and DELETE, we have been assuming that the set of all possible elements (the ‘universe’) is much larger than the actual number of elements that will be stored. In fact, typically, the space of all possible items (e.g., names represented by strings of 25 characters) is larger than can possibly be stored.

Keywords

Tree Implementation Recursive Call Count Field Array Initialization Empty Queue 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© J.A. Storer 2002

Authors and Affiliations

  • James A. Storer
    • 1
  1. 1.Department of Computer ScienceBrandeis UniversityWalthamUSA

Personalised recommendations