Space-efficient data-analysis queries on grids

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

Volumn 7074 LNCS, Issue , 2011, Pages 323-332

  Navarro, Gonzalo ^a   Russo, Luís M S ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b INESC ID   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

NEW SOLUTIONS; SEMI-GROUP; STATIC AND DYNAMIC;

ALGORITHMS; TWO DIMENSIONAL;

COMPUTATIONAL EFFICIENCY;

EID: 84055217312     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25591-5_34     Document Type: Conference Paper

References (21)

1. Alstrup, S., Brodal, G., Rauhe, T.: New data structures for orthogonal range searching. In: FOCS, pp. 198-207 (2000)
2. Berg, M., Cheong, O., Kreveld, M., Overmars, M.: Orthogonal range searching: Querying a database. In: Computational Geometry, pp. 95-120. Springer, Heidelberg (2008)
3. 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., Sack, J.-R., Tóth, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 98-109. Springer, Heidelberg (2009)
4. Brodal, G., Davoodi, P., Rao, S.: On space efficient two dimensional range minimum data structures. Algorithmica (2011), doi:10.1007/s00453-011-9499- 0
5. Carlsson, S., Munro, J.I., Poblete, P.V.: An Implicit Binomial Queue with Constant Insertion Time. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol. 318, pp. 1-13. Springer, Heidelberg (1988)
6. Chazelle, B.: A functional approach to data structures and its use in multidimensional searching. SIAM J. Comp. 17(3), 427-462 (1988)
7. Culpepper, J.S., Navarro, G., Puglisi, S.J., Turpin, A.: Top-k Ranked Document Search in General Text Databases. In: de Berg, M., Meyer, U. (eds.) ESA 2010, part II. LNCS, vol. 6347, pp. 194-205. Springer, Heidelberg (2010)
8. Durocher, S., Morrison, J.: Linear-space data structures for range mode query in arrays. CoRR, 1101.4068 (2011)
9. Fischer, J.: Optimal Succinctness for Range Minimum Queries. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 158-169. Springer, Heidelberg (2010)
10. Gagie, T., Navarro, G., Puglisi, S.J.: Colored Range Queries and Document Retrieval. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 67-81. Springer, Heidelberg (2010)
11. Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: SODA, pp. 841-850 (2003)
12. He, M., Munro, J.I.: Succinct Representations of Dynamic Strings. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 334-346. Springer, Heidelberg (2010)
13. Mäkinen, V., Navarro, G.: Rank and select revisited and extended. Theo. Comp. Sci. 387(3), 332-347 (2007)
14. Mäkinen, V., Navarro, G.: Dynamic entropy-compressed sequences and full-text indexes. ACM Trans. Alg., 4(3), art. 32 (2008)
15. Navarro, G., Sadakane, K.: Fully-functional static and dynamic succinct trees. CoRR, 0905.0768v5 (2010)
16. Nekrich, Y.: Orthogonal range searching in linear and almost-linear space. Comp. Geom. Theo. and App. 42(4), 342-351 (2009)
17. Okanohara, D., Sadakane, K.: Practical entropy-compressed rank/select dictionary. In: ALENEX (2007)
18. Pǎ;traşcu, M.: Succincter. In: FOCS, pp. 305-313 (2008)
19. Pǎ;traşcu, M.: Lower bounds for 2-dimensional range counting. In: STOC, pp. 40-46 (2007)
20. Rahul, S., Gupta, P., Janardan, R., Rajan, K.S.: Efficient Top-k Queries for Orthogonal Ranges. In: Katoh, N., Kumar, A. (eds.) WALCOM 2011. LNCS, vol. 6552, pp. 110-121. Springer, Heidelberg (2011)
21. Willard, D.: New data structures for orthogonal range queries. SIAM J. Comp. 14(232-253) (1985)