Efficient Query Answering in the Representative Instance Approach

Summary: Defines "simple chase join expressions"—a class of project-join plans—to compute X-total projections of the representative instance under functional dependencies on independent schemes, avoiding whole-database materialization. Shows every X-total projection equals a union of such expressions, provides efficient generation and a lightweight optimization algorithm to minimize join operations. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 733
Venue: PODS
Year: 1985
Pagerank: 7.3196924e-05
Overall Rank: 3,551 | 75.64%
DOI: 10.1145/325405.325429

Incoming Non-self Citations Over Time

Authors

1. Paolo Atzeni (National Research Council of Italy; University of Toronto)
2. Edward P. F. Chan (University of Toronto)

BibTeX Citation

@inproceedings{atzeni_pods85,
        address = {New York, NY, USA},
        series = {{PODS} '85},
        title = {{Efficient Query Answering in the Representative Instance Approach}},
        url = {https://dl.acm.org/doi/10.1145/325405.325429},
        doi = {10.1145/325405.325429},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Atzeni, Paolo and Chan, Edward P. F.},
        year = {1985}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,417	On Computing Restricted Projections of Representative Instances	1985	PODS	0.00010839353
5,351	Constant Time Maintenance or The Triumph of the fd.	1986	PODS	6.2533477e-05
8,297	Independence-reducible Database Schemes	1988	PODS	5.4574671e-05
8,298	A Characterization of Constant-time-maintainability for BCNF Database Schemes	1988	SIGMOD	5.4574671e-05
13,120	Polynomial Time Designs toward Both BCNF and Efficient Data Manipulation	1990	SIGMOD	5.093636e-05
13,121	Efficient Updates to Independent Schemes in the Weak Instance Model	1990	SIGMOD	5.093636e-05
13,132	Updating Databases in the Weak Instance Model	1989	PODS	5.093636e-05
13,171	On Designing Database Schemes Bounded or Constant-time-maintainable with respect to Functional Dependencies	1987	PODS	5.093636e-05
13,184	Independent Database Schemes Under Functional and Inclusion Dependencies	1987	VLDB	5.093636e-05
13,193	On the Properties and Characterisation of Connection-trap-free Schemes (Extended Abstract)	1986	PODS	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
40	Testing Implications Of Data Dependencies	1979	SIGMOD	0.00046918506
742	Independent Database Schemas (Extended Abstract)	1982	PODS	0.00014426824
1,111	The U. R. Strikes Back	1982	PODS	0.00012131168
1,537	Assumptions in Relational Database Theory	1982	PODS	0.00010460647
2,289	Windows On The World	1983	SIGMOD	8.7994393e-05
6,153	Independent and Separable Database Schemes	1983	PODS	5.9569613e-05
7,132	Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions	1984	SIGMOD	5.694968e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	8,301	The Equivalence of Solving Queries and Producing Tree Projections (Extended Abstract)	1986	PODS
2	5,383	Compressed Representations of Conjunctive Query Results	2018	PODS
3	10,296	Succinct Structure Representations for Efficient Query Optimization	2026	SIGMOD
4	4,369	Semantic Query Optimization in the Presence of Types	2010	PODS
5	10,169	Towards Output-Optimal Uniform Sampling and Approximate Counting for Join-Project Queries	2026	PODS
6	8,970	Understanding Queries by Conditional Instances	2022	SIGMOD
7	266	Can We Use The Universal Instance Assumption Without Using Nulls?	1981	SIGMOD
8	9,259	Querying Weak Instances	1984	PODS
9	1,417	On Computing Restricted Projections of Representative Instances	1985	PODS
10	7,132	Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions	1984	SIGMOD