.png){kind=icon}
返回
Incremental computation of set difference views
.png){kind=icon}
PRE
AI
DOI：10.1109/69.591450.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Views can be computed by means of recomputation or they can be computed incrementally. Incremental view computation outperforms view recomputation in many situations. This is, in particular, true in distributed database environments like data warehousing environments. We present and analyze two algorithms for the incremental computation of relational set difference views. Set differences occur naturally in the definition of the set-division operator and in rewritten nested queries. The I/O efficiency of the incremental algorithms is compared to each other and to efficient recomputation algorithms. Our cost analysis strongly. indicates that incremental computation of set difference views outperforms recomputation of set difference views in many situations.
Keyword:
set differences
incremental view computation
view pointer caches
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.9K
被引数:
3.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Raman spectroscopic investigations of epitaxial BiFeO3 thin films on rare earth scandate substrates
PREAI
分享收藏
查看更多内容