Abstract
This survey describes the main components of web information retrieval, with emphasis on the algorithmic aspects of web search engine research.
A shorter version of this survey appears as part of “Algorithmic Foundations of the Internet”, A. López-Ortiz, SIGACT News, v. 36, no. 2, June 2005.
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
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)
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)
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)
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)
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)
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)
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)
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)
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)
Henzinger, M.R.: Algorithmic Challenges in Web Search Engines. Internet Mathematics 1(1), 115–126 (2004)
Kleinberg, J.: Authoritative sources in a hyperlinked environment. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 668–677 (1998)
Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing 22(5), 935–948 (1993)
Muthukrishnan, S.: Efficient algorithms for document retrieval problems. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms, SODA (2002)
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)
Ukkonen, E.: On-Line Construction of Suffix Trees. Algorithmica 14(3), 249–260 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
López-Ortiz, A. (2005). Search Engines and Web Information Retrieval . In: López-Ortiz, A., Hamel, A.M. (eds) Combinatorial and Algorithmic Aspects of Networking. CAAN 2004. Lecture Notes in Computer Science, vol 3405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11527954_18
Download citation
DOI: https://doi.org/10.1007/11527954_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27873-3
Online ISBN: 978-3-540-31860-6
eBook Packages: Computer ScienceComputer Science (R0)