Pith. sign in

REVIEW 2 cited by

LakeBench: Benchmarks for Data Discovery over Data Lakes

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 2307.04217 v1 pith:HU4UD2MM submitted 2023-07-09 cs.DB cs.AI

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

Within enterprises, there is a growing need to intelligently navigate data lakes, specifically focusing on data discovery. Of particular importance to enterprises is the ability to find related tables in data repositories. These tables can be unionable, joinable, or subsets of each other. There is a dearth of benchmarks for these tasks in the public domain, with related work targeting private datasets. In LakeBench, we develop multiple benchmarks for these tasks by using the tables that are drawn from a diverse set of data sources such as government data from CKAN, Socrata, and the European Central Bank. We compare the performance of 4 publicly available tabular foundational models on these tasks. None of the existing models had been trained on the data discovery tasks that we developed for this benchmark; not surprisingly, their performance shows significant room for improvement. The results suggest that the establishment of such benchmarks may be useful to the community to build tabular models usable for data discovery in data lakes.

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. LakeMLB: Data Lake Machine Learning Benchmark

    cs.LG 2026-02 conditional novelty 6.0 of 10

    LakeMLB is a new six-dataset benchmark for multi-table machine learning in data lakes; experiments find pretraining helps in Union scenarios and feature augmentation helps in Join scenarios.

  2. TEmBed-T: A Multi-Dimensional Benchmark for Table-Level Embeddings

    cs.DB 2026-07 conditional novelty 5.0 of 10

    No single table-level embedding model leads across retrieval, structural shuffling, and header-free type detection; quality is multi-dimensional.

Pith tools