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

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

Volumn 4009 LNCS, Issue , 2006, Pages 24-35

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

^a UNIVERSITY OF WATERLOO   (Canada)

^b IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

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

Indexed keywords

ADAPTIVE SYSTEMS; ENCODING (SYMBOLS); FILE ORGANIZATION; QUERY LANGUAGES; WEBSITES; XML;

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

BINARY CODES;

EID: 33746038143     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780441_4     Document Type: Conference Paper

References (14)

1. R. A. Baeza-Yates. A fast set intersection algorithm for sorted sequences. In Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching (CPM), volume 3109 of LNCS, pages 400-408. Springer, 2004.
2. J. Barbay. Optimality of randomized algorithms for the intersection problem. In A. Albrecht, editor, Proceedings of the Symposium on Stochastic Algorithms, Foundations and Applications (SAGA), volume 2827 / 2003, pages 26-38. Springer-Verlag Heidelberg, 2003.
3. J. Barbay and C. Kenyon. Adaptive intersection and t-throshold problems. In Proceedings of the 13th ACM-SIAM Symposium On Discrete Algorithms (SODA), pages 390-399, 2002.
4. D. R. Clark and J. I. Munro. Efficient suffix trees on secondary storage. In Proceedings of the 7th annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 383-391, Philadelphia, PA, USA, 1990.
5. E. D. Demaine, A. Lopez-Ortiz, and J. I. Munro. Adaptive set intersections, unions, and differences. In Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 743-752, 2000.
6. E. D. Demaine, A. Lòpez-Ortiz, and J. I. Munro, Experiments on adaptive set intersections for text retrieval systems. In Proceedings of the 3rd Workshop on Algorithm Engineering and Experiments, Lecture Notes in Computer Science, pages 5-6, Washington DC, January 2001.
7. P. Ferragina, F. Luccio, G. Manzini, and S. Muthukrishnan. Structuring labeled trees for optimal succinctness, and beyond. In Proc. 46th JEEE Symposium on Foundations of Computer Science (FOCS '05), pages 184-196, 2005.
8. R. F. Geary, R. Raman, and V. Raman. Succinct, ordinal trees with level-ancestor queries. In Proceedings of the 15th annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1-10. Society for Industrial and Applied Mathematics, 2004.
9. A. Golynski, J. I. Muriro, and 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 algorithm (SODA), pages 368-373, 2006.
10. G. Jacobson. Space-efficient static trees and graphs. In Proceedings of the 30th annual Symposium on Foundations of Computer Science (FOCS'89), pages 549-554, 1989.
11. J. V. Neumann and O. Morgenstern. Theory of games and economic, behavior. 1st ed. Princeton University Press, 1944.
12. M. Sion, On general minimax theorems, Pacific Journal of Mathematics, pages 171-176, 1958.
13. D. E. Willard, Log-logarithmic worst-case range queries are possible in space θ(N). Information Processing Letters, 17(2):81-84, Aug. 1983.
14. A. C. Yao. Probabilistic computations: Toward a unified measure of complexity. In Proc. 18th IEEE Symposium on Foundations of Computer Science (FOCS), pages 222-227, 1977.