Untangled monotonic chains and adaptive range search

Theoretical Computer Science

Volumn 412, Issue 32, 2011, Pages 4200-4211

  Arroyuelo, Diego ^a   Claude, Francisco ^b   Dorrigiv, Reza ^b   Durocher, Stephane ^c   He, Meng ^b   López Ortiz, Alejandro ^b   Ian Munro, J ^b   Nicholson, Patrick K ^b   Salinger, Alejandro ^b   Skala, Matthew ^c  

^a YAHOO RESEARCH   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

^c UNIVERSITY OF MANITOBA   (Canada)

Author keywords

Adaptive; Computational geometry; Data structure; Implicit; Monotonic chain; Range query; Range search; Untangling

Indexed keywords

ADAPTIVE; IMPLICIT; MONOTONIC CHAIN; RANGE QUERY; RANGE SEARCH; UNTANGLING;

ALGORITHMS; COMPUTATIONAL GEOMETRY; QUERY LANGUAGES; QUERY PROCESSING;

DATA STRUCTURES;

EID: 79959359197     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2011.01.037     Document Type: Conference Paper

References (19)

1. L. Arge, M. de-Berg, H.J. Haverkort, and K. Yi The priority R-tree: a practically efficient and worst-case optimal R-tree ACM Transactions on Algorithms 4 2008 9:1 9:30
2. D. Arroyuelo, F. Claude, R. Dorrigiv, S. Durocher, M. He, A. López-Ortiz, J.I. Munro, P.K. Nicholson, A. Salinger, and M. Skala Untangled monotonic chains and adaptive range search Y. Dong, D.Z. Du, O. Ibarra, 20th International Symposium on Algorithms and Computation ISAAC 2009 LNCS vol. 5878 2009 Springer 203 212
3. R. Bar-Yehuda, and S. Fogel Partitioning a sequence into few monotone subsequences Acta Informatica 35 1998 421 440
4. J.L. Bentley Multidimensional binary search trees used for associative searching Communications of the ACM 18 1975 509 517
5. P.A. Bloniarz, and S.S. Ravi An Ω (n log n ) lower bound for decomposing a set of points into chains Information Processing Letters 31 1989 319 322
6. B. Chazelle, and L.J. Guibas Fractional cascading: I. a data structuring technique Algorithmica 1 1986 133 162 (Pubitemid 17556682)
7. F. Claude, J.I. Munro, and P.K. Nicholson Range queries over untangled chains E. Chávez, S. Lonardi, Proceedings of the 17th Symposium on String Processing and Information Retrieval SPIRE 2010 LNCS vol. 6393 2010 Springer 82 93
8. E.D. Demaine, A. López-Ortiz, and J.I. Munro Adaptive set intersections, unions, and differences Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms SODA 2010 2000 ACM Press New York 743 752 (Pubitemid 30549325)
9. G. Di-Stefano, S. Krause, M.E. Lbbecke, and U.T. Zimmermann On minimum k-modal partitions of permutations Journal of Discrete Algorithms 6 2008 381 392
10. F.V. Fomin, D. Kratsch, and J.C. Novelli Approximating minimum cocolorings Information Processing Letters 84 2002 285 290 (Pubitemid 35167772)
11. A. Guttman R-trees: a dynamic index structure for spatial searching SIGMOD Record (ACM Special Interest Group on Management of Data) 14 1984 47 57 (Pubitemid 15469534)
12. K.V.R. Kanth, and A. Singh Optimal dynamic range searching in non-replicating index structures 7th International Conference on Database Theory, ICDT'99, Proceedings LNCS vol. 1540 1999 Springer 257 276
13. J. van Leeuwen, and A.A. Schoone Untangling a traveling salesman tour in the plane Proceedings of the 7th Conference on Graphtheoretic Concepts in Computer Science WG 81 1981 Hanser Verlag Mnchen, Germany 87 98
14. G.S. Lueker A data structure for orthogonal range queries 19th Annual Symposium on Foundations of Computer Science FOCS'78 1978 IEEE Computer Society Press Long Beach, Ca., USA 28 34
15. J.I. Munro, A multikey search problem, in: Proceedings of the 17th Allerton Conference on Communication, Control and Computing, University of Illinois, pp. 241244.
16. J.I. Munro, and H. Suwanda Implicit data structures for fast search and update Journal of Computer Systems Sciences 21 1980 236 250 (Pubitemid 11469809)
17. Y. Nekrich Orthogonal range searching in linear and almost-linear space Computational Geometry 42 2009 342 351
18. K.J. Supowit Decomposing a set of points into chains, with applications to permutation and circle graphs Information Processing Letters 21 1985 249 252
19. B. Yang, J. Chen, E. Lu, and S.Q. Zheng A comparative study of efficient algorithms for partitioning a sequence into monotone subsequences J. yi Cai, S.B. Cooper, H. Zhu, Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Proceedings LNCS vol. 4484 2007 Springer 46 57 (Pubitemid 47628393)