The DOI matches its Crossref record.
Graph sketches: sparsification, spanners, and subgraphs
Abstract
When processing massive data sets, a core task is to construct synopses of the data. To be useful, a synopsis data structure should be easy to construct while also yielding good approximations of the relevant properties of the data set. A particularly useful class of synopses are sketches, i.e., those based on linear projections of the data. These are applicable in many models including various parallel, stream, and compressed sensing settings. A rich body of analytic and empirical work exists for sketching numerical data such as the frequencies of a set of entities. Our work investigates graph sketching where the graphs of interest encode the relationships between these entities. The main challenge is to capture this richer structure and build the necessary synopses with only linear measurements.
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
Cited by
Graph stream algorithms: a survey
McGregor, A. (2014) · ACM SIGMOD Record · doi:10.1145/2627692.2627694 · Cited by 357
Self-citationUNICORN: Runtime Provenance-Based Detector for Advanced Persistent Threats
Han, X., Pasquier, T., Bates, A., Mickens, J., & Seltzer, M. (2020) · Proceedings 2020 Network and Distributed System Security Symposium · doi:10.14722/ndss.2020.24046 · Cited by 349
Graph Summarization Methods and Applications: A Survey
Liu, Y., Safavi, T., Dighe, A., & Koutra, D. (2019) · ACM Computing Surveys · doi:10.1145/3186727 · Cited by 274
Sketched SVD: Recovering Spectral Features from Compressive Measurements
Gilbert, A. C., Park, J. Y., & Wakin, M. B. (2012) · arXiv · doi:10.48550/arxiv.1211.0361 · Cited by 57
Summarizing static and dynamic big graphs
Khan, A., Bhowmick, S. S., & Bonchi, F. (2017) · Proceedings of the VLDB Endowment · doi:10.14778/3137765.3137825 · Cited by 45
Metadata
- Authors
- Ahn, K. J., Guha, S., & McGregor, A.
- Venue
- Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems
- Publisher
- ACM
- Published
- 2012-05-21
- Pages
- 5-14
- OpenAlex
- W1997010704
- Cited by
- 223
- References
- 0
- FWCI
- 16.43
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Graph sketches: sparsification, spanners, and subgraphs. https://app.cochat.ai/papers/10.1145/2213556.2213560
- The paper
- Ahn, K. J., Guha, S., & McGregor, A. (2012). Graph sketches: sparsification, spanners, and subgraphs. Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems. https://doi.org/10.1145/2213556.2213560
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.