Succinct orthogonal range search structures on a grid with applications to text indexing

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

Volumn 5664 LNCS, Issue , 2009, Pages 98-109

  Bose, Prosenjit ^a   He, Meng ^b   Maheshwari, Anil ^a   Morin, Pat ^a  

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

KEY COMPONENT; ORTHOGONAL RANGE SEARCH; QUERY TIME; RANGE QUERY; STORAGE COSTS; SUBSTRING SEARCH; SUCCINCT DATA STRUCTURE; SUCCINCT REPRESENTATION; TEXT-INDEXING;

INDEXING (OF INFORMATION); INFORMATION THEORY;

DATA STRUCTURES;

EID: 69949184936     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03367-4_9     Document Type: Conference Paper

References (18)

1. Mäkinen, V., Navarro, G.: Rank and select revisited and extended. Theor. Comput. Sci. 387, 332-347 (2007)
2. Chien, Y.F., Hon, W.K., Shah, R., Vitter, J.S.: Geometric burrows-wheeler transform: Linking range searching and text indexing. In: DCC, pp. 252-261 (2008)
3. Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: STOC, pp. 135-143 (1984)
4. Chazelle, B.: A functional approach to data structures and its use in multidimensional searching. SIAM Journal on Computing 17(3), 427-462 (1988)
5. Overmars, M.H.: Efficient data structures for range searching on a grid. Journal of Algorithms 9(2), 254-275 (1988)
6. Alstrup, S., Brodal, G.S., Rauhe, T.: New data structures for orthogonal range searching. In: FOCS, pp. 198-207 (2000)
7. Nekrich, Y.: Orthogonal range searching in linear and almost-linear space. Computational Geometry: Theory and Applications 42(4), 342-351 (2009)
8. Jacobson, G.: Space-efficient static trees and graphs. In: FOCS, pp. 549-554 (1989)
9. Raman, R., Raman, V., Satti, S.R.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Transactions on Algorithms 3(4), 43 (2007)
10. Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: SODA, pp. 841-850 (2003)
11. Barbay, J., Golynski, A., Munro, J.I., Rao, S.S.: Adaptive searching in succinctly encoded binary relations and tree-structured documents. Theoretical Computer Science 387(3), 284-297 (2007)
12. Barbay, J., He, M., Munro, J.I., Rao, S.S.: Succinct indexes for strings, binary relations and multi-labeled trees. In: SODA, pp. 680-689 (2007)
13. Geary, R.F., Raman, R., Raman, V.: Succinct ordinal trees with level-ancestor queries. ACM Transactions on Algorithms 2(4), 510-534 (2006)
14. Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Structuring labeled trees for optimal succinctness, and beyond. In: FOCS, pp. 184-196 (2005)
15. Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Trans. Alg. 3(2), 20 (2007)
16. Bauernöppel, F., Kranakis, E., Krizanc, D., Maheshwari, A., Sack, J.R., Urrutia, J.: Planar stage graphs: Characterizations and applications. Theoretical Computer Science 175(2), 239-255 (1997)
17. Clark, D.R., Munro, J.I.: Efficient suffix trees on secondary storage. In: SODA, pp. 383-391 (1996)
18. Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88-94. Springer, Heidelberg (2000)