Efficient data structures for the orthogonal range successor problem

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

Volumn 5609 LNCS, Issue , 2009, Pages 96-105

  Yu, Chih Chiang ^a   Hon, Wing Kai ^a   Wang, Biing Feng ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Algorithms; Data structures; Indexes; Range searching

Indexed keywords

D-DIMENSIONAL GRIDS; EFFICIENT DATA STRUCTURES; INDEX SPACE; INDEXES; QUERY TIME; RANGE QUERY; RANGE SEARCHING; WAVELET TREE;

INDEXING (OF INFORMATION);

DATA STRUCTURES;

EID: 71049188568     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02882-3_11     Document Type: Conference Paper

References (12)

1. Agarwal, P.K., Erickson, J.: Geometric Range Searching and Its Relatives. Advances in Discrete and Computational Geometry 223, 1-56 (1999)
2. 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)
3. Crochemore, M., Iliopoulos, C.S., Kubica, M., Rahman, M.S., Walen, T.: Improved Algorithms for the Range Next Value Problem and Applications. In: 25th Annual Symposium on Theoretical Aspects of Computer Science, pp. 205-216 (2008)
4. Crochemore, M., Iliopoulos, C.S., Rahman, M.S.: Finding Patterns in Given Intervals. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 645-656. Springer, Heidelberg (2007)
5. Ferragina, P., Manzini, G., Müakinen, V., Navarro, G.: Compressed Representations of Sequences and Full-Text Indexes. ACM Transactions on Algorithms 3(2) (2007)
6. Grossi, R., Gupta, A., Vitter, J.S.: High-Order Entropy-Compressed Text Indexes. In: 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 841-850 (2003)
7. Iliopoulos, C.S., Rahman, M.S.: Indexing Circular Patterns. In: Nakano, S.-i., Rahman, M.S. (eds.) WALCOM 2008. LNCS, vol. 4921, pp. 46-57. Springer, Heidelberg (2008)
8. Keller, O., Kopelowitz, T., Lewenstein, M.: Range Non-overlapping Indexing and Successive List Indexing. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 625-636. Springer, Heidelberg (2007)
9. Lenhof, H.-P., Smid, M.H.M.: Using Persistent Data Structures for Adding Range Restrictions to Searching Problems. RAIRO Theoretical Informatics and Application 28(1), 25-49 (1994)
10. Mäkinen, V., Navarro, G.: Rank and Select Revisited and Extended. Theor. Comput. Sci. 387(3), 332-347 (2007)
11. Nekrich, Y.: Orthogonal Range Searching in Linear and Almost-Linear Space. Comput. Geom. 42(4), 342-351 (2009)
12. Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, Heidelberg (1985)