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)

Paper ID: hc6a3fb7a6e5232ea
Venue: PODS
Year: 1996
Pagerank: 7.9375001e-05
Overall Rank: 2,853 | 80.83%
DOI: 10.1145/237661.237717

Incoming Non-self Citations Over Time

Authors

1. Anand Rajaraman (Stanford University)
2. Jeffrey D. Ullman (Stanford University)

BibTeX Citation

@inproceedings{rajaraman_pods96,
        address = {New York, NY, USA},
        series = {{PODS} '96},
        title = {{Integrating Information by Outerjoins and Full Disjunctions (Extended Abstract)}},
        url = {https://dl.acm.org/doi/10.1145/237661.237717},
        doi = {10.1145/237661.237717},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Rajaraman, Anand and Ullman, Jeffrey D.},
        year = {1996}
}

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
117	Querying Heterogeneous Information Sources Using Source Descriptions	1996	VLDB	0.00031616101
1,683	The iBench Integration Metadata Generator	2016	VLDB	9.8804382e-05
3,133	Matching Twigs in Probabilistic XML	2007	VLDB	7.6103114e-05
4,159	Integrating Data Lake Tables	2023	VLDB	6.7687144e-05
4,262	Maximally Joining Probabilistic Data	2007	PODS	6.6954238e-05
4,594	Queries with Incomplete Answers over Semistructured Data	1999	PODS	6.5106109e-05
5,432	Fast Shapley Value Computation in Data Assemblage Tasks as Cooperative Simple Games	2024	SIGMOD	6.1310946e-05
6,238	MapMerge: Correlating Independent Schema Mappings	2010	VLDB	5.83873e-05
6,502	Full Disjunctions: Polynomial-Delay Iterators in Action	2006	VLDB	5.7622992e-05
8,241	An Incremental Algorithm for Computing Ranked Full Disjunctions	2005	PODS	5.3686457e-05
9,795	Computing Full Disjunctions	2003	PODS	5.1241373e-05

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
117	Querying Heterogeneous Information Sources Using Source Descriptions	1996	VLDB	0.00031616101
1,199	Outerjoins as Disjunctions	1994	SIGMOD	0.00011559895

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	1,560	Joining Extractions of Regular Expressions	2018	PODS
2	12,906	Incompleteness in Information Integration	2008	VLDB
3	13,526	On the Decomposition of Join Dependencies	1984	PODS
4	1,199	Outerjoins as Disjunctions	1994	SIGMOD
5	7,346	On The Recognition Of Coverings Of Acyclic Database Hypergraphs	1983	PODS
6	13,323	Adding Disjunction to Datalog (Extended Abstract)	1994	PODS
7	7,189	Connections in Acyclic Hypergraphs -- Extended Abstract	1982	PODS
8	6,502	Full Disjunctions: Polynomial-Delay Iterators in Action	2006	VLDB
9	8,241	An Incremental Algorithm for Computing Ranked Full Disjunctions	2005	PODS
10	9,795	Computing Full Disjunctions	2003	PODS