Improved data structures for the orthogonal range successor problem

Computational Geometry: Theory and Applications

Volumn 44, Issue 3, 2011, Pages 148-159

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

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Algorithms; Data structures; Indexes; Orthogonal range searching

Indexed keywords

HIGH-DIMENSIONAL; INDEX SPACE; INDEXES; ORTHOGONAL RANGE REPORTING; PREPROCESS; QUERY TIME; RANGE SEARCHING; RESTRICTED PATTERN; WAVELET TREE;

BIOINFORMATICS; OPTIMIZATION; PATTERN MATCHING;

DATA STRUCTURES;

EID: 78649323886     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2010.09.001     Document Type: Article

References (17)

1. P.K. Agarwal, J. Erickson, Geometric range searching and its relatives, in: Advances in Discrete and Computational Geometry, 1999, pp. 1-56.
2. M.A. Bender, M. Farach-Colton, The LCA problem revisited, in: Proceedings of the 4th Latin American Theoretical Informatics Symposium, 2000, pp. 88-94.
3. J.L. Bentley, and H.A. Maurer Efficient worst-case data structures for range searching Acta Informatica 13 1980 155 168
4. P. Bose, M. He, A. Maheshwari, P. Morin, Succinct orthogonal range search structures on a grid with applications to text indexing, in: Proceedings of 11th International Symposium on Algorithms and Data Structures, 2009, pp. 98-109.
5. D.R. Clark, J.I. Munro, Efficient suffix trees on secondary storage, in: Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 1996, pp. 383-391.
6. M. Crochemore, C.S. Iliopoulos, M. Kubica, M.S. Rahman, T. Walen, Improved algorithms for the range next value problem and applications, in: Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science, 2008, pp. 205-216.
7. M. Crochemore, C.S. Iliopoulos, M.S. Rahman, Finding patterns in given intervals, in: Proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science, 2007, pp. 645-656.
8. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro Compressed representations of sequences and full-text indexes ACM Transactions on Algorithms 3 2 2007 Article number 20
9. J. Fischer, V. Heun, A new succinct representation of RMQ-information and improvements in the enhanced suffix array, in: Proceedings of the First International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, 2007, pp. 459-470.
10. R. Grossi, A. Gupta, J.S. Vitter, High-order entropy-compressed text indexes, in: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 841-850.
11. G. Jacobson, Space-efficient static trees and graphs, in: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, 1989, pp. 549-554.
12. O. Keller, T. Kopelowitz, M. Lewenstein, Range non-overlapping indexing and successive list indexing, in: Proceedings of the 10th Workshop on Algorithms and Data Structures, 2007, pp. 625-636.
13. H.-P. Lenhof, and M.H.M. Smid Using persistent data structures for adding range restrictions to searching problems RAIRO Theoretical Informatics and Applications 28 1 1994 25 49
14. V. Mäkinen, and G. Navarro Rank and select revisited and extended Theoretical Computer Science 387 3 2007 332 347
15. Y. Nekrich Orthogonal range searching in linear and almost-linear space Computational Geometry 42 4 2009 342 351
16. C.D. Thompson, A complexity theory for VLSI, PhD thesis, Carnegie-Mellon University, 1980.
17. F.P. Preparata, and M.I. Shamos Computational Geometry: An Introduction 1985 Springer Heidelberg