Storing a Sparse Table.
STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
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.
- Information Science
- Computer Programming and Software
- Computer Hardware