Search Engines and Web Information Retrieval

  • Alejandro López-Ortiz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3405)


This survey describes the main components of web information retrieval, with emphasis on the algorithmic aspects of web search engine research.


Strongly Connect Component XPath Query Passive Listening Algorithmic Challenge String Match Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Azar, Y., Fiat, A., Karlin, A.R., McSherry, F., Saia, J.: Spectral Analysis of Data. In: Proceedings of ACM Symposium on Theory of Computing (STOC), pp. 619–626 (2001)Google Scholar
  2. 2.
    Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph structure in the Web. In: Proceedings of the 9th international World Wide Web Conference, pp. 309–320 (2000)Google Scholar
  3. 3.
    Chakrabarti, S., Dom, B., Gibson, D., Kleinberg, J., Kumar, S.R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Mining the link structure of the World Wide Web. IEEE Computer (August 1999)Google Scholar
  4. 4.
    Demaine, E.D., López-Ortiz, A., Ian Munro, J.: Adaptive set intersections, unions, and differences. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 743–752 (2000)Google Scholar
  5. 5.
    Demaine, E.D., López-Ortiz, A.: A linear lower bound on index size for text retrieval. Journal of Algorithms 48(1), 2–15 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Geary, R.F., Raman, R., Raman, V.: Succinct ordinal trees with level-ancestor queries. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1–10 (2004)Google Scholar
  7. 7.
    Gibson, D., Kleinberg, J., Raghavan, P.: Inferring web communities from link topology. In: Proceedings of the ACM Conference on Hypertext and Hypermedia, pp. 225–234 (1998)Google Scholar
  8. 8.
    Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In: Proceedings of ACM Symposium on Theory of Computing (STOC), pp. 397–406 (1999)Google Scholar
  9. 9.
    He, M., Ian Munro, J., Srinivasa Rao, S.: A Categorization Theorem on Suffix Arrays with Applications to Space-efficient Text Indexes. To appear in proceedings of ACM-SIAM Symposium on the Discrete Algorithms, SODA (2005)Google Scholar
  10. 10.
    Henzinger, M.R.: Algorithmic Challenges in Web Search Engines. Internet Mathematics 1(1), 115–126 (2004)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Kleinberg, J.: Authoritative sources in a hyperlinked environment. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 668–677 (1998)Google Scholar
  12. 12.
    Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing 22(5), 935–948 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Muthukrishnan, S.: Efficient algorithms for document retrieval problems. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms, SODA (2002)Google Scholar
  14. 14.
    Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank Citation Ranking: Bringing Order to the Web. Technical Report, Department of Computer Science, Stanford University (1999-66)Google Scholar
  15. 15.
    Ukkonen, E.: On-Line Construction of Suffix Trees. Algorithmica 14(3), 249–260 (1995)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Alejandro López-Ortiz
    • 1
  1. 1.School of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations