Skip to main content
Springer Nature Link
Log in

Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences

  • Conference paper
String Processing and Information Retrieval (SPIRE 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3772))

Included in the following conference series:

Abstract

This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on average less comparisons than the total number of elements of both inputs (n and m respectively) when n=αm (α > 1). We can find applications of this algorithm on query processing in Web search engines, where large intersections, or differences, must be performed fast. In this work we concentrate in studying the behavior of the algorithm in practice, using for the experiments test data that is close to the actual conditions of its applications. We compare the efficiency of the algorithm with other intersection algorithm and we study different optimizations, showing that the algorithm is more efficient than the alternatives in most cases, especially when one of the sequences is much larger than the other.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. 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)

    Chapter  Google Scholar 

  2. Baeza-Yates, R.A.: Efficient Text Serching. PhD thesis, Dept. of Computer Science, University of Waterloo, Also as Research Report CS-89-17 (May 1989)

    Google Scholar 

  3. Baeza-Yates, R., Bradford, P.G., Culberson, J.C., Rawlins, G.J.E.: The Complexity of Multiple Searching, unpublished manuscript (1993)

    Google Scholar 

  4. Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval, p. 513. ACM Press/Addison-Wesley (1999)

    Google Scholar 

  5. Baeza-Yates, R., Sainte-Jean, F.: A Three Level Search Engine Index bases in Query Log Distribution. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol. 2857, pp. 56–65. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  6. Baeza-Yates, R.: Query Usage Mining in Search Engines. In: Scime, A. (ed.) Web Mining: Applications and Techniques, Idea Group, USA (2004)

    Google Scholar 

  7. Baeza-Yates, R., Hurtado, C., Mendoza, M., Dupret, G.: Modeling User Search Behavior, LA-WEB 2005. IEEE CS Press, Los Alamitos (2005)

    Google Scholar 

  8. Barbay, J., Kenyon, C.: Adaptive Intersection and t-Threshold Problems. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, pp. 390–399 (January 2002)

    Google Scholar 

  9. Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. In: 7th WWW Conference, Brisbane, Australia (April 1998)

    Google Scholar 

  10. Demaine, E.D., López-Ortiz, A., Munro, J.I.: Adaptive set intersections, unions, and differences. In: Proceedings of the 11th Annual ACM-SIAM Symposium, on Discrete Algorithms, San Francisco, California, pp. 743–752 (January 2000)

    Google Scholar 

  11. 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. LNCS. Springer, Washington, DC (2001)

    Google Scholar 

  12. Paul, D., Kurt, M., Rajeev, R., Christian, U.: Lower Bounds for Set Intersection Queries. In: Proceedings of the 4th Annual Symposium on Discrete Algorithms, pp. 194–201 (1993)

    Google Scholar 

  13. David, D., Richard, L.: On the Complexity of Computations Under Varying Sets of Primitives. Journal of Computer and Systems Sciences 18, 86–91 (1979)

    Article  MATH  Google Scholar 

  14. Hwang, F.K., Lin, S.: A Simple algorithm for merging two disjoint linearly ordered lists. SIAM J. on Computing 1, 31–39 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  15. Rawlins Gregory, J.E.: Compared to What?: An Introduction to the Analysis of Algorithms. Computer Science Press/W. H. Freeman (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Web Research, Department of Computer Science, University of Chile, Blanco Encalada, 2120, Santiago, Chile

    Ricardo Baeza-Yates & Alejandro Salinger

Authors
  1. Ricardo Baeza-Yates
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alejandro Salinger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Toronto,  

    Mariano Consens

  2. Dept. of Computer Science, University of Chile,  

    Gonzalo Navarro

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baeza-Yates, R., Salinger, A. (2005). Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences. In: Consens, M., Navarro, G. (eds) String Processing and Information Retrieval. SPIRE 2005. Lecture Notes in Computer Science, vol 3772. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11575832_2

Download citation

  • DOI: https://doi.org/10.1007/11575832_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29740-6

  • Online ISBN: 978-3-540-32241-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics