Browse > Article

Implementation of Rank/Select Data Structure using Alphabet Frequency  

Kwon, Yoo-Jin (한국IBM 유비쿼터스컴퓨팅랩)
Lee, Sun-Ho (한양대학교 전기통신컴퓨터공학부)
Park, Kun-Soo (서울대학교 컴퓨터공학부)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.36, no.4, 2009 , pp. 283-290 More about this Journal
Abstract
The rank/select data structure is a basic tool of succinct representations for several data structures such as trees, graphs and text indexes. For a given string sequence, it is used to answer the occurrence of characters up to a certain position. In previous studies, theoretical rank/select data structures were proposed, but they didn't support practical operational time and space. In this paper, we propose a simple solution for implementing rank/select data structures efficiently. According to experiments, our methods without complex encodings achieve nH$_0$ + O(n) bits of theoretical size and perform rank/select operations faster than the original HSS data structure.
Keywords
rank/select data structures; index data structures; succinct data structures;
Citations & Related Records
연도 인용수 순위
  • Reference
1 E. M. McCreight, A space-economical suffix tree construction algorithm, Journal of ACM, 23, pp.262-272, 1979.
2 U. Manber and G. Myers, Suffix arrays: a new method for on-line string searches, SIAM Journal on Computing, 22, pp.935-948, 1993.   DOI   ScienceOn
3 R. Grossi and J. S. Vitter, Compressed suffix arrays and suffix trees with applications to text indexing and string matching, SIAM Journal on Computing, 35, pp.378-407, 2005.   DOI   ScienceOn
4 박치성, 조준하, 김동규, Succinct 표현의 효율적인 구현을 통한 압축된 써픽스 배열 생성. 한국정보과학회 제 32회 추계학술발표회 2005.
5 P. Ferragina and G. Manzini, Indexing compressed texts, Journal of ACM, 52, pp.552-581, 2005.   DOI   ScienceOn
6 최용욱, 심정섭, 박근수, 접미사 배열을 이용한 시간과 공간 효율적인 검색, 한국정보과학회논문지, 32, pp.260-267, 2005.
7 G. Jacobson, Space-efficient static trees and graphs, In Proceedings of FOCS, 1989.
8 R. Grossi, A. Gupta and J. S. Vitter, High-Order Entropy-Compressed Text Indexes. In Proceedings of SODA, 2003.
9 D. R. Clark, Compact Pat Trees, PhD thesis, University of Waterloo, 1988.
10 J. I. Munro and V. Raman, Succinct representation of balanced parentheses and static trees, SIAM Journal on Computing, 31, pp.762-776, 2001.   DOI   ScienceOn
11 W. Hon, K. Sadakane and W. Sung, Breaking a time-and-space barrier in constructing full-text indices. In Proceedings of FOCS, 2003.
12 A. Golynski, J. I. Munro and S. S. Rao, Rank/select operations on large alphabets: a tool for text indexing, In Proceedings of SODA, 2006.
13 F. Claude and G. Navarro. Practical Rank/ Select Queries over Arbitrary Sequences. In Proceedings of SPIRE, 2008.
14 G. Manzini, An analysis of the Burrows-Wheeler transform, Journal of ACM, 48, pp.407-430, 2001.   DOI   ScienceOn
15 K. Sadakane, New text indexing functionalities of the compressed suffix arrays, Journal of Algorithms, 48, pp.294-313, 2003.   DOI   ScienceOn
16 R. Raman, V. Raman, and S. S. Rao. Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets, In Proceedings of SODA, 2002.
17 T. Cover and J. Thomas. Elements of Information Theory, Wiley-Interscience, 1991.
18 R. González, S. Grabowski, V. Mäkinen, and G. Navarro. Practical Implementation of Rank and Select Queries. In Poster Proceedings of 4th WEA, 2005.
19 D. Okanohara and K. Sadakane, Practical entropycompressed rank/select dictionary, In Proceedings of ALENEX, 2007.