Integrating Information by Outerjoins and Full Disjunctions (Extended Abstract)
Summary: Characterize when a full disjunction (preserving all possible connections among facts) can be obtained by a sequence of natural outerjoins, driven by integrating scattered web information. Show necessary and sufficient condition: the relation-scheme hypergraph must be connected and γ-acyclic (Fagin). (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 11 of 11 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 127 | Querying Heterogeneous Information Sources Using Source Descriptions | 1996 | VLDB | 0.00044642203 |
| 1,883 | The iBench Integration Metadata Generator | 2016 | VLDB | 0.00010215862 |
| 2,978 | Matching Twigs in Probabilistic XML | 2007 | VLDB | 7.7845728e-05 |
| 3,681 | Queries with Incomplete Answers over Semistructured Data | 1999 | PODS | 6.8492288e-05 |
| 3,929 | Maximally Joining Probabilistic Data | 2007 | PODS | 6.6248763e-05 |
| 4,859 | Integrating Data Lake Tables | 2023 | VLDB | 5.8732433e-05 |
| 5,141 | Full Disjunctions: Polynomial-Delay Iterators in Action | 2006 | VLDB | 5.6673499e-05 |
| 6,155 | MapMerge: Correlating Independent Schema Mappings | 2010 | VLDB | 5.1802715e-05 |
| 6,262 | Fast Shapley Value Computation in Data Assemblage Tasks as Cooperative Simple Games | 2024 | SIGMOD | 5.1349507e-05 |
| 8,072 | An Incremental Algorithm for Computing Ranked Full Disjunctions | 2005 | PODS | 4.5922874e-05 |
| 9,511 | Computing Full Disjunctions | 2003 | PODS | 4.3340927e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 127 | Querying Heterogeneous Information Sources Using Source Descriptions | 1996 | VLDB | 0.00044642203 |
| 1,032 | Outerjoins as Disjunctions | 1994 | SIGMOD | 0.00014544529 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,324 | The Complexity of Conjunctive Queries with Degree 2 | 2022 | PODS | 4.1945683e-05 |
| 12,416 | Incompleteness in Information Integration | 2008 | VLDB | 4.1945683e-05 |
| 13,031 | On the Decomposition of Join Dependencies | 1984 | PODS | 4.1945683e-05 |
| 1,032 | Outerjoins as Disjunctions | 1994 | SIGMOD | 0.00014544529 |
| 6,761 | On The Recognition Of Coverings Of Acyclic Database Hypergraphs | 1983 | PODS | 4.9348368e-05 |
| 12,833 | Adding Disjunction to Datalog (Extended Abstract) | 1994 | PODS | 4.1945683e-05 |
| 6,240 | Connections in Acyclic Hypergraphs -- Extended Abstract | 1982 | PODS | 5.1417208e-05 |
| 5,141 | Full Disjunctions: Polynomial-Delay Iterators in Action | 2006 | VLDB | 5.6673499e-05 |
| 8,072 | An Incremental Algorithm for Computing Ranked Full Disjunctions | 2005 | PODS | 4.5922874e-05 |
| 9,511 | Computing Full Disjunctions | 2003 | PODS | 4.3340927e-05 |