The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
The webgraph framework I: compression techniques
Abstract
Studying web graphs is often difficult due to their large size. Recently,several proposals have been published about various techniques that allow tostore a web graph in memory in a limited space, exploiting the inner redundancies of the web. The WebGraph framework is a suite of codes, algorithms and tools that aims at making it easy to manipulate large web graphs. This papers presents the compression techniques used in WebGraph, which are centred around referentiation and intervalisation (which in turn are dual to each other). WebGraph can compress the WebBase graph (118 Mnodes, 1 Glinks)in as little as 3.08 bits per link, and its transposed version in as littleas 2.89 bits per link.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
(1999) · Cited by 12,854
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
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
Self-citationTowards compressing Web graphs
Adler, M., & Mitzenmacher, M. (2002) · Proceedings DCC 2001. Data Compression Conference · doi:10.1109/dcc.2001.917151 · Cited by 223
The Connectivity Server: fast access to linkage information on the Web
Bharat, K., Broder, A., Henzinger, M., Kumar, P., & Venkatasubramanian, S. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)80047-0 · Cited by 188
WebBase: a repository of Web pages
Hirai, J., Raghavan, S., Garcia-Molina, H., & Paepcke, A. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00063-3 · Cited by 183
Raghavan, S., & García-Molina, H. (2004) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2003.1260809 · Cited by 180
The Link Database: fast access to graphs of the Web
Randall, K. H., Stata, R., Wickremesinghe, R. G., & Wiener, J. L. (2003) · DCC · doi:10.1109/dcc.2002.999950 · Cited by 146
Compressing the graph structure of the Web
Suel, T., & Yuan, J. (2002) · DCC · doi:10.1109/dcc.2001.917152 · Cited by 134
Cited by
PowerGraph: distributed graph-parallel computation on natural graphs
Gonzalez, J. E., Low, Y., Gu, H., Bickson, D., & Guestrin, C. (2012) · doi:10.5555/2387880.2387883 · Cited by 1,451
Langville, A., & Meyer, C. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129091 · Cited by 894
GraphChi: Large-Scale Graph Computation on Just a PC
Kyrola, A., Blelloch, G. E., & Guestrin, C. (2018) · Figshare · doi:10.1184/r1/6605999 · Cited by 868
Ligra: a lightweight graph processing framework for shared memory
Shun, J., & Blelloch, G. E. (2013) · Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming · doi:10.1145/2442516.2442530 · Cited by 798
Boldi, P., Rosa, M., Santini, M., & Vigna, S. (2011) · Proceedings of the 20th international conference on World wide web · doi:10.1145/1963405.1963488 · Cited by 592
Self-citation
Metadata
- Authors
- Boldi, P., & Vigna, S.
- Venue
- Proceedings of the 13th international conference on World Wide Web
- Publisher
- ACM
- Published
- 2004-05-17
- Pages
- 595-602
- OpenAlex
- W1994727615
- Cited by
- 1,201
- References
- 9
- FWCI
- 12.14
- 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.