Accession Number:

ADA065284

Title:

Storing a Sparse Table.

Descriptive Note:

Technical rept.,

Corporate Author:

STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE

Personal Author(s):

Report Date:

1978-11-01

Pagination or Media Count:

25.0

Abstract:

In this paper, we examine two good worst-case methods of storing sparse tables. For the dynamic case, a trie data structure requires Okn storage while allowing Olog sub k Nn access time, where k is a parameter whose value is chosen in advance. The method supports table deletions as well as insertions. A more sophisticated method is presented which handles the static case.

Subject Categories:

  • Information Science
  • Computer Programming and Software
  • Computer Hardware

Distribution Statement:

APPROVED FOR PUBLIC RELEASE