Compressed prefix sums

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4362 LNCS, Issue , 2007, Pages 235-247

  Delpratt, O'Neil ^a   Rahman, Naila ^a   Raman, Rajeev ^a  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DATA REDUCTION; DATA STRUCTURES; INFORMATION RETRIEVAL; PROBLEM SOLVING;

COMPRESSIBILITY CRITERIA; OPERATION SUM; SUCCINCT BOUND;

INTEGER PROGRAMMING;

EID: 38149026953     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69507-3_19     Document Type: Conference Paper

References (17)

1. Clark, D. and Munro, J.I.: Efficient Suffix Trees on Secondary Storage. In Proc. 7th ACM-SIAM SODA, ACM Press (1996) 383-391
2. Delpratt, O., Rahman, N., and Raman, R.: Engineering the LOUDS Succinct Tree Representation. In Proc. WEA 2006, Springer, LNCS 4007 (2006) 134-145
3. Elias, P.: Efficient Storage Retrieval by Content and Address of Static Files. J. ACM 21 (1974) 246-260
4. Fredman, M.L. and Willard, D.E.: Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. J. Comput. Sys. Sci. 48 (1994) 533-551
5. Geary, R.F., Rahman, N., Raman, R., and Raman, V.: A Simple Optimal Representation for Balanced Parentheses. In Proc. 15th CPM, Springer, LNCS 3109 (2004) 159-172
6. Grossi, R. and Sadakane, K.: Squeezing Succinct Data Structures into Entropy Bounds. In Proc. 17th ACM-SIAM SODA, ACM Press (2006) 1230-1239
7. Grossi, R. and Vitter, J.S.: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. Manuscript (2002), Prel. vers. in Proc. ACM STOC, ACM Press (2000) 397-406
8. Grossi, R. and Vitter, J.S.: Private communication (2004)
9. Gupta, A., Hon, W.-K., Shah, R., and Vitter, J.S.: Compressed Data Structures: Dictionaries and Data-Aware Measures. In Proc. DCC '06, IEEE (2006) 213-222
10. Gupta, A., Hon, W.-K., Shah, R., and Vitter, J.S.: Compressed Dictionaries: Space Measures, Data Sets, and Experiments. In Proc. WEA '06, Springer, LNCS 4007 (2006) 158-169
11. Hagerup, T.: Sorting and Searching on the Word RAM. In Proc. 15th STACS, Springer, LNCS 1373 (1998) 366-398
12. Hagerup, T. and Tholey, T.: Efficient Minimal Perfect Hashing in Nearly Minimal Space. In Proc. 18th STACS, Springer, LNCS 2010 (2001) 317-326
13. Kim, D.K., Na, J.C., Kim, J.E., and Park, K.: Effcient Implementation of Rank and Select Functions for Succinct Representation. In Proc. WEA 2005, Springer, LNCS 3503 (2005) 315-327
14. Raman, R., Raman, V., and Rao, S.S.: Succinct Indexable Dictionaries, with Applications to Representing k-Ary Trees and Multisets. In Proc. 13th ACM-SIAM SODA, ACM Press (2002) 233-242
15. UW XML Repository, http://www.es.washington.edu/research/xmldatasets/
16. VOTable Documentation. http://www.us-vo.org/VOTable/
17. Witten, I., Moffat, A., and Bell, I.: Managing Gigabytes, 2e. Morgan Kaufmann (1999)