The DOI matches its Crossref record; 10 of the 10 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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Deriving Production Rules for Incremental View Maintenance
Ceri, S., & Widom, J. (1999) · Materialized Views · doi:10.7551/mitpress/4472.003.0035 · Cited by 330
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 82
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
The CQL continuous query language: semantic foundations and query execution
Arasu, A., Babu, S., & Widom, J. (2006) · The VLDB Journal · doi:10.1007/s00778-004-0147-z · Cited by 1,170
View maintenance in a warehousing environment
Zhuge, Y., García-Molina, H., Hammer, J., & Widom, J. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223848 · Cited by 430
Optimizing queries with materialized views
Chaudhuri, S., Krishnamurthy, R., Potamianos, S., & Shim, K. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380392 · Cited by 374
Managing semantic heterogeneity in databases: a theoretical prospective
Hull, R. (1997) · Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/263661.263668 · Cited by 359
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-citation
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
- 10
- 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
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.