LRM-trees: Compressed indices, adaptive sorting, and compressed permutations

Theoretical Computer Science

Volumn 459, Issue , 2012, Pages 26-41

  Barbay, Jérémy ^a   Fischer, Johannes ^b   Navarro, Gonzalo ^a  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Adaptive sorting algorithms; Compressed data structures; Data structures for permutations; Range minimum queries

Indexed keywords

DATA STRUCTURES; FORESTRY;

ADAPTIVE SORTING; ADAPTIVE SORTING ALGORITHMS; COMPRESSED DATA STRUCTURES; RANGE MINIMUM QUERIES;

SORTING;

DATA; FORESTRY; STRUCTURES;

EID: 84888642782     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2012.08.010     Document Type: Article

References (34)

1. J. Barbay, T. Gagie, G. Navarro, Y. Nekrich, Alphabet partitioning for compressed rank/select and applications, in: O. Cheong, K.-Y. Chwa, K.P arks (Eds.), Proceedings of ISAAC 2010, in: LNCS, vol. 6507, 2010, pp. 315-326.
2. J. Barbay, M. He, J.I. Munro, S.S. Rao, Succinct indexes for strings, binary relations, and multi-labeled trees, in: Proc. SODA, ACM/SIAM, 2007, pp. 680-689.
3. J. Barbay, G. Navarro, Compressed representations of permutations, and applications, in: Proc. STACS, IBFI Schloss Dagstuhl, 2009, pp. 111-122.
4. J. Barbay, G. Navarro, On compressing permutations and adaptive sorting. CoRR, 2011, abs/1108.4408.
5. D. Benoit, E.D. Demaine, J.I. Munro, R. Raman, V. Raman, S.S. Rao, Representing trees of higher degree, Algorithmica 43 (4) (2005) 275-292.
6. O. Berkman, U. Vishkin, Recursive star-tree parallel data structure, SIAM J. Comput. 22 (2) (1993) 221-242.
7. G.S. Brodal, P. Davoodi, S.S. Rao, On space efficient two dimensional range minimum data structures, in: Proc. ESA (Part II), in: LNCS, vol. 6347, Springer, 2010, pp. 171-182.
8. K.-Y. Chen, K.-M. Chao, On the range maximum-sum segment query problem, in: Proc. ISAAC, in: LNCS, vol. 3341, Springer, 2004, pp. 294-305.
9. D.R. Clark, Compact pat trees, Ph.D. Thesis, University of Waterloo, Canada, 1996.
10. M. Crochemore, C.S. Iliopoulos, M. Kubica, M.S. Rahman, T. Walen, Improved algorithms for the range next value problem and applications, in: Proc. STACS, IBFI Schloss Dagstuhl, 2008, pp. 205-216.
11. P. Ferragina, G. Manzini, Opportunistic data structures with applications, in: Proc. FOCS, IEEE, 2000, pp. 390-398.
12. J. Fischer, Optimal succinctness for range minimum queries, in: Proc. LATIN, in: LNCS, vol. 6034, Springer, 2010, pp. 158-169.
13. J. Fischer, V. Heun, H.M. Stühler, Practical entropy bounded schemes for O(1)-range minimum queries, in: Proc. DCC, IEEE Press, 2008, pp. 272-281.
14. J. Fischer, V. Mäkinen, G. Navarro, Faster entropy-bounded compressed suffix trees, Theoret. Comput. Sci. 410 (51) (2009) 5354-5364.
15. H.N. Gabow, J.L. Bentley, R.E. Tarjan, Scaling and related techniques for geometry problems, in: Proc. STOC, ACM Press, 1984, pp. 135-143.
16. A. Gál, P.B. Miltersen, The cell probe complexity of succinct data structures, Theoret. Comput. Sci. 379 (3) (2007) 405-417.
17. A. Golynski, Optimal lower bounds for rank and select indexes, Theoret. Comput. Sci. 387 (3) (2007) 348-359.
18. R. Grossi, A. Gupta, J.S. Vitter, High-order entropy-compressed text indexes, in: Proc. SODA, ACM/SIAM, 2003, pp. 841-850.
19. D. Huffman, A method for the construction of minimum-redundancy codes, in: Proceedings of the I.R.E., vol. 40, 1952, pp. 1090-1101.
20. G. Jacobson, Space-efficient static trees and graphs, in: Proc. FOCS, IEEE Computer Society, 1989, pp. 549-554.
21. J. Jansson, K. Sadakane, W.-K. Sung, Ultra-succinct representation of ordered trees, in: Proc. SODA, ACM/SIAM, 2007, pp. 575-584.
22. A.E. Kézdy, H.S. Snevily, C. Wang, Partitioning permutations into increasing and decreasing subsequences, J. Combin. Theory Ser. A 73 (2) (1996) 353-359.
23. D.E. Knuth, Art of Computer Programming, 2nd ed., in: Sorting and Searching, vol. 3, Addison-Wesley Professional, 1998.
24. C. Levcopoulos, O. Petersson, Sorting shuffled monotone sequences, Inf. Comput. 112 (1) (1994) 37-50.
25. V. Mäkinen, G. Navarro, Implicit compression boosting with applications to self-indexing, in: Proc. SPIRE, in: LNCS, vol. 4726, Springer, 2007, pp. 214-226.
26. J.I. Munro, Tables, in: Proc. FSTTCS, in: LNCS, vol. 1180, Springer, 1996, pp. 37-42.
27. G. Navarro, V. Mäkinen, Compressed full-text indexes, ACM Comput. Surv. 39 (1) (2007) Article No. 2.
28. D. Okanohara, K. Sadakane, Practical entropy-compressed rank/select dictionary, in: Proceedings of the 14th International Workshop on Algorithms and Data Structures, WADS, in: Lecture Notes in Computer Science (LNCS), vol. 1671, Springer-Verlag, 2007.
29. O. Petersson, A. Moffat, A framework for adaptive sorting, Discrete Appl. Math. 59 (1995) 153-179.
30. M. Pátraşcu, Succincter, in: Proc. FOCS, IEEE Computer Society, 2008, pp. 305-313.
31. R. Raman, V. Raman, S.S. Rao, Succinct indexable dictionaries with applications to encoding k-ary trees and multisets, in: Proc. SODA, ACM/SIAM, 2002, pp. 233-242.
32. R. Raman, V. Raman, S.S. Rao, Succinct indexable dictionaries with applications to encoding k-ary trees and multisets, ACM Trans. Algorithms 3 (4) (2007) Art. 43.
33. K. Sadakane, R. Grossi, Squeezing succinct data structures into entropy bounds, in: Proc. SODA, ACM/SIAM, 2006, pp. 1230-1239.
34. K. Sadakane, G. Navarro, Fully-functional succinct trees, in: Proc. SODA, ACM/SIAM, 2010, pp. 134-149.