Rank and Select for Succinct Data Structures-Reference-Cited by-同舟云学术

Rank and Select for Succinct Data Structures

Published:2009-04 Issue: Volume:236 Page:131-145
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Fariña Antonio,Ladra Susana,Pedreira Oscar,Places Ángeles S.

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference15 articles.

1. Boldi P., Vigna S.: The webgraph framework I: compression techniques In: Proc. of the 13th international conference on World Wide Web (WWW). (2004) 595-602

2. Brisaboa, N., Fariña, A., Ladra, S., Navarro, G.: Reorganizing Compressed Text In: Proc. of International ACM SIGIR Conference 2008 (SIGIR 2008). To appear

3. Lightweight natural language text compression;Brisaboa;Information Retrieval 10(1),2007

4. An efficient compression code for text databases;Brisaboa,2003

5. Clark, D.: Compact Pat Trees. PhD thesis, University of Waterloo (1996)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On incremental radius algorithm for k Nearest Neighbors over compact data structure k²-tree;2023 42nd IEEE International Conference of the Chilean Computer Science Society (SCCC);2023-10-23

2. Map algebra algorithms over raster data stored in the k²-raster compact data structure;2022 41st International Conference of the Chilean Computer Science Society (SCCC);2022-11-21

3. Efficient computation of spatial queries over points stored in k2-tree compact data structures;Theoretical Computer Science;2021-11

4. Efficient computation of map algebra over raster data stored in the k2-acc compact data structure;GeoInformatica;2021-07-24

5. A comprehensive analysis of wavelet tree based indexing schemes in GIR systems;International Journal of Information Technology;2021-04-30