Abstract
The most heavily used methods to answer conjunctive queries on binary relations (such as the one associating keywords with web pages) are based on inverted lists stored in sorted arrays and use variants of binary search. We show that a succinct representation of the binary relation permits much better results, while using space within a lower order term of the optimal. We apply our results not only to conjunctive queries on binary relations, but also to queries on semi-structured documents such as XML documents or file-system indexes, using a variant of an adaptive algorithm used to solve conjunctive queries on binary relations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baeza-Yates, R.: A Fast Set Intersection Algorithm for Sorted Sequences. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 400–408. Springer, Heidelberg (2004)
Barbay, J.: Optimality of randomized algorithms for the intersection problem. In: Albrecht, A.A., Steinhöfel, K. (eds.) SAGA 2003. LNCS, vol. 2827, pp. 26–38. Springer, Heidelberg (2003)
Barbay, J., Kenyon, C.: Adaptive intersection and t-threshold problems. In: Proceedings of the 13th ACM-SIAM Symposium On Discrete Algorithms (SODA), pp. 390–399 (2002)
Clark, D.R., Munro, J.I.: Efficient suffix trees on secondary storage. In: Proceedings of the 7th annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Philadelphia, PA, USA, pp. 383–391 (1996)
Demaine, E.D., López-Ortiz, A., Munro, J.I.: Adaptive set intersections, unions, and differences. In: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 743–752 (2000)
Demaine, E.D., López-Ortiz, A., Munro, J.I.: Experiments on adaptive set intersections for text retrieval systems. In: Proceedings of the 3rd Workshop on Algorithm Engineering and Experiments, Washington, DC. LNCS, pp. 5–6. Springer, Heidelberg (2001)
Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Structuring labeled trees for optimal succinctness, and beyond. In: Proc. 46th IEEE Symposium on Foundations of Computer Science (FOCS 2005), pp. 184–196 (2005)
Geary, R.F., Raman, R., Raman, V.: Succinct ordinal trees with level-ancestor queries. In: Proceedings of the 15th annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, pp. 1–10 (2004)
Golynski, A., Munro, J.I., Rao, S.S.: Rank/select operations on large alphabets: a tool for text indexing. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete algorithm (SODA), pp. 368–373 (2006)
Jacobson, G.: Space-efficient static trees and graphs. In: Proceedings of the 30th annual Symposium on Foundations of Computer Science (FOCS 1989), pp. 549–554 (1989)
Neumann, J.V., Morgenstern, O.: Theory of games and economic behavior, 1st edn. Princeton University Press, Princeton (1944)
Sion, M.: On general minimax theorems. Pacific Journal of Mathematics, 171–176 (1958)
Willard, D.E.: Log-logarithmic worst-case range queries are possible in space Θ(N). Information Processing Letters 17(2), 81–84 (1983)
Yao, A.C.: Probabilistic computations: Toward a unified measure of complexity. In: Proc. 18th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 222–227 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barbay, J., Golynski, A., Munro, J.I., Rao, S.S. (2006). Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents. In: Lewenstein, M., Valiente, G. (eds) Combinatorial Pattern Matching. CPM 2006. Lecture Notes in Computer Science, vol 4009. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780441_4
Download citation
DOI: https://doi.org/10.1007/11780441_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35455-0
Online ISBN: 978-3-540-35461-1
eBook Packages: Computer ScienceComputer Science (R0)