Shape-Agnostic Table Overlap Discovery: A Maximum Common Subhypergraph Approach
Summary: Introduces SALTO, a shape-agnostic overlap notion capturing arbitrary, non-contiguous matching cells beyond maximal rectangles. Models tables as hypergraphs and solves maximum common subhypergraph via HyperSplit, a structurally pruned branch-and-bound algorithm with tolerance-based acceleration. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Ge Lee (Commonwealth Scientific and Industrial Research Organisation; Royal Melbourne Institute of Technology University; University of Queensland)
- 2. Shixun Huang (University of Wollongong)
- 3. Zhifeng Bao (University of Queensland)
- 4. Felix Naumann (Hasso Plattner Institute; University of Potsdam)
- 5. Shazia Sadiq (University of Queensland)
- 6. Yanchang Zhao (Commonwealth Scientific and Industrial Research Organisation; Data61)
BibTeX Citation
@inproceedings{lee_sigmod26,
title = {{Shape-Agnostic Table Overlap Discovery: A Maximum Common Subhypergraph Approach}},
author = {Lee, Ge and Huang, Shixun and Bao, Zhifeng and Naumann, Felix and Sadiq, Shazia and Zhao, Yanchang},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3802108},
url = {https://dl.acm.org/doi/10.1145/3802108},
year = {2026}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 29 of 29 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 |
|---|---|---|---|---|
| 1 | 1,055 | Answering Table Queries on the Web using Column Keywords | 2012 | VLDB |
| 2 | 10,762 | Fast Hypertree Decompositions via Linear Programming: Fractional and Generalized | 2025 | SIGMOD |
| 3 | 10,204 | Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching | 2026 | SIGMOD |
| 4 | 9,693 | Subgraph Matching: A New Decomposition Based Approach | 2025 | VLDB |
| 5 | 7,203 | On The Recognition Of Coverings Of Acyclic Database Hypergraphs | 1983 | PODS |
| 6 | 878 | Table Union Search on Open Data | 2018 | VLDB |
| 7 | 8,844 | Hitting Set Enumeration with Partial Information for Unique Column Combination Discovery | 2020 | VLDB |
| 8 | 3,724 | Overlap Set Similarity Joins with Theoretical Guarantees | 2018 | SIGMOD |
| 9 | 10,783 | Table Overlap Estimation through Graph Embeddings | 2025 | SIGMOD |
| 10 | 11,167 | Determining the Largest Overlap between Tables | 2024 | SIGMOD |