Compact rich-functional binary relation representations

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

Volumn 6034 LNCS, Issue , 2010, Pages 170-183

  Barbay, Jérémy ^a   Claude, Francisco ^b   Navarro, Gonzalo ^a  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BASIC OPERATION; BINARY RELATION; INHERENT REDUNDANCY; NUMBER OF DATUM; SPACE USAGE; SUBLINEAR TIME; TIME COMPLEXITY;

INFORMATION SCIENCE; QUALITY ASSURANCE; REDUNDANCY;

DATA STRUCTURES;

EID: 77953512898     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12200-2_17     Document Type: Conference Paper

References (22)

1. Baeza-Yates, R., Navarro, G.: Modeling text databases. In: Recent Advances in Applied Probability, pp. 1-25. Springer, Heidelberg (2004)
2. Barbay, J., Aleardi, L.C., He, M., Munro, J.I.: Succinct representation of labeled graphs. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 316-328. Springer, Heidelberg (2007)
3. Barbay, J., Golynski, A., Munro, I., Rao, S.S.: Adaptive searching in succinctly encoded binary relations and tree-structured documents. TCS 387(3), 284-297 (2007) (Pubitemid 47633445)
4. Barbay, J., He, M., Munro, I., Rao, S.S.: Succinct indexes for strings, binary relations and multi-labeled trees. In: SODA, pp. 680-689 (2007)
5. Barbay, J., Navarro, G.: Compressed representations of permutations, and applications. In: STACS. pp. 111-122 (2009)
6. Boldi, P., Vigna, S.: The WebGraph framework I: compression techniques. In: WWW, pp. 595-602 (2004)
7. Bose, P., He,M., Maheshwari, A., Morin, P.: Succinct orthogonal range search structures on a grid with applications to text indexing. In: Dehne, F., Gavrilova, M.L., Sack, J.-R., Tóth, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 98-109. Springer, Heidelberg (2009)
8. Chien, Y.F., Hon, W.K., Shah, R., Vitter, J.: Geometric Burrows-Wheeler transform: Linking range searching and text indexing. In: DCC. pp. 252-261 (2008)
9. Chierichetti, F., Kumar, R., Lattanzi, S., Mitzenmacher, M., Panconesi, A., Raghavan, P.: On compressing social networks. In: KDD, pp. 219-228 (2009)
10. Clark, D.: Compact Pat Trees. Ph.D. thesis, Univ. of Waterloo, Canada (1996)
11. Claude, F.: Compressed Data Structures for Web Graphs. MSc. thesis, U. Chile (2008)
12. Claude, F., Navarro, G.: A fast and compact Web graph representation. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, vol. 4726, pp. 105-116. Springer, Heidelberg (2007)
13. Claude, F., Navarro, G.: Self-indexed text compression using straight-line programs. In: Královič, R., Niwiński, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 235-246. Springer, Heidelberg (2009)
14. Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM TALG 3(2), article 20 (2007)
15. Golynski, A., Munro, J.I., Rao, S.S.: Rank/select operations on large alphabets: a tool for text indexing. In: SODA, pp. 368-373 (2006)
16. Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: SODA. pp. 841-850 (2003)
17. Kärkkäinen, J.: Repetition-Based Text Indexing. Ph.D. thesis, U. Helsinki, Finland (1999)
18. Mäkinen, V., Navarro, G.: Rank and select revisited and extended. TCS 387(3), 332-347 (2007)
19. Mäkinen, V., Navarro, G.: Dynamic entropy-compressed sequences and full-text indexes. ACM TALG 4(3), article 32 (2008)
20. Navarro, G.: Indexing text using the Ziv-Lempel trie. JDA 2(1), 87-114 (2004)
21. Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: SODA, pp. 233-242 (2002)
22. Witten, I., Moffat, A., Bell, T.: Managing Gigabytes, 2nd edn. Morgan Kaufmann Publishers, San Francisco (1999)