Identifying Insufficient Data Coverage in Databases with Multiple Relations
Summary: Identifies insufficient coverage across attribute intersections in multi-table data without costly joins. Proposes an index-based scheme and P-WALK to traverse the attribute lattice, enabling parallel, memory-efficient, approximate coverage analysis. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yin Lin
- 2. Yifan Guan
- 3. Abolfazl Asudeh
- 4. H. V. Jagadish
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,942 | SliceLine: Fast, Linear-Algebra-based Slice Finding for ML Model Debugging | 2021 | SIGMOD | 0.00010010569 |
| 5,982 | Responsible Data Integration: Next-generation Challenges | 2022 | SIGMOD | 5.2409386e-05 |
| 6,462 | Tailoring Data Source Distributions for Fairness-aware Data Integration | 2021 | VLDB | 5.0479645e-05 |
| 6,895 | Identifying Insufficient Data Coverage for Ordinal Continuous-Valued Attributes | 2021 | SIGMOD | 4.8879337e-05 |
| 7,665 | Fairly Evaluating and Scoring Items in a Data Set | 2020 | VLDB | 4.6799478e-05 |
| 9,766 | View-based Explanations for Graph Neural Networks | 2024 | SIGMOD | 4.2815042e-05 |
| 11,071 | Chameleon: Foundation Models for Fairness-aware Multi-modal Data Augmentation to Enhance Coverage of Minorities | 2024 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 16 of 16 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
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,193 | Fast Computation of Sparse Datacubes | 1997 | VLDB | 0.00013412915 |
| 3,461 | Leveraging Set Relations in Exact Set Similarity Join | 2017 | VLDB | 7.0696567e-05 |
| 8,521 | Computing A Well-Representative Summary of Conjunctive Query Results | 2024 | PODS | 4.4893996e-05 |
| 6,743 | An Algorithm For Servicing Multi-Relational Queries | 1977 | SIGMOD | 4.9383908e-05 |
| 7,829 | Optimization of Multiple-Relation Multiple-Disjunct Queries | 1988 | PODS | 4.6373918e-05 |
| 12,199 | Efficient Rank Join with Aggregation Constraints | 2011 | VLDB | 4.1905499e-05 |
| 8,851 | Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery | 2020 | VLDB | 4.4322123e-05 |
| 1,757 | Efficient Processing of Joins on Set-valued Attributes | 2003 | SIGMOD | 0.00010659352 |
| 6,271 | Identifying the Extent of Completeness of Query Answers over Partially Complete Databases | 2015 | SIGMOD | 5.1273783e-05 |
| 8,963 | An Effective Syntax for Bounded Relational Queries | 2016 | SIGMOD | 4.4165156e-05 |