Abstract
In [3] we introduced an adaptive algorithm for computing the intersection of k sorted sets within a factor of at most 8k comparisons of the information-theoretic lower bound under a model that deals with an encoding of the shortest proof of the answer. This adaptive algorithm performs better for “burstier” inputs than a straightforward worst-case optimal method. Indeed, we have shown that, subject to a reasonable measure of instance difficulty, the algorithm adapts optimally up to a constant factor. This paper explores how this algorithm behaves under actual data distributions, compared with standard algorithms. We present experiments for searching 114 megabytes of text from the World Wide Web using 5,000 actual user queries from a commercial search engine. From the experiments, it is observed that the theoretically optimal adaptive algorithm is not always the optimal in practice, given the distribution of WWW text data. We then proceed to study several improvement techniques for the standard algorithms. These techniques combine improvements suggested by the observed distribution of the data as well as the theoretical results from [3]. We perform controlled experiments on these techniques to determine which ones result in improved performance, resulting in an algorithm that outperforms existing algorithms in most cases.
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
R. Baeza-Yates. Efficient Text Searching. PhD thesis, Department of Computer Science, University of Waterloo, 1989.
Svante Carlsson, Christos Levcopoulos, and Ola Petersson. Sublinear merging and natural mergesort. Algorithmica, 9:629–648, 1993.
Erik D. Demaine, Alejandro López-Ortiz, and J. Ian Munro. Adaptive set intersections, unions, and differences. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 743–752, San Francisco, California, January 2000.
Vladimir Estivill-Castro and Derick Wood. A survey of adaptive sorting algorithms. A CM Computing Surveys, 24(4):441–476, December 1992.
William Frakes and Richardo Baeza-Yates. Information Retrieval. Prentice Hall, 1992.
F. K. Hwang. Optimal merging of 3 elements with n elements. SIAM Journal on Computing, 9(2):298–320, 1980.
F. K. Hwang and S. Lin. A simple algorithm for merging two disjoint linearly ordered sets. SIAM Journal on Computing, 1(1):31–39, 1980.
Michael Lesk. “Real world” searching panel at SIGIR 1997. SIGIR Forum, 32(1), Spring 1998.
U. Manber and G. Myers. Suffix arrays: A new method for on-line string searchs. In Proceedings of the 1st Symposium on Discrete Algorithms, pages 319–327, 1990.
Alistair Moffat, Ola Petersson, and Nicholas C. Wormald. A tree-based Mergesort. Acta Informatica, 35(9):775–793, August 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Demaine, E.D., López-Ortiz, A., Ian Munro, J. (2001). Experiments on Adaptive Set Intersections for Text Retrieval Systems. In: Buchsbaum, A.L., Snoeyink, J. (eds) Algorithm Engineering and Experimentation. ALENEX 2001. Lecture Notes in Computer Science, vol 2153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44808-X_7
Download citation
DOI: https://doi.org/10.1007/3-540-44808-X_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42560-1
Online ISBN: 978-3-540-44808-2
eBook Packages: Springer Book Archive