Pith. sign in

REVIEW 2 cited by

Alaska: A Flexible Benchmark for Data Integration Tasks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2101.11259 v2 pith:R2JMYDE7 submitted 2021-01-27 cs.DB

classification cs.DB
keywords dataintegrationbenchmarktasksalaskabenchmarksdatasetdifficult
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Data integration is a long-standing interest of the data management community and has many disparate applications, including business, science and government. We have recently witnessed impressive results in specific data integration tasks, such as Entity Resolution, thanks to the increasing availability of benchmarks. A limitation of such benchmarks is that they typically come with their own task definition and it can be difficult to leverage them for complex integration pipelines. As a result, evaluating end-to-end pipelines for the entire data integration process is still an elusive goal. In this work, we present Alaska, the first benchmark based on real-world dataset to support seamlessly multiple tasks (and their variants) of the data integration pipeline. The dataset consists of ~70k heterogeneous product specifications from 71 e-commerce websites with thousands of different product attributes. Our benchmark comes with profiling meta-data, a set of pre-defined use cases with diverse characteristics, and an extensive manually curated ground truth. We demonstrate the flexibility of our benchmark by focusing on several variants of two crucial data integration tasks, Schema Matching and Entity Resolution. Our experiments show that our benchmark enables the evaluation of a variety of methods that previously were difficult to compare, and can foster the design of more holistic data integration solutions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. TransClean: Finding False Positives in Multi-Source Entity Matching under Real-World Conditions via Transitive Consistency

    cs.DB 2025-06 conditional novelty 6.0 of 10

    TransClean uses a model's predictions on transitive, implied record pairs to locate and remove false positive matches in multi-source entity resolution.

  2. In-context Clustering-based Entity Resolution with Large Language Models: A Design Space Exploration

    cs.DB 2025-06 conditional novelty 6.0 of 10

    In-context clustering, where an LLM groups sets of records directly, can perform entity resolution with far fewer API calls than pairwise matching, though quality gains depend heavily on an embedding-based guardrail.

Pith tools