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: 734
Venue: PODS
Year: 1985
Pagerank: 8.5916172e-05
Overall Rank: 2,531 | 82.42%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Paolo Atzeni
2. Edward P. F. Chan

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,167	On Computing Restricted Projections of Representative Instances	1985	PODS	0.0001354084
5,322	Constant Time Maintenance or The Triumph of the fd.	1986	PODS	5.56739e-05
7,982	Independence-reducible Database Schemes	1988	PODS	4.6089395e-05
7,983	A Characterization of Constant-time-maintainability for BCNF Database Schemes	1988	SIGMOD	4.6089395e-05
12,935	Polynomial Time Designs toward Both BCNF and Efficient Data Manipulation	1990	SIGMOD	4.1905499e-05
12,936	Efficient Updates to Independent Schemes in the Weak Instance Model	1990	SIGMOD	4.1905499e-05
12,947	Updating Databases in the Weak Instance Model	1989	PODS	4.1905499e-05
12,984	On Designing Database Schemes Bounded or Constant-time-maintainable with respect to Functional Dependencies	1987	PODS	4.1905499e-05
12,997	Independent Database Schemes Under Functional And Inclusion Dependencies	1987	VLDB	4.1905499e-05
13,006	On the Properties and Characterisation of Connection-trap-free Schemes (Extended Abstract)	1986	PODS	4.1905499e-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
38	Testing Implications Of Data Dependencies	1979	SIGMOD	0.0007528369
500	Independent Database Schemas (Extended Abstract)	1982	PODS	0.00021622167
924	The U. R. Strikes Back	1982	PODS	0.00015249498
1,062	Assumptions in Relational Database Theory	1982	PODS	0.00014353951
1,965	Windows On The World	1983	SIGMOD	9.9176387e-05
3,383	Independent and Separable Database Schemes	1983	PODS	7.1535089e-05
7,070	Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions	1984	SIGMOD	4.8380576e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
58	Efficient Optimization of a Class of Relational Expressions	1978	SIGMOD	0.00064817807
8,850	Efficient Approximations of Conjunctive Queries	2012	PODS	4.4324268e-05
1,502	Discovering Queries based on Example Tuples	2014	SIGMOD	0.00011614522
7,987	The Equivalence of Solving Queries and Producing Tree Projections (Extended Abstract)	1986	PODS	4.6089395e-05
2,732	Semantic Query Optimization in the Presence of Types	2010	PODS	8.2137395e-05
8,958	Understanding Queries by Conditional Instances	2022	SIGMOD	4.417947e-05
131	Can We Use The Universal Instance Assumption Without Using Nulls?	1981	SIGMOD	0.00043719033
9,098	Querying Weak Instances	1984	PODS	4.3917473e-05
1,167	On Computing Restricted Projections of Representative Instances	1985	PODS	0.0001354084
7,070	Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions	1984	SIGMOD	4.8380576e-05