Independence-reducible Database Schemes

Summary: Introduces independence-reducible cover-embedding schemes, proves they are bounded and algebraic-maintainable, and shows they properly subsume all previously known bounded/constant-time-maintainable cover-embedding BCNF classes. Provides an exact efficient recognition algorithm and an efficiently testable characterization for the contained constant-time-maintainable subclass, assuming a cover of the functional dependencies is embedded as key dependencies. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: h7b0773f5fd31bbac
Venue: PODS
Year: 1988
Pagerank: 5.3350162e-05
Overall Rank: 8,465 | 43.09%
DOI: 10.1145/308386.308431

Incoming Non-self Citations Over Time

Authors

1. Edward P.F. Chan (University of Waterloo)
2. Hector J. Hernandez (Texas A&M University)

BibTeX Citation

@inproceedings{chan_pods88,
        address = {New York, NY, USA},
        series = {{PODS} '88},
        title = {{Independence-reducible Database Schemes}},
        url = {https://dl.acm.org/doi/10.1145/308386.308431},
        doi = {10.1145/308386.308431},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Chan, Edward P.F. and Hernandez, Hector J.},
        year = {1988}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
8,466	A Characterization of Constant-time-maintainability for BCNF Database Schemes	1988	SIGMOD	5.3350162e-05
13,424	Can Constant-time Maintainability Be More Practical?	1989	PODS	4.9793485e-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
41	Testing Implications Of Data Dependencies	1979	SIGMOD	0.00045899672
278	Can We Use The Universal Instance Assumption Without Using Nulls?	1981	SIGMOD	0.00022313978
769	Independent Database Schemas (Extended Abstract)	1982	PODS	0.00014104125
3,619	Efficient Query Answering in the Representative Instance Approach	1985	PODS	7.1558272e-05
5,480	Constant Time Maintenance or The Triumph of the fd.	1986	PODS	6.1130394e-05
7,279	Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions	1984	SIGMOD	5.5671882e-05
13,461	On Designing Database Schemes Bounded or Constant-time-maintainable with respect to Functional Dependencies	1987	PODS	4.9793485e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	769	Independent Database Schemas (Extended Abstract)	1982	PODS
2	6,834	Properties Of Database Schemata With Functional Dependencies	1984	PODS
3	1,455	On Computing Restricted Projections of Representative Instances	1985	PODS
4	7,966	A New Characterization of Independence	1983	SIGMOD
5	8,466	A Characterization of Constant-time-maintainability for BCNF Database Schemes	1988	SIGMOD
6	13,460	Logical Design of Relational Database Schemes	1987	PODS
7	13,474	Independent Database Schemes Under Functional and Inclusion Dependencies	1987	VLDB
8	6,281	Independent and Separable Database Schemes	1983	PODS
9	5,370	Computing Covers for Embedded Functional Dependencies	1987	PODS
10	13,410	Polynomial Time Designs toward Both BCNF and Efficient Data Manipulation	1990	SIGMOD