Database Paper Browser

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
11188
Venue
VLDB
Year
2015
Pagerank
5.9240851e-05
Overall Rank
4,784 | 66.72%
DOI
-

Incoming Non-self Citations Over Time

Authors

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