Range queries over untangled chains

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

Volumn 6393 LNCS, Issue , 2010, Pages 82-93

  Claude, Francisco ^a   Munro, J Ian ^a   Nicholson, Patrick K ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; INFORMATION RETRIEVAL;

CONSTRUCTION ALGORITHMS; LINEAR SPACES; MONOTONIC CHAIN; ORDERS OF MAGNITUDE; RANGE QUERY; RUNNING TIME; SPACE CONSUMPTION; STATE OF THE ART;

CHAINS;

EID: 78449292955     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16321-0_8     Document Type: Conference Paper

References (15)

1. CGAL, Computational Geometry Algorithms Library, http://www.cgal.org
2. Arroyuelo, D., Claude, F., Dorrigiv, R., Durocher, S., He, M., López-Ortiz, A., Munro, J.I., Nicholson, P.K., Salinger, A., Skala, M.: Untangled monotonic chains and adaptive range search, http://www.recoded.cl/ docs/untangling.pdf
3. Arroyuelo, D., Claude, F., Dorrigiv, R., Durocher, S., He, M., Ĺopez-Ortiz, A., Munro, J.I., Nicholson, P.K., Salinger, A., Skala, M.: Untangled monotonic chains and adaptive range search. In: 20th International Symposium on Algorithms and Computation (ISAAC), pp. 203-212 (2009)
4. Bar Yehuda, R., Fogel, S.: Partitioning a sequence into few monotone subsequences. Acta Informatica 35(5), 421-440 (1998) (Pubitemid 128366492)
5. Barbay, J., López-Ortiz, A., Lu, T., Salinger, A.: An experimental investigation of set intersection algorithms for text searching. J. Exp. Algorithmics 14 ,3.7-3.24 (2009)
6. Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509-517 (1975)
7. Chazelle, B., Guibas, L.J.: Fractional Cascading: I. A Data Structuring Technique. Algorithmica 1(2), 133-162 (1986)
8. Di Stefano, G., Krause, S., Lúbbecke, M.E., Zimmermann, U.T.: On minimum kmodal partitions of permutations. Journal of Discrete Algorithms 6(3), 381-392 (2008)
9. van Emde Boas, P.: Preserving order in a forest in less than logarithmic time. In: 16th Annual Symposium on Foundations of Computer Science (FOCS), pp. 75-84 (1975)
10. Fomin, F.V., Kratsch, D., Novelli, J.C.: Approximating minimum cocolorings. Information Processing Letters 84(5), 285-290 (2002)
11. Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: 1984 ACM SIGMOD international conference on Management of data (SIGMOD), pp. 47-57. ACM, New York (1984)
12. Kanth, K.V.R., Singh, A.K.: Optimal dynamic range searching in non-replicating index structures. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 257-276. Springer, Heidelberg (1998)
13. Lueker, G.S.: A data structure for orthogonal range queries. In: 19th Annual Symposium on Foundations of Computer Science (SFCS), pp. 28-34. IEEE Computer Society, Washington (1978)
14. Supowit, K.J.: Decomposing a set of points into chains, with applications to permutation and circle graphs. Information Processing Letters 21(5), 249-252 (1985)
15. Yang, B., Chen, J., Lu, E., Zheng, S.: Design and Performance Evaluation of Sequence Partition Algorithms. Journal of Computer Science and Technology 23(5), 711-718 (2008)