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: 1093
Venue: PODS
Year: 1996
Pagerank: 8.119781e-05
Overall Rank: 2,791 | 80.86%
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.00032192665
1,652	The iBench Integration Metadata Generator	2016	VLDB	0.00010109142
3,075	Matching Twigs in Probabilistic XML	2007	VLDB	7.7839831e-05
4,123	Integrating Data Lake Tables	2023	VLDB	6.8878137e-05
4,187	Maximally Joining Probabilistic Data	2007	PODS	6.8456588e-05
4,495	Queries with Incomplete Answers over Semistructured Data	1999	PODS	6.6623097e-05
5,441	Fast Shapley Value Computation in Data Assemblage Tasks as Cooperative Simple Games	2024	SIGMOD	6.2184806e-05
6,104	MapMerge: Correlating Independent Schema Mappings	2010	VLDB	5.9754714e-05
6,373	Full Disjunctions: Polynomial-Delay Iterators in Action	2006	VLDB	5.8946564e-05
8,071	An Incremental Algorithm for Computing Ranked Full Disjunctions	2005	PODS	5.4935818e-05
9,646	Computing Full Disjunctions	2003	PODS	5.243371e-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.00032192665
1,176	Outerjoins as Disjunctions	1994	SIGMOD	0.00011809075

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	1,528	Joining Extractions of Regular Expressions	2018	PODS
2	12,610	Incompleteness in Information Integration	2008	VLDB
3	13,230	On the Decomposition of Join Dependencies	1984	PODS
4	1,176	Outerjoins as Disjunctions	1994	SIGMOD
5	7,203	On The Recognition Of Coverings Of Acyclic Database Hypergraphs	1983	PODS
6	13,027	Adding Disjunction to Datalog (Extended Abstract)	1994	PODS
7	7,053	Connections in Acyclic Hypergraphs -- Extended Abstract	1982	PODS
8	6,373	Full Disjunctions: Polynomial-Delay Iterators in Action	2006	VLDB
9	8,071	An Incremental Algorithm for Computing Ranked Full Disjunctions	2005	PODS
10	9,646	Computing Full Disjunctions	2003	PODS