Adaptive searching in succinctly encoded binary relations and tree-structured documents

Theoretical Computer Science

Volumn 387, Issue 3, 2007, Pages 284-297

  Barbay, Jérémy ^a   Golynski, Alexander ^a   Ian Munro, J ^a   Srinivasa Rao, S ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Adaptive algorithms; Conjunctive queries; Intersection problem; Labeled trees; Multi labeled trees; Path queries; Succinct data structures

Indexed keywords

ADAPTIVE ALGORITHMS; DATA STRUCTURES; PROBLEM SOLVING; QUERY LANGUAGES; XML;

CONJUNCTIVE QUERIES; INTERSECTION PROBLEM; MULTI-LABELED TREES; PATH QUERIES; SUCCINCT DATA STRUCTURES;

TREES (MATHEMATICS);

EID: 35448981883     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.07.015     Document Type: Article

References (22)

1. Baeza-Yates R.A. A fast set intersection algorithm for sorted sequences. Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching. Lecture Notes in Computer Science vol. 3109 (2004), Springer 400-408
2. J. Barbay, C. Kenyon, Alternation and redundancy analysis of the intersection problem, ACM Transactions on Algorithms 4 (1) (2008) 18 pp. (in press)
3. Barbay J., López-Ortiz A., and Lu T. Faster adaptive set intersections for text searching. 5th International Workshop on Experimental Algorithms. Lecture Notes in Computer Science vol. 4007 (2006), Springer 146-157
4. Benoit D., Demaine E.D., Munro J.I., Raman R., Raman V., and Rao S.S. Representing trees of higher degree. Algorithmica (2005) 275-292
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. E.D. Demaine, A. López-Ortiz, J.I. Munro, Adaptive set intersections, unions, and differences, in: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 743-752
7. Demaine E.D., López-Ortiz A., and Munro J.I. Experiments on adaptive set intersections for text retrieval systems. Proceedings of the 3rd Workshop on Algorithm Engineering and Experiments. Lecture Notes in Computer Science vol. 2153 (2001), Springer 91-104
8. Estivill-Castro V., and Wood D. A survey of adaptive sorting algorithms. ACM Computing Surveys 24 4 (1992) 441-476
9. P. Ferragina, F. Luccio, G. Manzini, S. Muthukrishnan, Structuring labeled trees for optimal succinctness, and beyond, in: Proceedings of the 46th IEEE Symposium on Foundations of Computer Science, 2005, pp. 184-196
10. R.F. Geary, R. Raman, V. Raman, Succinct ordinal trees with level-ancestor queries, in: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, 2004, pp. 1-10
11. A. Golynski, J.I. Munro, S.S. Rao, Rank/select operations on large alphabets: A tool for text indexing, in: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, 2006, pp. 368-373
12. 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
13. G. Jacobson, Space-efficient static trees and graphs, in: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, 1989, pp. 549-554
14. W.-K.S. Jesper Jansson, Kunihiko Sadakane, Ultra-succinct representation of ordered trees, in: Proceedings of the 18th annual ACM-SIAM Symposium on Discrete Algorithms, 2007
15. Kirkpatrick D.G., and Seidel R. The ultimate planar convex hull algorithm?. SIAM Journal on Computing 15 1 (1986) 287-299
16. Munro J.I., and Raman V. Succinct representation of balanced parentheses and static trees. SIAM Journal on Computing 31 3 (2001) 762-776
17. Munro J.I., and Rao S.S. Succinct representations of functions. 31st International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science (2004), Springer 1006-1015
18. Neumann J.V., and Morgenstern O. Theory of Games and Economic Behavior. first ed. (1944), Princeton University Press
19. R. Raman, V. Raman, S.S. Rao, Succinct indexable dictionaries with applications to encoding k-ary trees and multisets, in: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete algorithms, 2002, pp. 233-242
20. Sion M. On general minimax theorems. Pacific Journal of Mathematics 8 (1958) 171-176
21. Willard D.E. Log-logarithmic worst-case range queries are possible in space Θ (N). Information Processing Letters 17 2 (1983) 81-84
22. A.C. Yao, Probabilistic computations: Toward a unified measure of complexity, in: Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, 1977, pp. 222-227