Can Constant-time Maintainability Be More Practical?
Summary: Canonical algorithm for ctm schemas: maintenance via fetching a bounded number of tuples using only conjunctions of equalities (A='a') instead of arbitrary Boolean requests. Shows equality-conjunctions suffice whenever constant-time solutions exist, simplifying the model and boosting practical implementability; relates to FDs, JDs, BCNF and boundedness. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. KE WANG
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,925 | Polynomial Time Designs toward Both BCNF and Efficient Data Manipulation | 1990 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 135 | Can We Use The Universal Instance Assumption Without Using Nulls? | 1981 | SIGMOD | 0.00042421957 |
| 458 | Independent Database Schemas (Extended Abstract) | 1982 | PODS | 0.00022657396 |
| 3,917 | On The Complexity And Axiomatizability Of Consistent Database States | 1984 | PODS | 6.6328189e-05 |
| 5,841 | Constant Time Maintenance or The Triumph of the fd. | 1986 | PODS | 5.3039672e-05 |
| 7,979 | Independence-reducible Database Schemes | 1988 | PODS | 4.613363e-05 |
| 7,980 | A Characterization of Constant-time-maintainability for BCNF Database Schemes | 1988 | SIGMOD | 4.613363e-05 |
Previous
Page 1 / 1
Next