Entropy-bounded representation of point grids

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

Volumn 6507 LNCS, Issue PART 2, 2010, Pages 327-338

  Farzan, Arash ^a   Gagie, Travis ^b   Navarro, Gonzalo ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED REPRESENTATION; LARGE DATASETS; POINT GRIDS; POINT SELECTION; BOUNDED SPACES;

ALGORITHMS; DATA PROCESSING; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ENTROPY;

EID: 78650864406     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17514-5_28     Document Type: Conference Paper

References (20)

1. Alstrup, S., Brodal, G., Rauhe, T.: New data structures for orthogonal range searching. In: Proc. 41st FOCS, pp. 198-207 (2000)
2. Barbay, J., Claude, F., Navarro, G.: Compact rich-functional binary relation representations. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 172-185. Springer, Heidelberg (2010)
3. Bender, M., Farach-Colton, M.: The level ancestor problem simplified. Theoretical Computer Science 321(1), 5-12 (2004)
4. Bose, P., He, M., Maheshwari, A., Morin, P.: Succinct orthogonal range search structures on a grid with applications to text indexing. In: Proc. 11th WADS, pp. 98-109 (2009)
5. Chan, T., Pǎtraşcu, M.: Counting inversions, offline orthogonal range counting, and related problems. In: Proc. 21st SODA, pp. 161-173 (2010)
6. Chazelle, B.: Filtering search: A new approach to query-answering. SIAM Journal of Computing 15, 703-724 (1986)
7. Chazelle, B.: Lower bounds for orthogonal range searching: II. The arithmetic model. Journal of the ACM 37(3), 430-463 (1990)
8. Clark, D.: Compact Pat Trees. PhD thesis, University of Waterloo, Canada (1996)
9. Golynski, A.: Optimal lower bounds for rank and select indexes. Theoretical Computer Science 387(3), 348-359 (2007)
10. Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. 14th SODA (2003)
11. Gupta, A., Hon, W.-K., Shah, R., Vitter, J.S.: Compressed data structures: Dictionaries and data-aware measures. In: Proc. 16th DCC, pp. 213-222 (2006)
12. Já Já, J., Mortensen, C.W., Shi, Q.: Space-efficient and fast algorithms for multidimensional dominance reporting and counting. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 558-568. Springer, Heidelberg (2004)
13. Munro, I.: Tables. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 37-42. Springer, Heidelberg (1996)
14. Nekrich, Y.: Space efficient dynamic orthogonal range reporting. In: Proc. 21st SCG, pp. 306-313 (2005)
15. Nekrich, Y.: Orthogonal range searching in linear and almost-linear space. Computational Geometry: Theory and Applications 42(4), 342-351 (2009)
16. Okanohara, D., Sadakane, K.: Practical entropy-compressed rank/select dictionary. In: Proc. 9th ALENEX (2007)
17. Pǎtraşcu, M.: Lower bounds for 2-dimensional range counting. In: Proc. 39th STOC, pp. 40-46 (2007)
18. Pǎtraşcu, M., Thorup, M.: Time-space trade-offs for predecessor search. In: Proc. 38th STOC, pp. 232-240 (2006)
19. Raman, R., Raman, V., Srinivasa Rao, S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proc. 13th SODA, pp. 233-242 (2002)
20. Willard, D.: Log-logarithmic worst-case range queries are possible in space θ(n). Information Processing Letters 17(2), 81-84 (1983)