The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Parallel crawlers
Abstract
In this paper we study how we can design an effective parallel crawler. As the size of the Web grows, it becomes imperative to parallelize a crawling process, in order to finish downloading pages in a reasonable amount of time. We first propose multiple architectures for a parallel crawler and identify fundamental issues related to parallel crawling. Based on this understanding, we then propose metrics to evaluate a parallel crawler, and compare the proposed architectures using 40 million pages collected from the Web. Our results clarify the relative merits of each architecture and provide a good guideline on when to adopt which architecture.
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
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
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
Principles of Distributed Database Systems
Özsu, M. T., & Valduriez, P. (2020) · Springer eBooks · doi:10.1007/978-3-030-26253-2 · Cited by 2,345
Focused crawling: a new approach to topic-specific Web resource discovery
Chakrabarti, S., van den Berg, M., & Dom, B. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00052-3 · Cited by 1,486
Tanenbaum, A. S., & Van Renesse, R. (1985) · ACM Computing Surveys · doi:10.1145/6041.6074 · Cited by 990
Efficient crawling through URL ordering
Cho, J., Garcia-Molina, H., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00108-1 · Cited by 837
Self-citationMercator: A scalable, extensible Web crawler
Heydon, A., & Najork, M. (1999) · World Wide Web · doi:10.1023/a:1019213109274 · Cited by 582
Focused Crawling Using Context Graphs
Diligenti, M., Coetzee, F., Lawrence, S., Giles, C. L., & Gori, M. (2000) · Cited by 533
The Evolution of the Web and Implications for an Incremental Crawler
Cho, J. J., & García-Molina, H. (2000) · Cited by 499
Self-citationSynchronizing a database to improve freshness
Cho, J., & Garcia-Molina, H. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335391 · Cited by 346
Self-citationFinding What People Want : Experiences with the WebCrawler
Pinkerton, B. (1994) · Medical Entomology and Zoology · Cited by 266
GENVL and WWWW: Tools for taming the Web
McBryan, O. A. (1994) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(94)90149-x · Cited by 242
Synchronizing a database to improve freshness
Cho, J. J., & García-Molina, H. (2000) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/342009.335391 · Cited by 170
Self-citationOptimal robot scheduling for Web search engines
Coffman, E. G., Liu, Z., & Weber, R. (1998) · Journal of Scheduling · Cited by 117
Najork, M., & Heydon, A. (2002) · Massive computing · doi:10.1007/978-1-4615-0005-6_2 · Cited by 100
Cited by
Chen, M., Mao, S., & Liu, Y. (2014) · Mobile Networks and Applications · doi:10.1007/s11036-013-0489-0 · Cited by 2,913
Toward Scalable Systems for Big Data Analytics: A Technology Tutorial
Hu, H., Wen, Y., Chua, T.-S., & Li, X. (2014) · IEEE Access · doi:10.1109/access.2014.2332453 · Cited by 1,099
UbiCrawler: a scalable fully distributed Web crawler
Boldi, P., Codenotti, B., Santini, M., & Vigna, S. (2004) · Software: Practice and Experience · doi:10.1002/spe.587 · Cited by 560
Big Data: Survey, Technologies, Opportunities, and Challenges
Khan, N., Yaqoob, I., Hashem, I. A. T., Inayat, Z., Mahmoud Ali, W. K., Alam, M., Shiraz, M., & Gani, A. (2014) · The Scientific World Journal · doi:10.1155/2014/712826 · Cited by 547
Olston, C., & Najork, M. (2010) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000017 · Cited by 370
Metadata
- Authors
- Cho, J., & Garcia-Molina, H.
- Venue
- Proceedings of the 11th international conference on World Wide Web
- Publisher
- ACM
- Published
- 2002-05-07
- Pages
- 124-135
- OpenAlex
- W2295141584
- Cited by
- 312
- References
- 15
- FWCI
- 11.99
- Type
- conference paper
- Language
- en
- Open access
- closed
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
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.