The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Maintaining views incrementally
Abstract
We present incremental evaluation algorithms to compute changes to materialized views in relational and deductive database systems, in response to changes (insertions, deletions, and updates) to the relations. The view definitions can be in SQL or Datalog, and may use UNION, negation, aggregation (e.g. SUM, MIN), linear recursion, and general recursion.We first present a counting algorithm that tracks the number of alternative derivations (counts) for each derived tuple in a view. The algorithm works with both set and duplicate semantics. We present the algorithm for nonrecursive views (with negation and aggregation), and show that the count for a tuple can be computed at little or no cost above the cost of deriving the tuple. The algorithm is optimal in that it computes exactly those view tuples that are inserted or deleted. Note that we store only the number of derivations, not the derivations themselves.We then present the Delete and Rederive algorithm, DRed, for incremental maintenance of recursive views (negation and aggregation are permitted). The algorithm works by first deleting a superset of the tuples that need to be deleted, and then rederiving some of them. The algorithm can also be used when the view definition is itself altered.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1988) · Computer Science Press, Inc. eBooks · Cited by 1,435
Efficiently updating materialized views
Blakeley, J. A., Larson, P.-A., & Tompa, F. W. (1986) · ACM SIGMOD Record · doi:10.1145/16856.16861 · Cited by 429
Principles of Database and Knowledge-Base Systems Volume II: The New Technologies
Ullman, J. D. (1989) · Cited by 373
Negation as failure using tight derivations for general logic programs
Van Gelder, A. (1989) · The Journal of Logic Programming · doi:10.1016/0743-1066(89)90032-0 · Cited by 242
Efficiently monitoring relational databases
Buneman, O. P., & Clemons, E. K. (1979) · ACM Transactions on Database Systems · doi:10.1145/320083.320099 · Cited by 182
On the efficient computation of the difference between consecutive database states
Küchenhoff, V. (1991) · Lecture notes in computer science · doi:10.1007/3-540-55015-1_26 · Cited by 77
Incremental evaluation of rules and its relationship to parallelism
Wolfson, O., Dewan, H. M., Stolfo, S. J., & Yemini, Y. (1991) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/115790.115799 · Cited by 34
Finiteness Properties of Database Queries.
Mumick, I. S., & Shmueli, O. (1993) · Cited by 23
Self-citationQuery optimization in deductive and relational databases
Mumick, I. S. (1992) · Stanford University eBooks · Cited by 22
Self-citation
Cited by
ProbView: a flexible probabilistic database system
Lakshmanan, L. V. S., Leone, N., Ross, R., & Subrahmanian, V. S. (1997) · ACM Transactions on Database Systems · doi:10.1145/261124.261131 · Cited by 338
Self-citationContinual queries for Internet scale event-driven information delivery
Liu, L., Pu, C., & Tang, W. (1999) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.790816 · Cited by 332
Design and implementation of the LogicBlox system
Aref, M., ten Cate, B., Green, T. J., Kimelfeld, B., Olteanu, D., Pasalic, E., Veldhuizen, T. L., & Washburn, G. (2015) · Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2723372.2742796 · Cited by 233
DBSP: Automatic Incremental View Maintenance for Rich Query Languages
Budiu, M., Chajed, T., McSherry, F., Ryzhyk, L., & Tannen, V. (2023) · Proceedings of the VLDB Endowment · doi:10.14778/3587136.3587137 · Cited by 31
Metadata
- Authors
- Gupta, A., Mumick, I. S., & Subrahmanian, V. S.
- Venue
- Proceedings of the 1993 ACM SIGMOD international conference on Management of data
- Publisher
- ACM
- Published
- 1993-06
- Pages
- 157-166
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2012670464
- Cited by
- 654
- References
- 9
- FWCI
- 22.17
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Maintaining views incrementally. https://app.cochat.ai/papers/10.1145/170035.170066
- The paper
- Gupta, A., Mumick, I. S., & Subrahmanian, V. S. (1993). Maintaining views incrementally. Proceedings of the 1993 ACM SIGMOD international conference on Management of data. https://doi.org/10.1145/170035.170066
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
