DBScholar

Back to papers

Divide & Conquer-based Inclusion Dependency Discovery

Summary: Binder implements a divide-and-conquer IND discovery for unary and n-ary dependencies on datasets that do not fit in memory and without DBMS reliance. It scales to very large data and outperforms state-of-the-art, up to 26x faster than Spider and >2500x vs Mind. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11376
Venue
VLDB
Year
2015
Pagerank
6.7309577e-05
Overall Rank
4,386 | 69.91%
DOI
10.14778/2735479.2735502

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{papenbrock_vldb15,
        title = {{Divide \& Conquer-based Inclusion Dependency Discovery}},
        author = {Papenbrock, Thorsten and Kruse, Sebastian and Quiane-Ruiz, Jorge-Arnulfo and Naumann, Felix},
        journal = {PVLDB},
        series = {{VLDB} '15},
        volume = {8},
        number = {7},
        pages = {774--785},
        doi = {10.14778/2735479.2735502},
        url = {https://doi.org/10.14778/2735479.2735502},
        year = {2015}
}

Incoming Citations (Sorted by Pagerank)

Showing 14 of 14 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers