The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Challenges in web search engines
Open accessAbstract
This article presents a high-level discussion of some problems in information retrieval that are unique to web search engines. The goal is to raise awareness and stimulate research in these areas.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1998) · Symposium on Discrete Algorithms · doi:10.5555/314613.315045 · Cited by 1,814
On the resemblance and containment of documents
Broder, A. Z. (2002) · Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171) · doi:10.1109/sequen.1997.666900 · Cited by 1,698
Health Information on the Internet: Accessibility, Quality, and Readability in English and Spanish
Berland, G. K., Elliott, M. N., Morales, L. S., Algazy, J. I., Kravitz, R. L., Broder, M. S., Kanouse, D. E., Muñoz, J. A., Puyol, J.-A., Lara, M., et al. (2001) · JAMA · doi:10.1001/jama.285.20.2612 · Cited by 1,208
Analysis of a very large web search engine query log
Silverstein, C., Marais, H., Henzinger, M., & Moricz, M. (1999) · ACM SIGIR Forum · doi:10.1145/331403.331405 · Cited by 1,153
Self-citationTrawling the Web for emerging cyber-communities
Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00040-7 · Cited by 1,000
Copy detection mechanisms for digital documents
Brin, S., Davis, J., & García-Molina, H. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223855 · Cited by 479
Effective site finding using link anchor information
Craswell, N., Hawking, D., & Robertson, S. (2001) · Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/383952.383999 · Cited by 269
Extracting schema from semistructured data
Nestorov, S., Abiteboul, S., & Motwani, R. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276331 · Cited by 224
Self-citationChakrabarti, S. (2001) · Proceedings of the 10th international conference on World Wide Web · doi:10.1145/371920.372054 · Cited by 159
Cited by
Langville, A., & Meyer, C. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129091 · Cited by 894
Detecting spam web pages through content analysis
Ntoulas, A., Najork, M., Manasse, M., & Fetterly, D. (2006) · Proceedings of the 15th international conference on World Wide Web · doi:10.1145/1135777.1135794 · Cited by 608
Spam, damn spam, and statistics: using statistical analysis to locate spam web pages
Fetterly, D., Manasse, M., & Najork, M. (2004) · Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004 · doi:10.1145/1017074.1017077 · Cited by 291
Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
Avrachenkov, K., Litvak, N., Nemirovsky, D., & Osipova, N. (2007) · SIAM Journal on Numerical Analysis · doi:10.1137/050643799 · Cited by 250
Mining query logs: turning search usage data into knowledge
Silvestri, F. (2009) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000013 · Cited by 194
Metadata
- Authors
- Henzinger, M. R., Motwani, R., & Silverstein, C.
- Venue
- ACM SIGIR Forum
- Published
- 2002-09
- Volume
- 36
- Issue
- 2
- Pages
- 11-22
- ISSN
- 0163-5840 (ISSN-L)
- OpenAlex
- W252574719
- Cited by
- 307
- References
- 15
- FWCI
- 50.86
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Challenges in web search engines. https://app.cochat.ai/papers/10.1145/792550.792553
- The paper
- Henzinger, M. R., Motwani, R., & Silverstein, C. (2002). Challenges in web search engines. ACM SIGIR Forum. https://doi.org/10.1145/792550.792553
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
