论文信息 - A compact data structure for representing a dynamic multiset

A compact data structure for representing a dynamic multiset

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.

S. Srinivasa Rao | Jyrki Katajainen

[1] Rajeev Raman,et al. An Efficient Quasidictionary , 2002, SWAT.

[2] Rajeev Raman,et al. Succinct Dynamic Dictionaries and Trees , 2003, ICALP.

[3] Greg N. Frederickson,et al. Implicit Data Structures for the Dictionary Problem , 1983, JACM.

[4] Kurt Mehlhorn,et al. Maintaining Discrete Probability Distributions Optimally , 1993, ICALP.

[5] Torben Hagerup,et al. Sorting and Searching on the Word RAM , 1998, STACS.

[6] Pavol Návrat. Review of "Algorithm design: foundations, analysis and internet examples" by Michael T. Goodrich and Roberto Tamassia. John Wiley & Sons, Inc. 2001. , 2004, SIGA.

[7] Leonidas J. Guibas,et al. A new representation for linear lists , 1977, STOC '77.

[8] Roberto Grossi,et al. Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees , 2003, WADS.

[9] Pat Morin,et al. Putting your data structure on a diet , 2007 .

[10] Roberto Grossi,et al. Optimal Cache-Oblivious Implicit Dictionaries , 2003, ICALP.

[11] Michael T. Goodrich,et al. Algorithm Design: Foundations, Analysis, and Internet Examples , 2001 .

[12] J. Ian Munro,et al. Implicit Data Structures for Fast Search and Update , 1980, J. Comput. Syst. Sci..