Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data 1993
DOI: 10.1145/170035.170066
|View full text |Cite
|
Sign up to set email alerts
|

Maintaining views incrementally

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
190
0
2

Year Published

1996
1996
2017
2017

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 444 publications
(192 citation statements)
references
References 14 publications
0
190
0
2
Order By: Relevance
“…The Propagation-Filtering algorithm [19] works on each removed fact separately, propagating it through to all rules which depend on it, while also after each step of the propagation performing a query for alternative support which would end the propagation. In contrast, the Delete-Rederive (DRed) algorithm [18] is rule-oriented and works on sets of facts, first over-approximating all possible deletions that may result from a change in base facts, then re-deriving any still-supported facts from the over-deleted state before finally continuing semi-naive materialization on newly added facts.…”
Section: Incremental Verificationmentioning
confidence: 99%
“…The Propagation-Filtering algorithm [19] works on each removed fact separately, propagating it through to all rules which depend on it, while also after each step of the propagation performing a query for alternative support which would end the propagation. In contrast, the Delete-Rederive (DRed) algorithm [18] is rule-oriented and works on sets of facts, first over-approximating all possible deletions that may result from a change in base facts, then re-deriving any still-supported facts from the over-deleted state before finally continuing semi-naive materialization on newly added facts.…”
Section: Incremental Verificationmentioning
confidence: 99%
“…View maintenance in conventional client/server and data warehouse environments has been addressed to a large extent (Gupta et al, 1993;Bailey et al, 1995;Zhuge et al, 1995). In general, view maintenance mechanisms could be classified into immediate update and periodic update mechanisms.…”
Section: Related Workmentioning
confidence: 99%
“…In Gupta et al (1993) the idea of associating a count attribute with each tuple in a view is proposed to avoid ambiguous view updating. The count attribute of a tuple defines the number of tuples in the deriving relations that derive the associated tuple.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…However, the difficulty and complexity of a view maintenance approach is dependent on the underlying data model. Although there have been man studies on view maintenance and materialization within the relational model [7,8], much effort is still required on view maintenance within the nested relational model and object-oriented data models in addition to the effort done in this respect e.g. [1,2,6,9,10,11].…”
Section: Introductionmentioning
confidence: 99%