A compact data structure for representing a dynamic multiset

Authors:
Jyrki Katajainen;S. Srinivasa Rao
Affiliations:
Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen East, Denmark;School of Computer Science and Engineering, Seoul National University, 599 Gwanakro, Gwanak-Gu, Seoul 151-744, Republic of Korea
Venue:
Information Processing Letters
Year:
2010

Citing 8
Cited 1

Implicit Data Structures for the Dictionary Problem

Journal of the ACM (JACM)
An Efficient Quasidictionary

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Maintaining Discrete Probability Distributions Optimally

ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Sorting and Searching on the Word RAM

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
A new representation for linear lists

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Algorithm Design: Foundations, Analysis and Internet Examples

Algorithm Design: Foundations, Analysis and Internet Examples
Optimal cache-oblivious implicit dictionaries

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Succinct dynamic dictionaries and trees

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Improved address-calculation coding of integer arrays

SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval

Quantified Score

Hi-index	0.89

Visualization

Abstract

We develop a data structure for maintaining a dynamic multiset that uses O(nlglgn/lgn) bits and O(1) words, in addition to the space required by the n elements stored, supports searches in O(lgn) worst-case time and updates in O(lgn) amortized time. Compared to earlier data structures, we improve the space requirements from O(n) bits to O(nlglgn/lgn) bits, but the running time of updates is amortized, not worst-case.