Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 715

The DOI matches its Crossref record.

Map-reduce-merge: simplified relational data processing on large clusters

Yang, Hung-chih, Dasdan, Ali, Hsiao, Ruey-Lung, Parker, D. Stott·2007·Proceedings of the 2007 ACM SIGMOD international conference on Management of data

Abstract

Map-Reduce is a programming model that enables easy development of scalable parallel applications to process a vast amount of data on large clusters of commodity machines. Through a simple interface with two functions, map and reduce, this model facilitates parallel implementation of many real-world tasks such as data processing jobs for search engines and machine learning.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/1247480.1247602

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.

A few free checks a day · papers already verified open instantly · results are public

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

See all 715

Metadata

Authors
Yang, H.-C., Dasdan, A., Hsiao, R.-L., & Parker, D. S.
Venue
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Publisher
ACM
Published
2007-06-11
Pages
1029-1040
ISSN
0730-8078 (ISSN-L)
OpenAlex
W2154894831
Cited by
715
References
0
FWCI
35.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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Map-reduce-merge: simplified relational data processing on large clusters. https://app.cochat.ai/papers/10.1145/1247480.1247602
The paper
Yang, H.-C., Dasdan, A., Hsiao, R.-L., & Parker, D. S. (2007). Map-reduce-merge: simplified relational data processing on large clusters. Proceedings of the 2007 ACM SIGMOD international conference on Management of data. https://doi.org/10.1145/1247480.1247602

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.